/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 16:14:08,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 16:14:08,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 16:14:08,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 16:14:08,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 16:14:08,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 16:14:08,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 16:14:08,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 16:14:08,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 16:14:08,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 16:14:08,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 16:14:08,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 16:14:08,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 16:14:08,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 16:14:08,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 16:14:08,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 16:14:08,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 16:14:08,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 16:14:08,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 16:14:08,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 16:14:08,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 16:14:08,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 16:14:08,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 16:14:08,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 16:14:08,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 16:14:08,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 16:14:08,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 16:14:08,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 16:14:08,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 16:14:08,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 16:14:08,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 16:14:08,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 16:14:08,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 16:14:08,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 16:14:08,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 16:14:08,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 16:14:08,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 16:14:08,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 16:14:08,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 16:14:08,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 16:14:08,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 16:14:08,952 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 16:14:08,960 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 16:14:08,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 16:14:08,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 16:14:08,961 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 16:14:08,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 16:14:08,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 16:14:08,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 16:14:08,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 16:14:08,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 16:14:08,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 16:14:08,962 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 16:14:08,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 16:14:08,962 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 16:14:08,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 16:14:08,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 16:14:08,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 16:14:08,962 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 16:14:08,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 16:14:08,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:14:08,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 16:14:08,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 16:14:08,963 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 16:14:08,963 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 16:14:09,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 16:14:09,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 16:14:09,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 16:14:09,177 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 16:14:09,178 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 16:14:09,179 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2022-01-31 16:14:09,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/832a8c872/aa24cb998a4d45998a6ecc3e83abb888/FLAG6ae5cabda [2022-01-31 16:14:09,713 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 16:14:09,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2022-01-31 16:14:09,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/832a8c872/aa24cb998a4d45998a6ecc3e83abb888/FLAG6ae5cabda [2022-01-31 16:14:09,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/832a8c872/aa24cb998a4d45998a6ecc3e83abb888 [2022-01-31 16:14:09,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 16:14:09,751 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 16:14:09,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 16:14:09,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 16:14:09,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 16:14:09,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:14:09" (1/1) ... [2022-01-31 16:14:09,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69348506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:09, skipping insertion in model container [2022-01-31 16:14:09,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:14:09" (1/1) ... [2022-01-31 16:14:09,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 16:14:09,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 16:14:09,999 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-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2022-01-31 16:14:10,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:14:10,175 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 16:14:10,183 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-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2022-01-31 16:14:10,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 16:14:10,282 INFO L208 MainTranslator]: Completed translation [2022-01-31 16:14:10,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:10 WrapperNode [2022-01-31 16:14:10,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 16:14:10,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 16:14:10,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 16:14:10,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 16:14:10,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:10" (1/1) ... [2022-01-31 16:14:10,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:10" (1/1) ... [2022-01-31 16:14:10,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:10" (1/1) ... [2022-01-31 16:14:10,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:10" (1/1) ... [2022-01-31 16:14:10,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:10" (1/1) ... [2022-01-31 16:14:10,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:10" (1/1) ... [2022-01-31 16:14:10,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:10" (1/1) ... [2022-01-31 16:14:10,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 16:14:10,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 16:14:10,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 16:14:10,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 16:14:10,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:10" (1/1) ... [2022-01-31 16:14:10,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 16:14:10,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 16:14:10,431 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 16:14:10,433 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 16:14:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 16:14:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 16:14:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 16:14:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 16:14:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 16:14:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-01-31 16:14:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-01-31 16:14:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2022-01-31 16:14:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2022-01-31 16:14:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2022-01-31 16:14:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-01-31 16:14:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-01-31 16:14:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2022-01-31 16:14:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2022-01-31 16:14:10,458 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2022-01-31 16:14:10,459 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2022-01-31 16:14:10,459 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2022-01-31 16:14:10,459 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-01-31 16:14:10,459 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2022-01-31 16:14:10,459 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-01-31 16:14:10,459 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2022-01-31 16:14:10,459 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2022-01-31 16:14:10,460 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 16:14:10,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 16:14:10,460 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 16:14:10,460 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 16:14:10,460 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 16:14:10,460 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 16:14:10,461 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 16:14:10,461 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-01-31 16:14:10,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-01-31 16:14:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 16:14:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 16:14:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 16:14:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 16:14:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 16:14:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 16:14:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 16:14:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-01-31 16:14:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-01-31 16:14:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2022-01-31 16:14:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2022-01-31 16:14:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2022-01-31 16:14:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-01-31 16:14:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-01-31 16:14:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2022-01-31 16:14:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2022-01-31 16:14:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2022-01-31 16:14:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2022-01-31 16:14:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-01-31 16:14:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2022-01-31 16:14:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-01-31 16:14:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2022-01-31 16:14:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 16:14:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 16:14:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 16:14:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-01-31 16:14:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-01-31 16:14:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 16:14:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 16:14:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 16:14:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2022-01-31 16:14:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2022-01-31 16:14:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 16:14:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 16:14:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 16:14:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 16:14:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 16:14:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 16:14:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 16:14:10,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 16:14:10,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 16:14:10,672 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 16:14:10,674 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 16:14:10,794 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:10,861 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-01-31 16:14:10,861 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-01-31 16:14:10,864 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:10,893 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-01-31 16:14:10,893 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-01-31 16:14:10,915 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:10,926 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 16:14:10,926 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 16:14:10,969 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:10,996 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-01-31 16:14:10,997 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: #res := 0; [2022-01-31 16:14:10,997 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-01-31 16:14:11,000 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:11,081 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2022-01-31 16:14:11,082 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2022-01-31 16:14:11,082 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:11,103 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-01-31 16:14:11,103 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-01-31 16:14:11,124 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:11,141 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-01-31 16:14:11,141 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-01-31 16:14:11,144 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:11,282 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-01-31 16:14:11,282 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-01-31 16:14:11,290 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 16:14:11,292 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 16:14:11,292 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 16:14:11,313 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 16:14:11,327 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 16:14:11,327 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 16:14:11,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:14:11 BoogieIcfgContainer [2022-01-31 16:14:11,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 16:14:11,331 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 16:14:11,331 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 16:14:11,333 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 16:14:11,335 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:14:11" (1/1) ... [2022-01-31 16:14:11,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:14:11 BasicIcfg [2022-01-31 16:14:11,382 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 16:14:11,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 16:14:11,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 16:14:11,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 16:14:11,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:14:09" (1/4) ... [2022-01-31 16:14:11,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4161db62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:14:11, skipping insertion in model container [2022-01-31 16:14:11,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:14:10" (2/4) ... [2022-01-31 16:14:11,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4161db62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:14:11, skipping insertion in model container [2022-01-31 16:14:11,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:14:11" (3/4) ... [2022-01-31 16:14:11,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4161db62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:14:11, skipping insertion in model container [2022-01-31 16:14:11,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 04:14:11" (4/4) ... [2022-01-31 16:14:11,388 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.cJordan [2022-01-31 16:14:11,391 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 16:14:11,392 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 16:14:11,426 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 16:14:11,432 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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=FAST_UPR [2022-01-31 16:14:11,432 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 16:14:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 517 states, 383 states have (on average 1.4882506527415145) internal successors, (570), 404 states have internal predecessors, (570), 103 states have call successors, (103), 29 states have call predecessors, (103), 29 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2022-01-31 16:14:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 16:14:11,455 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:11,455 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] [2022-01-31 16:14:11,455 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:11,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash 784814983, now seen corresponding path program 1 times [2022-01-31 16:14:11,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:11,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817918941] [2022-01-31 16:14:11,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:11,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:11,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:11,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:11,737 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 16:14:11,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:11,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817918941] [2022-01-31 16:14:11,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817918941] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:11,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:11,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 16:14:11,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037734645] [2022-01-31 16:14:11,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:11,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 16:14:11,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:11,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 16:14:11,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 16:14:11,766 INFO L87 Difference]: Start difference. First operand has 517 states, 383 states have (on average 1.4882506527415145) internal successors, (570), 404 states have internal predecessors, (570), 103 states have call successors, (103), 29 states have call predecessors, (103), 29 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 16:14:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:13,699 INFO L93 Difference]: Finished difference Result 681 states and 1043 transitions. [2022-01-31 16:14:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:14:13,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-01-31 16:14:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:13,712 INFO L225 Difference]: With dead ends: 681 [2022-01-31 16:14:13,712 INFO L226 Difference]: Without dead ends: 665 [2022-01-31 16:14:13,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:14:13,715 INFO L933 BasicCegarLoop]: 741 mSDtfsCounter, 399 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:13,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 1013 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 16:14:13,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-01-31 16:14:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 509. [2022-01-31 16:14:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 378 states have (on average 1.4576719576719577) internal successors, (551), 397 states have internal predecessors, (551), 103 states have call successors, (103), 29 states have call predecessors, (103), 27 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2022-01-31 16:14:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 740 transitions. [2022-01-31 16:14:13,796 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 740 transitions. Word has length 20 [2022-01-31 16:14:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:13,797 INFO L470 AbstractCegarLoop]: Abstraction has 509 states and 740 transitions. [2022-01-31 16:14:13,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 16:14:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 740 transitions. [2022-01-31 16:14:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 16:14:13,798 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:13,798 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] [2022-01-31 16:14:13,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 16:14:13,798 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash -30338372, now seen corresponding path program 1 times [2022-01-31 16:14:13,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:13,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341921463] [2022-01-31 16:14:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:13,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:13,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:13,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:13,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:13,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 16:14:13,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:13,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341921463] [2022-01-31 16:14:13,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341921463] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:13,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:13,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:14:13,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730492510] [2022-01-31 16:14:13,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:13,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:14:13,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:13,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:14:13,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:14:13,967 INFO L87 Difference]: Start difference. First operand 509 states and 740 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:14:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:15,254 INFO L93 Difference]: Finished difference Result 847 states and 1261 transitions. [2022-01-31 16:14:15,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:14:15,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-01-31 16:14:15,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:15,267 INFO L225 Difference]: With dead ends: 847 [2022-01-31 16:14:15,267 INFO L226 Difference]: Without dead ends: 846 [2022-01-31 16:14:15,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:14:15,272 INFO L933 BasicCegarLoop]: 851 mSDtfsCounter, 1498 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:15,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1502 Valid, 1023 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 16:14:15,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2022-01-31 16:14:15,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 664. [2022-01-31 16:14:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 502 states have (on average 1.408366533864542) internal successors, (707), 510 states have internal predecessors, (707), 112 states have call successors, (112), 40 states have call predecessors, (112), 49 states have return successors, (145), 119 states have call predecessors, (145), 99 states have call successors, (145) [2022-01-31 16:14:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 964 transitions. [2022-01-31 16:14:15,314 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 964 transitions. Word has length 25 [2022-01-31 16:14:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:15,315 INFO L470 AbstractCegarLoop]: Abstraction has 664 states and 964 transitions. [2022-01-31 16:14:15,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:14:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 964 transitions. [2022-01-31 16:14:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 16:14:15,316 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:15,316 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] [2022-01-31 16:14:15,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 16:14:15,317 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:15,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:15,317 INFO L85 PathProgramCache]: Analyzing trace with hash -759392990, now seen corresponding path program 1 times [2022-01-31 16:14:15,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:15,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796060379] [2022-01-31 16:14:15,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:15,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:15,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:15,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:15,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:15,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 16:14:15,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:15,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796060379] [2022-01-31 16:14:15,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796060379] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:15,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:15,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:14:15,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245145900] [2022-01-31 16:14:15,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:15,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:14:15,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:15,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:14:15,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:14:15,444 INFO L87 Difference]: Start difference. First operand 664 states and 964 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:14:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:17,114 INFO L93 Difference]: Finished difference Result 970 states and 1415 transitions. [2022-01-31 16:14:17,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:14:17,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2022-01-31 16:14:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:17,118 INFO L225 Difference]: With dead ends: 970 [2022-01-31 16:14:17,118 INFO L226 Difference]: Without dead ends: 970 [2022-01-31 16:14:17,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:14:17,119 INFO L933 BasicCegarLoop]: 725 mSDtfsCounter, 1121 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:17,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1131 Valid, 886 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1647 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 16:14:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-01-31 16:14:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 789. [2022-01-31 16:14:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 611 states have (on average 1.4042553191489362) internal successors, (858), 615 states have internal predecessors, (858), 114 states have call successors, (114), 46 states have call predecessors, (114), 63 states have return successors, (163), 130 states have call predecessors, (163), 104 states have call successors, (163) [2022-01-31 16:14:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1135 transitions. [2022-01-31 16:14:17,138 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1135 transitions. Word has length 30 [2022-01-31 16:14:17,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:17,139 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1135 transitions. [2022-01-31 16:14:17,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:14:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1135 transitions. [2022-01-31 16:14:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 16:14:17,146 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:17,146 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 16:14:17,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 16:14:17,146 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:17,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:17,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1280175921, now seen corresponding path program 1 times [2022-01-31 16:14:17,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:17,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848436086] [2022-01-31 16:14:17,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:17,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:17,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:17,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:17,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:17,273 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 16:14:17,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:17,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848436086] [2022-01-31 16:14:17,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848436086] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:17,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:17,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:14:17,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670768463] [2022-01-31 16:14:17,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:17,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:14:17,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:17,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:14:17,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:14:17,276 INFO L87 Difference]: Start difference. First operand 789 states and 1135 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:14:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:18,926 INFO L93 Difference]: Finished difference Result 1344 states and 2031 transitions. [2022-01-31 16:14:18,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 16:14:18,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-01-31 16:14:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:18,930 INFO L225 Difference]: With dead ends: 1344 [2022-01-31 16:14:18,930 INFO L226 Difference]: Without dead ends: 1344 [2022-01-31 16:14:18,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:14:18,931 INFO L933 BasicCegarLoop]: 1006 mSDtfsCounter, 1482 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 529 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:18,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1485 Valid, 1262 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [529 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 16:14:18,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2022-01-31 16:14:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 907. [2022-01-31 16:14:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 708 states have (on average 1.4138418079096045) internal successors, (1001), 711 states have internal predecessors, (1001), 127 states have call successors, (127), 54 states have call predecessors, (127), 71 states have return successors, (220), 144 states have call predecessors, (220), 117 states have call successors, (220) [2022-01-31 16:14:18,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1348 transitions. [2022-01-31 16:14:18,951 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1348 transitions. Word has length 31 [2022-01-31 16:14:18,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:18,951 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 1348 transitions. [2022-01-31 16:14:18,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:14:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1348 transitions. [2022-01-31 16:14:18,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 16:14:18,953 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:18,953 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] [2022-01-31 16:14:18,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 16:14:18,953 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:18,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash 998226604, now seen corresponding path program 1 times [2022-01-31 16:14:18,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:18,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653961679] [2022-01-31 16:14:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:18,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:19,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:19,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:19,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:19,117 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 16:14:19,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:19,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653961679] [2022-01-31 16:14:19,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653961679] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:19,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:19,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 16:14:19,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770359005] [2022-01-31 16:14:19,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:19,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 16:14:19,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:19,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 16:14:19,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:14:19,119 INFO L87 Difference]: Start difference. First operand 907 states and 1348 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 16:14:20,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:20,710 INFO L93 Difference]: Finished difference Result 1046 states and 1583 transitions. [2022-01-31 16:14:20,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:14:20,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-01-31 16:14:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:20,716 INFO L225 Difference]: With dead ends: 1046 [2022-01-31 16:14:20,716 INFO L226 Difference]: Without dead ends: 1046 [2022-01-31 16:14:20,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:14:20,717 INFO L933 BasicCegarLoop]: 743 mSDtfsCounter, 3728 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 1329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3734 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1329 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:20,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3734 Valid, 890 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1329 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 16:14:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2022-01-31 16:14:20,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 835. [2022-01-31 16:14:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 649 states have (on average 1.399075500770416) internal successors, (908), 653 states have internal predecessors, (908), 118 states have call successors, (118), 50 states have call predecessors, (118), 67 states have return successors, (177), 134 states have call predecessors, (177), 108 states have call successors, (177) [2022-01-31 16:14:20,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1203 transitions. [2022-01-31 16:14:20,754 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1203 transitions. Word has length 32 [2022-01-31 16:14:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:20,756 INFO L470 AbstractCegarLoop]: Abstraction has 835 states and 1203 transitions. [2022-01-31 16:14:20,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 16:14:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1203 transitions. [2022-01-31 16:14:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 16:14:20,758 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:20,758 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] [2022-01-31 16:14:20,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 16:14:20,758 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:20,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:20,759 INFO L85 PathProgramCache]: Analyzing trace with hash 936943045, now seen corresponding path program 1 times [2022-01-31 16:14:20,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:20,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187744596] [2022-01-31 16:14:20,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:20,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:20,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:20,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:20,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:20,851 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 16:14:20,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:20,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187744596] [2022-01-31 16:14:20,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187744596] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:20,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:20,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:14:20,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223567843] [2022-01-31 16:14:20,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:20,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:14:20,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:20,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:14:20,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:14:20,859 INFO L87 Difference]: Start difference. First operand 835 states and 1203 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:14:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:22,242 INFO L93 Difference]: Finished difference Result 961 states and 1420 transitions. [2022-01-31 16:14:22,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:14:22,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-01-31 16:14:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:22,248 INFO L225 Difference]: With dead ends: 961 [2022-01-31 16:14:22,248 INFO L226 Difference]: Without dead ends: 961 [2022-01-31 16:14:22,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:14:22,248 INFO L933 BasicCegarLoop]: 713 mSDtfsCounter, 422 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:22,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 960 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 16:14:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2022-01-31 16:14:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 834. [2022-01-31 16:14:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 649 states have (on average 1.3959938366718028) internal successors, (906), 652 states have internal predecessors, (906), 117 states have call successors, (117), 50 states have call predecessors, (117), 67 states have return successors, (177), 134 states have call predecessors, (177), 108 states have call successors, (177) [2022-01-31 16:14:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1200 transitions. [2022-01-31 16:14:22,265 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1200 transitions. Word has length 36 [2022-01-31 16:14:22,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:22,266 INFO L470 AbstractCegarLoop]: Abstraction has 834 states and 1200 transitions. [2022-01-31 16:14:22,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:14:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1200 transitions. [2022-01-31 16:14:22,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 16:14:22,267 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:22,268 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] [2022-01-31 16:14:22,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 16:14:22,268 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:22,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:22,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1670644950, now seen corresponding path program 1 times [2022-01-31 16:14:22,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:22,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407327781] [2022-01-31 16:14:22,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:22,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:22,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:22,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:22,407 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 16:14:22,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:22,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407327781] [2022-01-31 16:14:22,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407327781] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:22,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:22,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 16:14:22,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024887337] [2022-01-31 16:14:22,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:22,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 16:14:22,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:22,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 16:14:22,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:14:22,409 INFO L87 Difference]: Start difference. First operand 834 states and 1200 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:14:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:24,056 INFO L93 Difference]: Finished difference Result 999 states and 1436 transitions. [2022-01-31 16:14:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:14:24,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-01-31 16:14:24,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:24,062 INFO L225 Difference]: With dead ends: 999 [2022-01-31 16:14:24,062 INFO L226 Difference]: Without dead ends: 999 [2022-01-31 16:14:24,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:14:24,063 INFO L933 BasicCegarLoop]: 821 mSDtfsCounter, 1114 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 2508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:24,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1116 Valid, 1288 Invalid, 2508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 2126 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 16:14:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-01-31 16:14:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 736. [2022-01-31 16:14:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 571 states have (on average 1.3870402802101576) internal successors, (792), 575 states have internal predecessors, (792), 106 states have call successors, (106), 45 states have call predecessors, (106), 58 states have return successors, (131), 118 states have call predecessors, (131), 97 states have call successors, (131) [2022-01-31 16:14:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1029 transitions. [2022-01-31 16:14:24,076 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1029 transitions. Word has length 39 [2022-01-31 16:14:24,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:24,076 INFO L470 AbstractCegarLoop]: Abstraction has 736 states and 1029 transitions. [2022-01-31 16:14:24,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:14:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1029 transitions. [2022-01-31 16:14:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 16:14:24,078 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:24,078 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] [2022-01-31 16:14:24,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 16:14:24,078 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:24,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:24,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1528829481, now seen corresponding path program 1 times [2022-01-31 16:14:24,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:24,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292325406] [2022-01-31 16:14:24,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:24,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:24,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:24,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:24,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:24,217 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 16:14:24,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:24,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292325406] [2022-01-31 16:14:24,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292325406] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:24,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:24,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 16:14:24,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331784821] [2022-01-31 16:14:24,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:24,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 16:14:24,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:24,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 16:14:24,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 16:14:24,219 INFO L87 Difference]: Start difference. First operand 736 states and 1029 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:14:25,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:25,099 INFO L93 Difference]: Finished difference Result 959 states and 1380 transitions. [2022-01-31 16:14:25,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 16:14:25,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-01-31 16:14:25,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:25,102 INFO L225 Difference]: With dead ends: 959 [2022-01-31 16:14:25,102 INFO L226 Difference]: Without dead ends: 959 [2022-01-31 16:14:25,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:14:25,103 INFO L933 BasicCegarLoop]: 672 mSDtfsCounter, 1857 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1865 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:25,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1865 Valid, 754 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:14:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-01-31 16:14:25,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 762. [2022-01-31 16:14:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 595 states have (on average 1.3983193277310924) internal successors, (832), 608 states have internal predecessors, (832), 108 states have call successors, (108), 48 states have call predecessors, (108), 58 states have return successors, (124), 110 states have call predecessors, (124), 100 states have call successors, (124) [2022-01-31 16:14:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1064 transitions. [2022-01-31 16:14:25,118 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1064 transitions. Word has length 40 [2022-01-31 16:14:25,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:25,119 INFO L470 AbstractCegarLoop]: Abstraction has 762 states and 1064 transitions. [2022-01-31 16:14:25,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 16:14:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1064 transitions. [2022-01-31 16:14:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 16:14:25,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:25,123 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] [2022-01-31 16:14:25,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 16:14:25,124 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:25,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash 689414503, now seen corresponding path program 1 times [2022-01-31 16:14:25,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:25,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851304244] [2022-01-31 16:14:25,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:25,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:25,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:25,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:25,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:25,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 16:14:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:25,227 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 16:14:25,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:25,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851304244] [2022-01-31 16:14:25,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851304244] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:25,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:25,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 16:14:25,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730274594] [2022-01-31 16:14:25,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:25,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 16:14:25,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:25,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 16:14:25,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:14:25,230 INFO L87 Difference]: Start difference. First operand 762 states and 1064 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 16:14:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:26,209 INFO L93 Difference]: Finished difference Result 942 states and 1357 transitions. [2022-01-31 16:14:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:14:26,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-01-31 16:14:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:26,213 INFO L225 Difference]: With dead ends: 942 [2022-01-31 16:14:26,213 INFO L226 Difference]: Without dead ends: 942 [2022-01-31 16:14:26,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:14:26,213 INFO L933 BasicCegarLoop]: 791 mSDtfsCounter, 936 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:26,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [942 Valid, 1318 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 16:14:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2022-01-31 16:14:26,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 762. [2022-01-31 16:14:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 595 states have (on average 1.3966386554621848) internal successors, (831), 608 states have internal predecessors, (831), 108 states have call successors, (108), 48 states have call predecessors, (108), 58 states have return successors, (124), 110 states have call predecessors, (124), 100 states have call successors, (124) [2022-01-31 16:14:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1063 transitions. [2022-01-31 16:14:26,227 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1063 transitions. Word has length 46 [2022-01-31 16:14:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:26,227 INFO L470 AbstractCegarLoop]: Abstraction has 762 states and 1063 transitions. [2022-01-31 16:14:26,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 16:14:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1063 transitions. [2022-01-31 16:14:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 16:14:26,229 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:26,229 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] [2022-01-31 16:14:26,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 16:14:26,229 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:26,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:26,230 INFO L85 PathProgramCache]: Analyzing trace with hash -735623654, now seen corresponding path program 1 times [2022-01-31 16:14:26,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:26,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414689424] [2022-01-31 16:14:26,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:26,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:26,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:26,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:26,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:26,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 16:14:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:26,328 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 16:14:26,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:26,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414689424] [2022-01-31 16:14:26,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414689424] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:26,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:26,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 16:14:26,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242955867] [2022-01-31 16:14:26,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:26,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 16:14:26,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:26,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 16:14:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:14:26,330 INFO L87 Difference]: Start difference. First operand 762 states and 1063 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 7 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 16:14:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:27,491 INFO L93 Difference]: Finished difference Result 897 states and 1299 transitions. [2022-01-31 16:14:27,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:14:27,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 7 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-01-31 16:14:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:27,494 INFO L225 Difference]: With dead ends: 897 [2022-01-31 16:14:27,494 INFO L226 Difference]: Without dead ends: 897 [2022-01-31 16:14:27,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:14:27,495 INFO L933 BasicCegarLoop]: 667 mSDtfsCounter, 1507 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:27,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1513 Valid, 1140 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 16:14:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-01-31 16:14:27,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 751. [2022-01-31 16:14:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 588 states have (on average 1.3979591836734695) internal successors, (822), 601 states have internal predecessors, (822), 106 states have call successors, (106), 46 states have call predecessors, (106), 56 states have return successors, (122), 108 states have call predecessors, (122), 98 states have call successors, (122) [2022-01-31 16:14:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1050 transitions. [2022-01-31 16:14:27,508 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1050 transitions. Word has length 47 [2022-01-31 16:14:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:27,509 INFO L470 AbstractCegarLoop]: Abstraction has 751 states and 1050 transitions. [2022-01-31 16:14:27,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 7 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 16:14:27,509 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1050 transitions. [2022-01-31 16:14:27,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 16:14:27,510 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:27,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:14:27,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 16:14:27,510 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:27,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1452242056, now seen corresponding path program 1 times [2022-01-31 16:14:27,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:27,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255251264] [2022-01-31 16:14:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:27,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:27,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:27,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:27,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:27,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:14:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:27,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:27,647 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 16:14:27,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:27,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255251264] [2022-01-31 16:14:27,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255251264] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:27,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:27,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:14:27,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719289264] [2022-01-31 16:14:27,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:27,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:14:27,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:27,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:14:27,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:14:27,649 INFO L87 Difference]: Start difference. First operand 751 states and 1050 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 16:14:29,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:29,961 INFO L93 Difference]: Finished difference Result 1006 states and 1439 transitions. [2022-01-31 16:14:29,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 16:14:29,961 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2022-01-31 16:14:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:29,964 INFO L225 Difference]: With dead ends: 1006 [2022-01-31 16:14:29,964 INFO L226 Difference]: Without dead ends: 1006 [2022-01-31 16:14:29,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-01-31 16:14:29,965 INFO L933 BasicCegarLoop]: 754 mSDtfsCounter, 1443 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 3325 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 3770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 3325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:29,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1472 Valid, 2000 Invalid, 3770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 3325 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 16:14:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2022-01-31 16:14:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 794. [2022-01-31 16:14:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 623 states have (on average 1.3964686998394864) internal successors, (870), 635 states have internal predecessors, (870), 110 states have call successors, (110), 49 states have call predecessors, (110), 60 states have return successors, (131), 114 states have call predecessors, (131), 102 states have call successors, (131) [2022-01-31 16:14:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1111 transitions. [2022-01-31 16:14:29,978 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1111 transitions. Word has length 48 [2022-01-31 16:14:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:29,978 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 1111 transitions. [2022-01-31 16:14:29,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 16:14:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1111 transitions. [2022-01-31 16:14:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 16:14:29,979 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:29,979 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] [2022-01-31 16:14:29,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 16:14:29,980 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:29,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:29,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1568241764, now seen corresponding path program 1 times [2022-01-31 16:14:29,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:29,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99181416] [2022-01-31 16:14:29,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:29,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:30,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:30,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:30,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:30,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:14:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:30,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:30,112 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 16:14:30,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:30,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99181416] [2022-01-31 16:14:30,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99181416] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:30,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:30,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:14:30,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956724267] [2022-01-31 16:14:30,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:30,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:14:30,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:30,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:14:30,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:14:30,114 INFO L87 Difference]: Start difference. First operand 794 states and 1111 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:14:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:31,731 INFO L93 Difference]: Finished difference Result 924 states and 1335 transitions. [2022-01-31 16:14:31,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:14:31,731 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-01-31 16:14:31,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:31,734 INFO L225 Difference]: With dead ends: 924 [2022-01-31 16:14:31,734 INFO L226 Difference]: Without dead ends: 924 [2022-01-31 16:14:31,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-01-31 16:14:31,735 INFO L933 BasicCegarLoop]: 652 mSDtfsCounter, 1534 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:31,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1545 Valid, 1454 Invalid, 2168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 16:14:31,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2022-01-31 16:14:31,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 797. [2022-01-31 16:14:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 626 states have (on average 1.3961661341853036) internal successors, (874), 638 states have internal predecessors, (874), 110 states have call successors, (110), 49 states have call predecessors, (110), 60 states have return successors, (131), 114 states have call predecessors, (131), 102 states have call successors, (131) [2022-01-31 16:14:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1115 transitions. [2022-01-31 16:14:31,748 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1115 transitions. Word has length 50 [2022-01-31 16:14:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:31,748 INFO L470 AbstractCegarLoop]: Abstraction has 797 states and 1115 transitions. [2022-01-31 16:14:31,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:14:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1115 transitions. [2022-01-31 16:14:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 16:14:31,749 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:31,749 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] [2022-01-31 16:14:31,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 16:14:31,750 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:31,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:31,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1729653179, now seen corresponding path program 1 times [2022-01-31 16:14:31,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:31,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737964586] [2022-01-31 16:14:31,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:31,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:31,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:31,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:31,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:31,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:14:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:31,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:31,899 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 16:14:31,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:31,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737964586] [2022-01-31 16:14:31,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737964586] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:31,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:31,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:14:31,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683246003] [2022-01-31 16:14:31,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:31,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:14:31,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:31,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:14:31,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:14:31,901 INFO L87 Difference]: Start difference. First operand 797 states and 1115 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 16:14:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:33,942 INFO L93 Difference]: Finished difference Result 914 states and 1320 transitions. [2022-01-31 16:14:33,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:14:33,942 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-01-31 16:14:33,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:33,945 INFO L225 Difference]: With dead ends: 914 [2022-01-31 16:14:33,945 INFO L226 Difference]: Without dead ends: 914 [2022-01-31 16:14:33,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-01-31 16:14:33,945 INFO L933 BasicCegarLoop]: 652 mSDtfsCounter, 1576 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 2993 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 3404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 2993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:33,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1585 Valid, 1818 Invalid, 3404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 2993 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-31 16:14:33,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2022-01-31 16:14:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 792. [2022-01-31 16:14:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 621 states have (on average 1.391304347826087) internal successors, (864), 633 states have internal predecessors, (864), 110 states have call successors, (110), 49 states have call predecessors, (110), 60 states have return successors, (131), 114 states have call predecessors, (131), 102 states have call successors, (131) [2022-01-31 16:14:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1105 transitions. [2022-01-31 16:14:33,958 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1105 transitions. Word has length 50 [2022-01-31 16:14:33,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:33,958 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 1105 transitions. [2022-01-31 16:14:33,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 16:14:33,958 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1105 transitions. [2022-01-31 16:14:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 16:14:33,959 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:33,959 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] [2022-01-31 16:14:33,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 16:14:33,960 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:33,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash -111891045, now seen corresponding path program 1 times [2022-01-31 16:14:33,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:33,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370584873] [2022-01-31 16:14:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:33,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:34,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:34,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:34,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:14:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:34,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:34,076 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 16:14:34,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:34,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370584873] [2022-01-31 16:14:34,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370584873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:34,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:34,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 16:14:34,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771493011] [2022-01-31 16:14:34,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:34,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 16:14:34,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:34,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 16:14:34,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 16:14:34,078 INFO L87 Difference]: Start difference. First operand 792 states and 1105 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:14:35,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:35,724 INFO L93 Difference]: Finished difference Result 1074 states and 1532 transitions. [2022-01-31 16:14:35,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 16:14:35,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2022-01-31 16:14:35,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:35,729 INFO L225 Difference]: With dead ends: 1074 [2022-01-31 16:14:35,729 INFO L226 Difference]: Without dead ends: 1074 [2022-01-31 16:14:35,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:14:35,729 INFO L933 BasicCegarLoop]: 799 mSDtfsCounter, 523 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:35,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [526 Valid, 1361 Invalid, 1991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1836 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 16:14:35,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2022-01-31 16:14:35,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 848. [2022-01-31 16:14:35,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 663 states have (on average 1.3725490196078431) internal successors, (910), 677 states have internal predecessors, (910), 112 states have call successors, (112), 51 states have call predecessors, (112), 72 states have return successors, (143), 126 states have call predecessors, (143), 104 states have call successors, (143) [2022-01-31 16:14:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1165 transitions. [2022-01-31 16:14:35,745 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1165 transitions. Word has length 50 [2022-01-31 16:14:35,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:35,745 INFO L470 AbstractCegarLoop]: Abstraction has 848 states and 1165 transitions. [2022-01-31 16:14:35,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:14:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1165 transitions. [2022-01-31 16:14:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 16:14:35,747 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:35,747 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] [2022-01-31 16:14:35,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 16:14:35,747 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:35,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:35,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1040673977, now seen corresponding path program 1 times [2022-01-31 16:14:35,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:35,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120315807] [2022-01-31 16:14:35,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:35,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:35,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:35,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:35,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:35,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 16:14:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:35,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 16:14:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:35,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 16:14:35,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:35,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120315807] [2022-01-31 16:14:35,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120315807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:35,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:35,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:14:35,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297626201] [2022-01-31 16:14:35,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:35,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:14:35,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:35,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:14:35,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:14:35,854 INFO L87 Difference]: Start difference. First operand 848 states and 1165 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:14:37,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:37,299 INFO L93 Difference]: Finished difference Result 937 states and 1338 transitions. [2022-01-31 16:14:37,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:14:37,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54 [2022-01-31 16:14:37,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:37,302 INFO L225 Difference]: With dead ends: 937 [2022-01-31 16:14:37,302 INFO L226 Difference]: Without dead ends: 937 [2022-01-31 16:14:37,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:14:37,303 INFO L933 BasicCegarLoop]: 641 mSDtfsCounter, 1355 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 497 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:37,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1388 Valid, 1153 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [497 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 16:14:37,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2022-01-31 16:14:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 817. [2022-01-31 16:14:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 639 states have (on average 1.3724569640062598) internal successors, (877), 651 states have internal predecessors, (877), 110 states have call successors, (110), 50 states have call predecessors, (110), 67 states have return successors, (138), 121 states have call predecessors, (138), 103 states have call successors, (138) [2022-01-31 16:14:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1125 transitions. [2022-01-31 16:14:37,314 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1125 transitions. Word has length 54 [2022-01-31 16:14:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:37,315 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1125 transitions. [2022-01-31 16:14:37,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:14:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1125 transitions. [2022-01-31 16:14:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 16:14:37,316 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:37,316 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] [2022-01-31 16:14:37,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 16:14:37,316 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1255093406, now seen corresponding path program 1 times [2022-01-31 16:14:37,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:37,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647908300] [2022-01-31 16:14:37,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:37,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:37,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:37,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:37,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:37,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:14:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:37,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:37,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:37,462 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 16:14:37,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:37,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647908300] [2022-01-31 16:14:37,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647908300] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:37,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:37,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 16:14:37,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123354830] [2022-01-31 16:14:37,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:37,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 16:14:37,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:37,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 16:14:37,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:14:37,464 INFO L87 Difference]: Start difference. First operand 817 states and 1125 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:14:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:38,621 INFO L93 Difference]: Finished difference Result 960 states and 1364 transitions. [2022-01-31 16:14:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:14:38,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2022-01-31 16:14:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:38,626 INFO L225 Difference]: With dead ends: 960 [2022-01-31 16:14:38,626 INFO L226 Difference]: Without dead ends: 960 [2022-01-31 16:14:38,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:14:38,627 INFO L933 BasicCegarLoop]: 694 mSDtfsCounter, 1541 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:38,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1544 Valid, 1365 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 16:14:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2022-01-31 16:14:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 836. [2022-01-31 16:14:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 655 states have (on average 1.369465648854962) internal successors, (897), 668 states have internal predecessors, (897), 111 states have call successors, (111), 51 states have call predecessors, (111), 69 states have return successors, (140), 123 states have call predecessors, (140), 104 states have call successors, (140) [2022-01-31 16:14:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1148 transitions. [2022-01-31 16:14:38,652 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1148 transitions. Word has length 52 [2022-01-31 16:14:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:38,652 INFO L470 AbstractCegarLoop]: Abstraction has 836 states and 1148 transitions. [2022-01-31 16:14:38,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:14:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1148 transitions. [2022-01-31 16:14:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 16:14:38,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:38,653 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] [2022-01-31 16:14:38,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 16:14:38,654 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:38,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash 856883353, now seen corresponding path program 1 times [2022-01-31 16:14:38,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:38,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146030085] [2022-01-31 16:14:38,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:38,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:38,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:38,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:38,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:38,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:14:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:38,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:38,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 16:14:38,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:38,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146030085] [2022-01-31 16:14:38,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146030085] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:38,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:38,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:14:38,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491750567] [2022-01-31 16:14:38,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:38,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:14:38,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:38,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:14:38,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:14:38,810 INFO L87 Difference]: Start difference. First operand 836 states and 1148 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:14:40,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:40,872 INFO L93 Difference]: Finished difference Result 978 states and 1385 transitions. [2022-01-31 16:14:40,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:14:40,873 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2022-01-31 16:14:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:40,875 INFO L225 Difference]: With dead ends: 978 [2022-01-31 16:14:40,875 INFO L226 Difference]: Without dead ends: 977 [2022-01-31 16:14:40,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:14:40,876 INFO L933 BasicCegarLoop]: 707 mSDtfsCounter, 724 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 4259 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 4536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 4259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:40,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [726 Valid, 2474 Invalid, 4536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 4259 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 16:14:40,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2022-01-31 16:14:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 855. [2022-01-31 16:14:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 671 states have (on average 1.3621460506706409) internal successors, (914), 685 states have internal predecessors, (914), 112 states have call successors, (112), 51 states have call predecessors, (112), 71 states have return successors, (143), 126 states have call predecessors, (143), 105 states have call successors, (143) [2022-01-31 16:14:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1169 transitions. [2022-01-31 16:14:40,890 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1169 transitions. Word has length 51 [2022-01-31 16:14:40,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:40,890 INFO L470 AbstractCegarLoop]: Abstraction has 855 states and 1169 transitions. [2022-01-31 16:14:40,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:14:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1169 transitions. [2022-01-31 16:14:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 16:14:40,892 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:40,892 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] [2022-01-31 16:14:40,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 16:14:40,892 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:40,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash 856915097, now seen corresponding path program 1 times [2022-01-31 16:14:40,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:40,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809315676] [2022-01-31 16:14:40,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:40,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:40,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:40,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:40,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:40,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:14:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:41,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:41,033 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 16:14:41,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:41,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809315676] [2022-01-31 16:14:41,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809315676] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:41,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:41,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:14:41,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672233749] [2022-01-31 16:14:41,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:41,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:14:41,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:41,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:14:41,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:14:41,035 INFO L87 Difference]: Start difference. First operand 855 states and 1169 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:14:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:42,647 INFO L93 Difference]: Finished difference Result 987 states and 1396 transitions. [2022-01-31 16:14:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:14:42,647 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2022-01-31 16:14:42,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:42,650 INFO L225 Difference]: With dead ends: 987 [2022-01-31 16:14:42,650 INFO L226 Difference]: Without dead ends: 966 [2022-01-31 16:14:42,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:14:42,651 INFO L933 BasicCegarLoop]: 706 mSDtfsCounter, 1084 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 3508 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 3923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 3508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:42,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1086 Valid, 2358 Invalid, 3923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 3508 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 16:14:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-01-31 16:14:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 842. [2022-01-31 16:14:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 660 states have (on average 1.3666666666666667) internal successors, (902), 674 states have internal predecessors, (902), 112 states have call successors, (112), 51 states have call predecessors, (112), 69 states have return successors, (141), 124 states have call predecessors, (141), 105 states have call successors, (141) [2022-01-31 16:14:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1155 transitions. [2022-01-31 16:14:42,663 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1155 transitions. Word has length 51 [2022-01-31 16:14:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:42,664 INFO L470 AbstractCegarLoop]: Abstraction has 842 states and 1155 transitions. [2022-01-31 16:14:42,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 16:14:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1155 transitions. [2022-01-31 16:14:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 16:14:42,665 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:42,665 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 16:14:42,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 16:14:42,665 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:42,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:42,666 INFO L85 PathProgramCache]: Analyzing trace with hash -222651470, now seen corresponding path program 1 times [2022-01-31 16:14:42,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:42,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662676026] [2022-01-31 16:14:42,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:42,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:42,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:42,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:42,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:14:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:42,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:42,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:42,894 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 16:14:42,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:42,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662676026] [2022-01-31 16:14:42,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662676026] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:42,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:42,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:14:42,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618627127] [2022-01-31 16:14:42,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:42,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:14:42,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:42,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:14:42,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:14:42,896 INFO L87 Difference]: Start difference. First operand 842 states and 1155 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:14:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:44,732 INFO L93 Difference]: Finished difference Result 968 states and 1372 transitions. [2022-01-31 16:14:44,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:14:44,733 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2022-01-31 16:14:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:44,735 INFO L225 Difference]: With dead ends: 968 [2022-01-31 16:14:44,735 INFO L226 Difference]: Without dead ends: 968 [2022-01-31 16:14:44,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-01-31 16:14:44,736 INFO L933 BasicCegarLoop]: 659 mSDtfsCounter, 1967 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 654 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1993 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 3063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 654 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:44,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1993 Valid, 1442 Invalid, 3063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [654 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 16:14:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-01-31 16:14:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 842. [2022-01-31 16:14:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 660 states have (on average 1.3651515151515152) internal successors, (901), 674 states have internal predecessors, (901), 112 states have call successors, (112), 51 states have call predecessors, (112), 69 states have return successors, (141), 124 states have call predecessors, (141), 105 states have call successors, (141) [2022-01-31 16:14:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1154 transitions. [2022-01-31 16:14:44,748 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1154 transitions. Word has length 53 [2022-01-31 16:14:44,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:44,748 INFO L470 AbstractCegarLoop]: Abstraction has 842 states and 1154 transitions. [2022-01-31 16:14:44,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:14:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1154 transitions. [2022-01-31 16:14:44,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 16:14:44,750 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:44,750 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] [2022-01-31 16:14:44,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 16:14:44,750 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:44,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash 179775437, now seen corresponding path program 1 times [2022-01-31 16:14:44,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:44,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732751132] [2022-01-31 16:14:44,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:44,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:44,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:44,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:44,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:44,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:14:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:44,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:44,880 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 16:14:44,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:44,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732751132] [2022-01-31 16:14:44,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732751132] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:44,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:44,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 16:14:44,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619627751] [2022-01-31 16:14:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:44,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 16:14:44,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:44,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 16:14:44,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:14:44,881 INFO L87 Difference]: Start difference. First operand 842 states and 1154 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:14:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:46,596 INFO L93 Difference]: Finished difference Result 975 states and 1378 transitions. [2022-01-31 16:14:46,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:14:46,596 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-01-31 16:14:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:46,599 INFO L225 Difference]: With dead ends: 975 [2022-01-31 16:14:46,599 INFO L226 Difference]: Without dead ends: 943 [2022-01-31 16:14:46,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-01-31 16:14:46,600 INFO L933 BasicCegarLoop]: 659 mSDtfsCounter, 1246 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:46,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1261 Valid, 1266 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 16:14:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2022-01-31 16:14:46,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 815. [2022-01-31 16:14:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 638 states have (on average 1.3746081504702194) internal successors, (877), 651 states have internal predecessors, (877), 109 states have call successors, (109), 49 states have call predecessors, (109), 67 states have return successors, (138), 121 states have call predecessors, (138), 102 states have call successors, (138) [2022-01-31 16:14:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1124 transitions. [2022-01-31 16:14:46,611 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1124 transitions. Word has length 52 [2022-01-31 16:14:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:46,611 INFO L470 AbstractCegarLoop]: Abstraction has 815 states and 1124 transitions. [2022-01-31 16:14:46,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 16:14:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1124 transitions. [2022-01-31 16:14:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 16:14:46,613 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:46,613 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] [2022-01-31 16:14:46,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 16:14:46,613 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:46,613 INFO L85 PathProgramCache]: Analyzing trace with hash 760121073, now seen corresponding path program 1 times [2022-01-31 16:14:46,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:46,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116801313] [2022-01-31 16:14:46,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:46,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:46,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:46,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:46,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:14:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:46,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:46,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:46,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 16:14:46,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:46,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116801313] [2022-01-31 16:14:46,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116801313] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:46,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:46,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:14:46,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692142504] [2022-01-31 16:14:46,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:46,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:14:46,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:46,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:14:46,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:14:46,800 INFO L87 Difference]: Start difference. First operand 815 states and 1124 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:14:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:48,298 INFO L93 Difference]: Finished difference Result 939 states and 1339 transitions. [2022-01-31 16:14:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:14:48,299 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2022-01-31 16:14:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:48,301 INFO L225 Difference]: With dead ends: 939 [2022-01-31 16:14:48,301 INFO L226 Difference]: Without dead ends: 939 [2022-01-31 16:14:48,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-01-31 16:14:48,302 INFO L933 BasicCegarLoop]: 630 mSDtfsCounter, 2257 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 790 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2283 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 790 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:48,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2283 Valid, 1183 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [790 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 16:14:48,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-01-31 16:14:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 815. [2022-01-31 16:14:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 638 states have (on average 1.3730407523510972) internal successors, (876), 651 states have internal predecessors, (876), 109 states have call successors, (109), 49 states have call predecessors, (109), 67 states have return successors, (138), 121 states have call predecessors, (138), 102 states have call successors, (138) [2022-01-31 16:14:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1123 transitions. [2022-01-31 16:14:48,313 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1123 transitions. Word has length 54 [2022-01-31 16:14:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:48,314 INFO L470 AbstractCegarLoop]: Abstraction has 815 states and 1123 transitions. [2022-01-31 16:14:48,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:14:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1123 transitions. [2022-01-31 16:14:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 16:14:48,316 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:48,316 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] [2022-01-31 16:14:48,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 16:14:48,316 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1504848646, now seen corresponding path program 1 times [2022-01-31 16:14:48,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:48,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067243183] [2022-01-31 16:14:48,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:48,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:48,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:48,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:48,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:48,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:14:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:48,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:48,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:48,496 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 16:14:48,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:48,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067243183] [2022-01-31 16:14:48,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067243183] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:48,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:48,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:14:48,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263811206] [2022-01-31 16:14:48,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:48,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:14:48,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:48,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:14:48,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:14:48,497 INFO L87 Difference]: Start difference. First operand 815 states and 1123 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:14:50,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:50,962 INFO L93 Difference]: Finished difference Result 963 states and 1369 transitions. [2022-01-31 16:14:50,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 16:14:50,963 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2022-01-31 16:14:50,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:50,965 INFO L225 Difference]: With dead ends: 963 [2022-01-31 16:14:50,965 INFO L226 Difference]: Without dead ends: 926 [2022-01-31 16:14:50,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:14:50,966 INFO L933 BasicCegarLoop]: 678 mSDtfsCounter, 389 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 5399 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 2702 SdHoareTripleChecker+Invalid, 5563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 5399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:50,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 2702 Invalid, 5563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 5399 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 16:14:50,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-01-31 16:14:50,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 806. [2022-01-31 16:14:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 631 states have (on average 1.3565768621236134) internal successors, (856), 644 states have internal predecessors, (856), 107 states have call successors, (107), 49 states have call predecessors, (107), 67 states have return successors, (136), 119 states have call predecessors, (136), 100 states have call successors, (136) [2022-01-31 16:14:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1099 transitions. [2022-01-31 16:14:50,977 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1099 transitions. Word has length 55 [2022-01-31 16:14:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:50,977 INFO L470 AbstractCegarLoop]: Abstraction has 806 states and 1099 transitions. [2022-01-31 16:14:50,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:14:50,977 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1099 transitions. [2022-01-31 16:14:50,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 16:14:50,978 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:50,979 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] [2022-01-31 16:14:50,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 16:14:50,979 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:50,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:50,979 INFO L85 PathProgramCache]: Analyzing trace with hash -755849646, now seen corresponding path program 1 times [2022-01-31 16:14:50,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:50,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884280315] [2022-01-31 16:14:50,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:50,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:51,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:51,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:51,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 16:14:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:51,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:14:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:51,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:51,201 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 16:14:51,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:51,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884280315] [2022-01-31 16:14:51,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884280315] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:51,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:51,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:14:51,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943822042] [2022-01-31 16:14:51,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:51,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:14:51,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:51,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:14:51,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:14:51,203 INFO L87 Difference]: Start difference. First operand 806 states and 1099 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:14:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:53,208 INFO L93 Difference]: Finished difference Result 939 states and 1323 transitions. [2022-01-31 16:14:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:14:53,208 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 56 [2022-01-31 16:14:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:53,211 INFO L225 Difference]: With dead ends: 939 [2022-01-31 16:14:53,211 INFO L226 Difference]: Without dead ends: 924 [2022-01-31 16:14:53,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:14:53,211 INFO L933 BasicCegarLoop]: 660 mSDtfsCounter, 671 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 4337 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 4609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 4337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:53,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [673 Valid, 2617 Invalid, 4609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 4337 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-31 16:14:53,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2022-01-31 16:14:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 804. [2022-01-31 16:14:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 630 states have (on average 1.3555555555555556) internal successors, (854), 643 states have internal predecessors, (854), 106 states have call successors, (106), 49 states have call predecessors, (106), 67 states have return successors, (135), 118 states have call predecessors, (135), 99 states have call successors, (135) [2022-01-31 16:14:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1095 transitions. [2022-01-31 16:14:53,231 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1095 transitions. Word has length 56 [2022-01-31 16:14:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:53,231 INFO L470 AbstractCegarLoop]: Abstraction has 804 states and 1095 transitions. [2022-01-31 16:14:53,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:14:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1095 transitions. [2022-01-31 16:14:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 16:14:53,233 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:53,233 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] [2022-01-31 16:14:53,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 16:14:53,233 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:53,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:53,234 INFO L85 PathProgramCache]: Analyzing trace with hash -303401055, now seen corresponding path program 1 times [2022-01-31 16:14:53,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:53,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047409216] [2022-01-31 16:14:53,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:53,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:53,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:53,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:53,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:53,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 16:14:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:53,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:53,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:53,394 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 16:14:53,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:53,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047409216] [2022-01-31 16:14:53,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047409216] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:53,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:53,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:14:53,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711344893] [2022-01-31 16:14:53,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:53,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:14:53,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:53,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:14:53,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:14:53,398 INFO L87 Difference]: Start difference. First operand 804 states and 1095 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:14:55,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:55,319 INFO L93 Difference]: Finished difference Result 934 states and 1316 transitions. [2022-01-31 16:14:55,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:14:55,319 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2022-01-31 16:14:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:55,322 INFO L225 Difference]: With dead ends: 934 [2022-01-31 16:14:55,322 INFO L226 Difference]: Without dead ends: 919 [2022-01-31 16:14:55,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:14:55,322 INFO L933 BasicCegarLoop]: 657 mSDtfsCounter, 669 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 4646 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 2653 SdHoareTripleChecker+Invalid, 4916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 4646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:55,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [671 Valid, 2653 Invalid, 4916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 4646 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-31 16:14:55,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-01-31 16:14:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 799. [2022-01-31 16:14:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 627 states have (on average 1.3556618819776713) internal successors, (850), 640 states have internal predecessors, (850), 105 states have call successors, (105), 49 states have call predecessors, (105), 66 states have return successors, (133), 116 states have call predecessors, (133), 98 states have call successors, (133) [2022-01-31 16:14:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1088 transitions. [2022-01-31 16:14:55,333 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1088 transitions. Word has length 55 [2022-01-31 16:14:55,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:55,333 INFO L470 AbstractCegarLoop]: Abstraction has 799 states and 1088 transitions. [2022-01-31 16:14:55,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:14:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1088 transitions. [2022-01-31 16:14:55,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 16:14:55,334 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:55,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, 1, 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 16:14:55,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 16:14:55,335 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:55,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1335002991, now seen corresponding path program 1 times [2022-01-31 16:14:55,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:55,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004533482] [2022-01-31 16:14:55,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:55,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:55,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:55,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:55,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:55,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:14:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:55,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:14:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:55,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:14:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:55,478 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 16:14:55,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:55,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004533482] [2022-01-31 16:14:55,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004533482] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:55,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:55,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:14:55,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931250727] [2022-01-31 16:14:55,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:55,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:14:55,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:55,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:14:55,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:14:55,479 INFO L87 Difference]: Start difference. First operand 799 states and 1088 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:14:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:56,816 INFO L93 Difference]: Finished difference Result 941 states and 1319 transitions. [2022-01-31 16:14:56,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:14:56,817 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2022-01-31 16:14:56,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:56,819 INFO L225 Difference]: With dead ends: 941 [2022-01-31 16:14:56,819 INFO L226 Difference]: Without dead ends: 941 [2022-01-31 16:14:56,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:14:56,820 INFO L933 BasicCegarLoop]: 678 mSDtfsCounter, 1525 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1535 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:56,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1535 Valid, 1190 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 16:14:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-01-31 16:14:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 799. [2022-01-31 16:14:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 627 states have (on average 1.354066985645933) internal successors, (849), 640 states have internal predecessors, (849), 105 states have call successors, (105), 49 states have call predecessors, (105), 66 states have return successors, (133), 116 states have call predecessors, (133), 98 states have call successors, (133) [2022-01-31 16:14:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1087 transitions. [2022-01-31 16:14:56,829 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1087 transitions. Word has length 56 [2022-01-31 16:14:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:56,830 INFO L470 AbstractCegarLoop]: Abstraction has 799 states and 1087 transitions. [2022-01-31 16:14:56,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:14:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1087 transitions. [2022-01-31 16:14:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 16:14:56,831 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:56,831 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 16:14:56,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 16:14:56,831 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1948386428, now seen corresponding path program 1 times [2022-01-31 16:14:56,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:56,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137657139] [2022-01-31 16:14:56,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:56,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:56,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:56,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:56,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 16:14:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:56,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:14:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:56,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:14:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:56,986 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 16:14:56,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:56,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137657139] [2022-01-31 16:14:56,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137657139] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:56,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:56,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 16:14:56,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665152369] [2022-01-31 16:14:56,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:56,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 16:14:56,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:56,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 16:14:56,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 16:14:56,987 INFO L87 Difference]: Start difference. First operand 799 states and 1087 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), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:14:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:14:58,363 INFO L93 Difference]: Finished difference Result 1023 states and 1421 transitions. [2022-01-31 16:14:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:14:58,363 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), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2022-01-31 16:14:58,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:14:58,366 INFO L225 Difference]: With dead ends: 1023 [2022-01-31 16:14:58,366 INFO L226 Difference]: Without dead ends: 1023 [2022-01-31 16:14:58,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:14:58,366 INFO L933 BasicCegarLoop]: 663 mSDtfsCounter, 690 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:14:58,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 1241 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 16:14:58,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2022-01-31 16:14:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 840. [2022-01-31 16:14:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 660 states have (on average 1.3424242424242425) internal successors, (886), 672 states have internal predecessors, (886), 106 states have call successors, (106), 53 states have call predecessors, (106), 73 states have return successors, (135), 121 states have call predecessors, (135), 100 states have call successors, (135) [2022-01-31 16:14:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1127 transitions. [2022-01-31 16:14:58,393 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1127 transitions. Word has length 61 [2022-01-31 16:14:58,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:14:58,393 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 1127 transitions. [2022-01-31 16:14:58,393 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), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:14:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1127 transitions. [2022-01-31 16:14:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 16:14:58,395 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:14:58,395 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 16:14:58,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 16:14:58,395 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:14:58,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:14:58,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1337798748, now seen corresponding path program 1 times [2022-01-31 16:14:58,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:14:58,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599856585] [2022-01-31 16:14:58,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:14:58,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:14:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:14:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:14:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:14:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:14:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:14:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 16:14:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:14:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:14:58,714 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 16:14:58,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:14:58,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599856585] [2022-01-31 16:14:58,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599856585] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:14:58,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:14:58,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 16:14:58,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767422642] [2022-01-31 16:14:58,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:14:58,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 16:14:58,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:14:58,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 16:14:58,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-01-31 16:14:58,716 INFO L87 Difference]: Start difference. First operand 840 states and 1127 transitions. Second operand has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 16:15:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:01,362 INFO L93 Difference]: Finished difference Result 1005 states and 1396 transitions. [2022-01-31 16:15:01,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 16:15:01,374 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2022-01-31 16:15:01,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:01,376 INFO L225 Difference]: With dead ends: 1005 [2022-01-31 16:15:01,376 INFO L226 Difference]: Without dead ends: 984 [2022-01-31 16:15:01,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2022-01-31 16:15:01,377 INFO L933 BasicCegarLoop]: 655 mSDtfsCounter, 1023 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 6165 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 3230 SdHoareTripleChecker+Invalid, 6595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 6165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:01,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1029 Valid, 3230 Invalid, 6595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 6165 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:15:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2022-01-31 16:15:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 838. [2022-01-31 16:15:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 659 states have (on average 1.3414264036418817) internal successors, (884), 671 states have internal predecessors, (884), 105 states have call successors, (105), 53 states have call predecessors, (105), 73 states have return successors, (134), 120 states have call predecessors, (134), 99 states have call successors, (134) [2022-01-31 16:15:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1123 transitions. [2022-01-31 16:15:01,387 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1123 transitions. Word has length 62 [2022-01-31 16:15:01,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:01,387 INFO L470 AbstractCegarLoop]: Abstraction has 838 states and 1123 transitions. [2022-01-31 16:15:01,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 16:15:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1123 transitions. [2022-01-31 16:15:01,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 16:15:01,389 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:01,389 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] [2022-01-31 16:15:01,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 16:15:01,389 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:01,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:01,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1214008405, now seen corresponding path program 1 times [2022-01-31 16:15:01,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:01,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510450539] [2022-01-31 16:15:01,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:01,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:01,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:01,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:01,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:01,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:01,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:01,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:01,625 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 16:15:01,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:01,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510450539] [2022-01-31 16:15:01,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510450539] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:01,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:01,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 16:15:01,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786082766] [2022-01-31 16:15:01,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:01,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 16:15:01,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:01,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 16:15:01,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-01-31 16:15:01,627 INFO L87 Difference]: Start difference. First operand 838 states and 1123 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 16:15:04,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:04,500 INFO L93 Difference]: Finished difference Result 1003 states and 1392 transitions. [2022-01-31 16:15:04,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 16:15:04,500 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-01-31 16:15:04,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:04,502 INFO L225 Difference]: With dead ends: 1003 [2022-01-31 16:15:04,503 INFO L226 Difference]: Without dead ends: 980 [2022-01-31 16:15:04,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2022-01-31 16:15:04,503 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 1005 mSDsluCounter, 2803 mSDsCounter, 0 mSdLazyCounter, 6736 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 3437 SdHoareTripleChecker+Invalid, 7156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 6736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:04,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1009 Valid, 3437 Invalid, 7156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 6736 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-01-31 16:15:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2022-01-31 16:15:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 837. [2022-01-31 16:15:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 658 states have (on average 1.3267477203647415) internal successors, (873), 670 states have internal predecessors, (873), 105 states have call successors, (105), 53 states have call predecessors, (105), 73 states have return successors, (134), 120 states have call predecessors, (134), 99 states have call successors, (134) [2022-01-31 16:15:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1112 transitions. [2022-01-31 16:15:04,513 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1112 transitions. Word has length 59 [2022-01-31 16:15:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:04,513 INFO L470 AbstractCegarLoop]: Abstraction has 837 states and 1112 transitions. [2022-01-31 16:15:04,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 16:15:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1112 transitions. [2022-01-31 16:15:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 16:15:04,514 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:04,514 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] [2022-01-31 16:15:04,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 16:15:04,515 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:04,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:04,515 INFO L85 PathProgramCache]: Analyzing trace with hash -55485367, now seen corresponding path program 1 times [2022-01-31 16:15:04,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:04,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211168028] [2022-01-31 16:15:04,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:04,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:04,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:04,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:04,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:04,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:04,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:04,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:04,736 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 16:15:04,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:04,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211168028] [2022-01-31 16:15:04,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211168028] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:04,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:04,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 16:15:04,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377836841] [2022-01-31 16:15:04,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:04,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 16:15:04,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:04,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 16:15:04,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:04,737 INFO L87 Difference]: Start difference. First operand 837 states and 1112 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:07,179 INFO L93 Difference]: Finished difference Result 992 states and 1366 transitions. [2022-01-31 16:15:07,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 16:15:07,179 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-01-31 16:15:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:07,182 INFO L225 Difference]: With dead ends: 992 [2022-01-31 16:15:07,182 INFO L226 Difference]: Without dead ends: 975 [2022-01-31 16:15:07,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-01-31 16:15:07,182 INFO L933 BasicCegarLoop]: 649 mSDtfsCounter, 1249 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 5378 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 2952 SdHoareTripleChecker+Invalid, 5895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 5378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:07,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1251 Valid, 2952 Invalid, 5895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 5378 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-31 16:15:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2022-01-31 16:15:07,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 834. [2022-01-31 16:15:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 656 states have (on average 1.326219512195122) internal successors, (870), 668 states have internal predecessors, (870), 104 states have call successors, (104), 53 states have call predecessors, (104), 73 states have return successors, (133), 119 states have call predecessors, (133), 98 states have call successors, (133) [2022-01-31 16:15:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1107 transitions. [2022-01-31 16:15:07,193 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1107 transitions. Word has length 58 [2022-01-31 16:15:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:07,193 INFO L470 AbstractCegarLoop]: Abstraction has 834 states and 1107 transitions. [2022-01-31 16:15:07,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 16:15:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1107 transitions. [2022-01-31 16:15:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 16:15:07,194 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:07,194 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 16:15:07,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 16:15:07,194 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash -57775299, now seen corresponding path program 1 times [2022-01-31 16:15:07,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:07,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997675245] [2022-01-31 16:15:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:07,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:07,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:07,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:07,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:07,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:07,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:07,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 16:15:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:07,377 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 16:15:07,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:07,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997675245] [2022-01-31 16:15:07,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997675245] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:07,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:07,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:15:07,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288605149] [2022-01-31 16:15:07,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:07,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:15:07,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:07,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:15:07,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:07,379 INFO L87 Difference]: Start difference. First operand 834 states and 1107 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:08,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:08,807 INFO L93 Difference]: Finished difference Result 1036 states and 1451 transitions. [2022-01-31 16:15:08,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:15:08,808 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2022-01-31 16:15:08,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:08,810 INFO L225 Difference]: With dead ends: 1036 [2022-01-31 16:15:08,810 INFO L226 Difference]: Without dead ends: 1036 [2022-01-31 16:15:08,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:15:08,811 INFO L933 BasicCegarLoop]: 628 mSDtfsCounter, 1326 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 2236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:08,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1328 Valid, 1630 Invalid, 2236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 16:15:08,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-01-31 16:15:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 841. [2022-01-31 16:15:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 661 states have (on average 1.3267776096822996) internal successors, (877), 674 states have internal predecessors, (877), 105 states have call successors, (105), 53 states have call predecessors, (105), 74 states have return successors, (140), 120 states have call predecessors, (140), 99 states have call successors, (140) [2022-01-31 16:15:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1122 transitions. [2022-01-31 16:15:08,824 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1122 transitions. Word has length 60 [2022-01-31 16:15:08,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:08,824 INFO L470 AbstractCegarLoop]: Abstraction has 841 states and 1122 transitions. [2022-01-31 16:15:08,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:08,824 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-01-31 16:15:08,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 16:15:08,826 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:08,827 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 16:15:08,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 16:15:08,827 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:08,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:08,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2067879140, now seen corresponding path program 1 times [2022-01-31 16:15:08,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:08,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109886684] [2022-01-31 16:15:08,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:08,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:08,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:08,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:08,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:08,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:08,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:09,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 16:15:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:09,006 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 16:15:09,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:09,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109886684] [2022-01-31 16:15:09,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109886684] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:09,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:09,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 16:15:09,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959720456] [2022-01-31 16:15:09,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:09,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 16:15:09,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:09,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 16:15:09,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:09,008 INFO L87 Difference]: Start difference. First operand 841 states and 1122 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:10,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:10,810 INFO L93 Difference]: Finished difference Result 1005 states and 1397 transitions. [2022-01-31 16:15:10,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 16:15:10,810 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2022-01-31 16:15:10,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:10,812 INFO L225 Difference]: With dead ends: 1005 [2022-01-31 16:15:10,812 INFO L226 Difference]: Without dead ends: 983 [2022-01-31 16:15:10,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:10,813 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 1277 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 3767 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 4292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 3767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:10,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1280 Valid, 2654 Invalid, 4292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 3767 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 16:15:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2022-01-31 16:15:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 839. [2022-01-31 16:15:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 660 states have (on average 1.3257575757575757) internal successors, (875), 673 states have internal predecessors, (875), 104 states have call successors, (104), 53 states have call predecessors, (104), 74 states have return successors, (139), 119 states have call predecessors, (139), 98 states have call successors, (139) [2022-01-31 16:15:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1118 transitions. [2022-01-31 16:15:10,822 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1118 transitions. Word has length 60 [2022-01-31 16:15:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:10,823 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 1118 transitions. [2022-01-31 16:15:10,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:10,823 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1118 transitions. [2022-01-31 16:15:10,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 16:15:10,824 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:10,824 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] [2022-01-31 16:15:10,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 16:15:10,824 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:10,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:10,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1557615113, now seen corresponding path program 1 times [2022-01-31 16:15:10,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:10,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274938190] [2022-01-31 16:15:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:10,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:11,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 16:15:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:11,056 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 16:15:11,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:11,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274938190] [2022-01-31 16:15:11,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274938190] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:11,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:11,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 16:15:11,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484369558] [2022-01-31 16:15:11,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:11,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 16:15:11,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:11,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 16:15:11,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:11,057 INFO L87 Difference]: Start difference. First operand 839 states and 1118 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:15:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:13,380 INFO L93 Difference]: Finished difference Result 1004 states and 1391 transitions. [2022-01-31 16:15:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 16:15:13,380 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-01-31 16:15:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:13,382 INFO L225 Difference]: With dead ends: 1004 [2022-01-31 16:15:13,382 INFO L226 Difference]: Without dead ends: 968 [2022-01-31 16:15:13,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2022-01-31 16:15:13,384 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 660 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 4989 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 5268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 4989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:13,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [664 Valid, 2776 Invalid, 5268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 4989 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 16:15:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-01-31 16:15:13,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 827. [2022-01-31 16:15:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 651 states have (on average 1.3210445468509984) internal successors, (860), 664 states have internal predecessors, (860), 101 states have call successors, (101), 53 states have call predecessors, (101), 74 states have return successors, (136), 116 states have call predecessors, (136), 95 states have call successors, (136) [2022-01-31 16:15:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1097 transitions. [2022-01-31 16:15:13,395 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1097 transitions. Word has length 59 [2022-01-31 16:15:13,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:13,395 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1097 transitions. [2022-01-31 16:15:13,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:15:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1097 transitions. [2022-01-31 16:15:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 16:15:13,396 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:13,397 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 16:15:13,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 16:15:13,397 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:13,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:13,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1192878684, now seen corresponding path program 1 times [2022-01-31 16:15:13,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:13,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382502903] [2022-01-31 16:15:13,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:13,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 16:15:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:13,548 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 16:15:13,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:13,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382502903] [2022-01-31 16:15:13,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382502903] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:13,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:13,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:13,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008283625] [2022-01-31 16:15:13,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:13,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:13,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:13,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:13,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:13,549 INFO L87 Difference]: Start difference. First operand 827 states and 1097 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:15,091 INFO L93 Difference]: Finished difference Result 984 states and 1386 transitions. [2022-01-31 16:15:15,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:15,091 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2022-01-31 16:15:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:15,093 INFO L225 Difference]: With dead ends: 984 [2022-01-31 16:15:15,093 INFO L226 Difference]: Without dead ends: 982 [2022-01-31 16:15:15,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:15,094 INFO L933 BasicCegarLoop]: 609 mSDtfsCounter, 350 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 2141 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 2141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:15,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 1773 Invalid, 2290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 2141 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 16:15:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-01-31 16:15:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 831. [2022-01-31 16:15:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 653 states have (on average 1.3200612557427258) internal successors, (862), 668 states have internal predecessors, (862), 101 states have call successors, (101), 53 states have call predecessors, (101), 76 states have return successors, (152), 116 states have call predecessors, (152), 95 states have call successors, (152) [2022-01-31 16:15:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1115 transitions. [2022-01-31 16:15:15,105 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1115 transitions. Word has length 61 [2022-01-31 16:15:15,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:15,105 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1115 transitions. [2022-01-31 16:15:15,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1115 transitions. [2022-01-31 16:15:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 16:15:15,106 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:15,107 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 16:15:15,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 16:15:15,107 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:15,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:15,107 INFO L85 PathProgramCache]: Analyzing trace with hash 440130742, now seen corresponding path program 1 times [2022-01-31 16:15:15,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:15,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45973784] [2022-01-31 16:15:15,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:15,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 16:15:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:15,283 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 16:15:15,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:15,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45973784] [2022-01-31 16:15:15,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45973784] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:15,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:15,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 16:15:15,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248532143] [2022-01-31 16:15:15,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:15,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 16:15:15,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:15,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 16:15:15,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:15,284 INFO L87 Difference]: Start difference. First operand 831 states and 1115 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:15:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:16,669 INFO L93 Difference]: Finished difference Result 974 states and 1367 transitions. [2022-01-31 16:15:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:16,670 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2022-01-31 16:15:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:16,673 INFO L225 Difference]: With dead ends: 974 [2022-01-31 16:15:16,673 INFO L226 Difference]: Without dead ends: 974 [2022-01-31 16:15:16,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:16,674 INFO L933 BasicCegarLoop]: 607 mSDtfsCounter, 349 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:16,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 1511 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 16:15:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2022-01-31 16:15:16,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 831. [2022-01-31 16:15:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 653 states have (on average 1.318529862174579) internal successors, (861), 668 states have internal predecessors, (861), 101 states have call successors, (101), 53 states have call predecessors, (101), 76 states have return successors, (152), 116 states have call predecessors, (152), 95 states have call successors, (152) [2022-01-31 16:15:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1114 transitions. [2022-01-31 16:15:16,684 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1114 transitions. Word has length 60 [2022-01-31 16:15:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:16,684 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1114 transitions. [2022-01-31 16:15:16,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:15:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1114 transitions. [2022-01-31 16:15:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 16:15:16,685 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:16,685 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 16:15:16,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 16:15:16,685 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:16,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:16,686 INFO L85 PathProgramCache]: Analyzing trace with hash 185394197, now seen corresponding path program 1 times [2022-01-31 16:15:16,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:16,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796154788] [2022-01-31 16:15:16,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:16,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:16,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:16,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:16,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:16,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 16:15:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:16,936 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 16:15:16,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:16,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796154788] [2022-01-31 16:15:16,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796154788] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:16,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:16,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 16:15:16,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664324744] [2022-01-31 16:15:16,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:16,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 16:15:16,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:16,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 16:15:16,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:16,938 INFO L87 Difference]: Start difference. First operand 831 states and 1114 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:15:19,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:19,003 INFO L93 Difference]: Finished difference Result 1010 states and 1414 transitions. [2022-01-31 16:15:19,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 16:15:19,004 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2022-01-31 16:15:19,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:19,006 INFO L225 Difference]: With dead ends: 1010 [2022-01-31 16:15:19,006 INFO L226 Difference]: Without dead ends: 961 [2022-01-31 16:15:19,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2022-01-31 16:15:19,007 INFO L933 BasicCegarLoop]: 608 mSDtfsCounter, 1261 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 4078 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 2520 SdHoareTripleChecker+Invalid, 4591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 4078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:19,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1266 Valid, 2520 Invalid, 4591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 4078 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-31 16:15:19,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2022-01-31 16:15:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 823. [2022-01-31 16:15:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 647 states have (on average 1.3137557959814528) internal successors, (850), 662 states have internal predecessors, (850), 99 states have call successors, (99), 53 states have call predecessors, (99), 76 states have return successors, (150), 114 states have call predecessors, (150), 93 states have call successors, (150) [2022-01-31 16:15:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1099 transitions. [2022-01-31 16:15:19,016 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1099 transitions. Word has length 60 [2022-01-31 16:15:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:19,016 INFO L470 AbstractCegarLoop]: Abstraction has 823 states and 1099 transitions. [2022-01-31 16:15:19,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 16:15:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1099 transitions. [2022-01-31 16:15:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 16:15:19,017 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:19,017 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] [2022-01-31 16:15:19,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 16:15:19,018 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:19,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1158774888, now seen corresponding path program 1 times [2022-01-31 16:15:19,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:19,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278775870] [2022-01-31 16:15:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:19,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:19,282 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 16:15:19,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:19,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278775870] [2022-01-31 16:15:19,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278775870] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:19,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:19,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 16:15:19,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34768495] [2022-01-31 16:15:19,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:19,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 16:15:19,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:19,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 16:15:19,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:19,285 INFO L87 Difference]: Start difference. First operand 823 states and 1099 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:21,417 INFO L93 Difference]: Finished difference Result 975 states and 1357 transitions. [2022-01-31 16:15:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 16:15:21,419 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-01-31 16:15:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:21,421 INFO L225 Difference]: With dead ends: 975 [2022-01-31 16:15:21,421 INFO L226 Difference]: Without dead ends: 956 [2022-01-31 16:15:21,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-01-31 16:15:21,421 INFO L933 BasicCegarLoop]: 597 mSDtfsCounter, 1168 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 5487 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 3188 SdHoareTripleChecker+Invalid, 5966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 5487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:21,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1170 Valid, 3188 Invalid, 5966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 5487 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 16:15:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2022-01-31 16:15:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 818. [2022-01-31 16:15:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 644 states have (on average 1.313664596273292) internal successors, (846), 659 states have internal predecessors, (846), 98 states have call successors, (98), 53 states have call predecessors, (98), 75 states have return successors, (148), 112 states have call predecessors, (148), 92 states have call successors, (148) [2022-01-31 16:15:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1092 transitions. [2022-01-31 16:15:21,431 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1092 transitions. Word has length 63 [2022-01-31 16:15:21,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:21,431 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 1092 transitions. [2022-01-31 16:15:21,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1092 transitions. [2022-01-31 16:15:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 16:15:21,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:21,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:21,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 16:15:21,432 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:21,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:21,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1342281155, now seen corresponding path program 1 times [2022-01-31 16:15:21,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:21,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988267486] [2022-01-31 16:15:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:21,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:21,670 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 16:15:21,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:21,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988267486] [2022-01-31 16:15:21,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988267486] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:21,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:21,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 16:15:21,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539629542] [2022-01-31 16:15:21,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:21,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 16:15:21,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:21,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 16:15:21,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:21,673 INFO L87 Difference]: Start difference. First operand 818 states and 1092 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:23,834 INFO L93 Difference]: Finished difference Result 970 states and 1350 transitions. [2022-01-31 16:15:23,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 16:15:23,835 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-01-31 16:15:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:23,837 INFO L225 Difference]: With dead ends: 970 [2022-01-31 16:15:23,837 INFO L226 Difference]: Without dead ends: 951 [2022-01-31 16:15:23,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:15:23,837 INFO L933 BasicCegarLoop]: 593 mSDtfsCounter, 584 mSDsluCounter, 2493 mSDsCounter, 0 mSdLazyCounter, 5548 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 3086 SdHoareTripleChecker+Invalid, 5792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 5548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:23,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [586 Valid, 3086 Invalid, 5792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 5548 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 16:15:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2022-01-31 16:15:23,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 813. [2022-01-31 16:15:23,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 641 states have (on average 1.313572542901716) internal successors, (842), 656 states have internal predecessors, (842), 97 states have call successors, (97), 53 states have call predecessors, (97), 74 states have return successors, (146), 110 states have call predecessors, (146), 91 states have call successors, (146) [2022-01-31 16:15:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1085 transitions. [2022-01-31 16:15:23,847 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1085 transitions. Word has length 62 [2022-01-31 16:15:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:23,847 INFO L470 AbstractCegarLoop]: Abstraction has 813 states and 1085 transitions. [2022-01-31 16:15:23,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1085 transitions. [2022-01-31 16:15:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 16:15:23,848 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:23,848 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] [2022-01-31 16:15:23,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 16:15:23,848 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:23,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:23,848 INFO L85 PathProgramCache]: Analyzing trace with hash 739520085, now seen corresponding path program 1 times [2022-01-31 16:15:23,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:23,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061077074] [2022-01-31 16:15:23,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:23,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:23,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:23,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:23,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:23,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:23,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:24,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 16:15:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:24,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:24,080 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 16:15:24,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:24,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061077074] [2022-01-31 16:15:24,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061077074] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:24,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:24,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 16:15:24,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539042843] [2022-01-31 16:15:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:24,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 16:15:24,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:24,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 16:15:24,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-01-31 16:15:24,081 INFO L87 Difference]: Start difference. First operand 813 states and 1085 transitions. Second operand has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 16:15:26,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:26,477 INFO L93 Difference]: Finished difference Result 970 states and 1348 transitions. [2022-01-31 16:15:26,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 16:15:26,478 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2022-01-31 16:15:26,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:26,480 INFO L225 Difference]: With dead ends: 970 [2022-01-31 16:15:26,480 INFO L226 Difference]: Without dead ends: 949 [2022-01-31 16:15:26,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2022-01-31 16:15:26,481 INFO L933 BasicCegarLoop]: 563 mSDtfsCounter, 1181 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 5554 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 6038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 5554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:26,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1184 Valid, 2960 Invalid, 6038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 5554 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-31 16:15:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2022-01-31 16:15:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 811. [2022-01-31 16:15:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 640 states have (on average 1.3125) internal successors, (840), 655 states have internal predecessors, (840), 96 states have call successors, (96), 53 states have call predecessors, (96), 74 states have return successors, (145), 109 states have call predecessors, (145), 90 states have call successors, (145) [2022-01-31 16:15:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1081 transitions. [2022-01-31 16:15:26,494 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1081 transitions. Word has length 63 [2022-01-31 16:15:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:26,494 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1081 transitions. [2022-01-31 16:15:26,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 16:15:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1081 transitions. [2022-01-31 16:15:26,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 16:15:26,496 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:26,496 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] [2022-01-31 16:15:26,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 16:15:26,496 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:26,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash -620638821, now seen corresponding path program 1 times [2022-01-31 16:15:26,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:26,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417479643] [2022-01-31 16:15:26,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:26,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:15:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:26,632 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 16:15:26,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:26,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417479643] [2022-01-31 16:15:26,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417479643] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:26,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:26,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:15:26,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256408007] [2022-01-31 16:15:26,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:26,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:15:26,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:26,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:15:26,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:26,634 INFO L87 Difference]: Start difference. First operand 811 states and 1081 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:27,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:27,412 INFO L93 Difference]: Finished difference Result 814 states and 1084 transitions. [2022-01-31 16:15:27,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 16:15:27,413 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-01-31 16:15:27,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:27,414 INFO L225 Difference]: With dead ends: 814 [2022-01-31 16:15:27,414 INFO L226 Difference]: Without dead ends: 810 [2022-01-31 16:15:27,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-01-31 16:15:27,415 INFO L933 BasicCegarLoop]: 523 mSDtfsCounter, 1153 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:27,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1155 Valid, 1063 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 16:15:27,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-01-31 16:15:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 703. [2022-01-31 16:15:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 555 states have (on average 1.3045045045045045) internal successors, (724), 569 states have internal predecessors, (724), 84 states have call successors, (84), 47 states have call predecessors, (84), 63 states have return successors, (104), 93 states have call predecessors, (104), 78 states have call successors, (104) [2022-01-31 16:15:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 912 transitions. [2022-01-31 16:15:27,422 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 912 transitions. Word has length 63 [2022-01-31 16:15:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:27,423 INFO L470 AbstractCegarLoop]: Abstraction has 703 states and 912 transitions. [2022-01-31 16:15:27,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 912 transitions. [2022-01-31 16:15:27,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 16:15:27,424 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:27,424 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] [2022-01-31 16:15:27,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 16:15:27,424 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:27,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash -306718972, now seen corresponding path program 1 times [2022-01-31 16:15:27,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:27,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129407233] [2022-01-31 16:15:27,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:27,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 16:15:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 16:15:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:27,572 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 16:15:27,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:27,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129407233] [2022-01-31 16:15:27,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129407233] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:27,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:27,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 16:15:27,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508319124] [2022-01-31 16:15:27,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:27,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 16:15:27,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:27,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 16:15:27,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-31 16:15:27,573 INFO L87 Difference]: Start difference. First operand 703 states and 912 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 16:15:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:28,458 INFO L93 Difference]: Finished difference Result 775 states and 1026 transitions. [2022-01-31 16:15:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 16:15:28,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 66 [2022-01-31 16:15:28,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:28,460 INFO L225 Difference]: With dead ends: 775 [2022-01-31 16:15:28,460 INFO L226 Difference]: Without dead ends: 775 [2022-01-31 16:15:28,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:28,460 INFO L933 BasicCegarLoop]: 485 mSDtfsCounter, 685 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:28,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [696 Valid, 867 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:15:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-01-31 16:15:28,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 703. [2022-01-31 16:15:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 555 states have (on average 1.300900900900901) internal successors, (722), 569 states have internal predecessors, (722), 84 states have call successors, (84), 47 states have call predecessors, (84), 63 states have return successors, (104), 93 states have call predecessors, (104), 78 states have call successors, (104) [2022-01-31 16:15:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 910 transitions. [2022-01-31 16:15:28,467 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 910 transitions. Word has length 66 [2022-01-31 16:15:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:28,467 INFO L470 AbstractCegarLoop]: Abstraction has 703 states and 910 transitions. [2022-01-31 16:15:28,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 16:15:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 910 transitions. [2022-01-31 16:15:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 16:15:28,468 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:28,468 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] [2022-01-31 16:15:28,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 16:15:28,469 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash 526937182, now seen corresponding path program 1 times [2022-01-31 16:15:28,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:28,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545829200] [2022-01-31 16:15:28,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:28,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:28,790 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 16:15:28,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:28,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545829200] [2022-01-31 16:15:28,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545829200] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:28,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:28,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 16:15:28,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607312275] [2022-01-31 16:15:28,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:28,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 16:15:28,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:28,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 16:15:28,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:15:28,792 INFO L87 Difference]: Start difference. First operand 703 states and 910 transitions. Second operand has 21 states, 20 states have (on average 2.45) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 16:15:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:30,931 INFO L93 Difference]: Finished difference Result 796 states and 1048 transitions. [2022-01-31 16:15:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 16:15:30,931 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2022-01-31 16:15:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:30,933 INFO L225 Difference]: With dead ends: 796 [2022-01-31 16:15:30,933 INFO L226 Difference]: Without dead ends: 774 [2022-01-31 16:15:30,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2022-01-31 16:15:30,934 INFO L933 BasicCegarLoop]: 519 mSDtfsCounter, 1436 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 5164 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 5719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 5164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:30,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1440 Valid, 2866 Invalid, 5719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 5164 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-31 16:15:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-01-31 16:15:30,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 701. [2022-01-31 16:15:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 554 states have (on average 1.2996389891696751) internal successors, (720), 568 states have internal predecessors, (720), 83 states have call successors, (83), 47 states have call predecessors, (83), 63 states have return successors, (103), 92 states have call predecessors, (103), 77 states have call successors, (103) [2022-01-31 16:15:30,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 906 transitions. [2022-01-31 16:15:30,940 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 906 transitions. Word has length 67 [2022-01-31 16:15:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:30,941 INFO L470 AbstractCegarLoop]: Abstraction has 701 states and 906 transitions. [2022-01-31 16:15:30,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 16:15:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 906 transitions. [2022-01-31 16:15:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 16:15:30,942 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:30,942 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] [2022-01-31 16:15:30,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 16:15:30,942 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:30,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash 459314479, now seen corresponding path program 1 times [2022-01-31 16:15:30,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:30,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965876777] [2022-01-31 16:15:30,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:30,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 16:15:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:31,234 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 16:15:31,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:31,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965876777] [2022-01-31 16:15:31,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965876777] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:31,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:31,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 16:15:31,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411317872] [2022-01-31 16:15:31,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:31,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 16:15:31,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:31,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 16:15:31,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:15:31,235 INFO L87 Difference]: Start difference. First operand 701 states and 906 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 16:15:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:33,538 INFO L93 Difference]: Finished difference Result 791 states and 1039 transitions. [2022-01-31 16:15:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 16:15:33,538 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 66 [2022-01-31 16:15:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:33,540 INFO L225 Difference]: With dead ends: 791 [2022-01-31 16:15:33,540 INFO L226 Difference]: Without dead ends: 769 [2022-01-31 16:15:33,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2022-01-31 16:15:33,540 INFO L933 BasicCegarLoop]: 497 mSDtfsCounter, 344 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 5202 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 5329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 5202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:33,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 2486 Invalid, 5329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 5202 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 16:15:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2022-01-31 16:15:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 699. [2022-01-31 16:15:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 553 states have (on average 1.298372513562387) internal successors, (718), 567 states have internal predecessors, (718), 82 states have call successors, (82), 47 states have call predecessors, (82), 63 states have return successors, (102), 91 states have call predecessors, (102), 76 states have call successors, (102) [2022-01-31 16:15:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 902 transitions. [2022-01-31 16:15:33,548 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 902 transitions. Word has length 66 [2022-01-31 16:15:33,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:33,548 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 902 transitions. [2022-01-31 16:15:33,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 16:15:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 902 transitions. [2022-01-31 16:15:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 16:15:33,549 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:33,549 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] [2022-01-31 16:15:33,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 16:15:33,549 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:33,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1659747958, now seen corresponding path program 1 times [2022-01-31 16:15:33,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:33,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192568649] [2022-01-31 16:15:33,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:33,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:15:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 16:15:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:33,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 16:15:33,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:33,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192568649] [2022-01-31 16:15:33,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192568649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:33,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:33,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:33,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349990771] [2022-01-31 16:15:33,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:33,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:33,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:33,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:33,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:33,711 INFO L87 Difference]: Start difference. First operand 699 states and 902 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 16:15:34,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:34,799 INFO L93 Difference]: Finished difference Result 800 states and 1053 transitions. [2022-01-31 16:15:34,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 16:15:34,799 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-31 16:15:34,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:34,801 INFO L225 Difference]: With dead ends: 800 [2022-01-31 16:15:34,801 INFO L226 Difference]: Without dead ends: 800 [2022-01-31 16:15:34,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:15:34,801 INFO L933 BasicCegarLoop]: 498 mSDtfsCounter, 780 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:34,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [783 Valid, 1016 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:15:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-01-31 16:15:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 705. [2022-01-31 16:15:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 558 states have (on average 1.2974910394265233) internal successors, (724), 572 states have internal predecessors, (724), 83 states have call successors, (83), 47 states have call predecessors, (83), 63 states have return successors, (103), 92 states have call predecessors, (103), 77 states have call successors, (103) [2022-01-31 16:15:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 910 transitions. [2022-01-31 16:15:34,808 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 910 transitions. Word has length 65 [2022-01-31 16:15:34,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:34,808 INFO L470 AbstractCegarLoop]: Abstraction has 705 states and 910 transitions. [2022-01-31 16:15:34,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 16:15:34,808 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 910 transitions. [2022-01-31 16:15:34,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 16:15:34,809 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:34,809 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] [2022-01-31 16:15:34,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 16:15:34,810 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:34,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:34,810 INFO L85 PathProgramCache]: Analyzing trace with hash -697612646, now seen corresponding path program 1 times [2022-01-31 16:15:34,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:34,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063261693] [2022-01-31 16:15:34,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:34,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 16:15:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:34,975 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 16:15:34,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:34,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063261693] [2022-01-31 16:15:34,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063261693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:34,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:34,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:34,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250073560] [2022-01-31 16:15:34,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:34,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:34,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:34,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:34,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:34,977 INFO L87 Difference]: Start difference. First operand 705 states and 910 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:36,104 INFO L93 Difference]: Finished difference Result 777 states and 1020 transitions. [2022-01-31 16:15:36,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:15:36,105 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-01-31 16:15:36,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:36,106 INFO L225 Difference]: With dead ends: 777 [2022-01-31 16:15:36,106 INFO L226 Difference]: Without dead ends: 777 [2022-01-31 16:15:36,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:36,107 INFO L933 BasicCegarLoop]: 504 mSDtfsCounter, 615 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:36,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 1222 Invalid, 1886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 16:15:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2022-01-31 16:15:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 705. [2022-01-31 16:15:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 558 states have (on average 1.2939068100358424) internal successors, (722), 572 states have internal predecessors, (722), 83 states have call successors, (83), 47 states have call predecessors, (83), 63 states have return successors, (103), 92 states have call predecessors, (103), 77 states have call successors, (103) [2022-01-31 16:15:36,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 908 transitions. [2022-01-31 16:15:36,113 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 908 transitions. Word has length 66 [2022-01-31 16:15:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:36,114 INFO L470 AbstractCegarLoop]: Abstraction has 705 states and 908 transitions. [2022-01-31 16:15:36,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 908 transitions. [2022-01-31 16:15:36,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 16:15:36,115 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:36,115 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] [2022-01-31 16:15:36,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 16:15:36,115 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:36,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:36,115 INFO L85 PathProgramCache]: Analyzing trace with hash -346812709, now seen corresponding path program 1 times [2022-01-31 16:15:36,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:36,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121433316] [2022-01-31 16:15:36,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:36,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:36,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:36,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:36,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:36,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:36,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:36,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:36,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 16:15:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:36,334 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 16:15:36,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:36,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121433316] [2022-01-31 16:15:36,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121433316] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:36,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:36,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 16:15:36,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304080531] [2022-01-31 16:15:36,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:36,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 16:15:36,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:36,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 16:15:36,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-01-31 16:15:36,335 INFO L87 Difference]: Start difference. First operand 705 states and 908 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:38,054 INFO L93 Difference]: Finished difference Result 799 states and 1045 transitions. [2022-01-31 16:15:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 16:15:38,054 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-01-31 16:15:38,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:38,056 INFO L225 Difference]: With dead ends: 799 [2022-01-31 16:15:38,056 INFO L226 Difference]: Without dead ends: 725 [2022-01-31 16:15:38,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-01-31 16:15:38,056 INFO L933 BasicCegarLoop]: 507 mSDtfsCounter, 1192 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 3753 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 4200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 3753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:38,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1197 Valid, 2003 Invalid, 4200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [447 Valid, 3753 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 16:15:38,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-01-31 16:15:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 668. [2022-01-31 16:15:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 528 states have (on average 1.2803030303030303) internal successors, (676), 542 states have internal predecessors, (676), 76 states have call successors, (76), 47 states have call predecessors, (76), 63 states have return successors, (95), 85 states have call predecessors, (95), 70 states have call successors, (95) [2022-01-31 16:15:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 847 transitions. [2022-01-31 16:15:38,072 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 847 transitions. Word has length 66 [2022-01-31 16:15:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:38,072 INFO L470 AbstractCegarLoop]: Abstraction has 668 states and 847 transitions. [2022-01-31 16:15:38,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 847 transitions. [2022-01-31 16:15:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 16:15:38,074 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:38,074 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] [2022-01-31 16:15:38,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 16:15:38,074 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:38,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:38,074 INFO L85 PathProgramCache]: Analyzing trace with hash 255041077, now seen corresponding path program 1 times [2022-01-31 16:15:38,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:38,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062347642] [2022-01-31 16:15:38,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:38,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:38,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:38,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:38,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:38,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:38,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:38,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:38,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:38,222 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 16:15:38,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:38,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062347642] [2022-01-31 16:15:38,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062347642] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:38,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:38,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:15:38,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767969167] [2022-01-31 16:15:38,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:38,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:15:38,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:38,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:15:38,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:38,224 INFO L87 Difference]: Start difference. First operand 668 states and 847 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:39,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:39,393 INFO L93 Difference]: Finished difference Result 842 states and 1081 transitions. [2022-01-31 16:15:39,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:39,394 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2022-01-31 16:15:39,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:39,396 INFO L225 Difference]: With dead ends: 842 [2022-01-31 16:15:39,396 INFO L226 Difference]: Without dead ends: 842 [2022-01-31 16:15:39,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:39,396 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 964 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:39,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [978 Valid, 916 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 16:15:39,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-01-31 16:15:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 714. [2022-01-31 16:15:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 564 states have (on average 1.2730496453900708) internal successors, (718), 580 states have internal predecessors, (718), 78 states have call successors, (78), 49 states have call predecessors, (78), 71 states have return successors, (103), 93 states have call predecessors, (103), 72 states have call successors, (103) [2022-01-31 16:15:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 899 transitions. [2022-01-31 16:15:39,405 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 899 transitions. Word has length 67 [2022-01-31 16:15:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:39,405 INFO L470 AbstractCegarLoop]: Abstraction has 714 states and 899 transitions. [2022-01-31 16:15:39,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 899 transitions. [2022-01-31 16:15:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 16:15:39,406 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:39,407 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] [2022-01-31 16:15:39,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 16:15:39,407 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:39,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:39,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2058592464, now seen corresponding path program 1 times [2022-01-31 16:15:39,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:39,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271992081] [2022-01-31 16:15:39,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:39,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 16:15:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:39,572 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 16:15:39,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:39,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271992081] [2022-01-31 16:15:39,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271992081] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:39,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:39,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:39,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559128178] [2022-01-31 16:15:39,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:39,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:39,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:39,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:39,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:39,573 INFO L87 Difference]: Start difference. First operand 714 states and 899 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:40,527 INFO L93 Difference]: Finished difference Result 765 states and 978 transitions. [2022-01-31 16:15:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:40,527 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-01-31 16:15:40,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:40,528 INFO L225 Difference]: With dead ends: 765 [2022-01-31 16:15:40,528 INFO L226 Difference]: Without dead ends: 760 [2022-01-31 16:15:40,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:40,529 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 1233 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:40,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1235 Valid, 1080 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:15:40,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-01-31 16:15:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 709. [2022-01-31 16:15:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 560 states have (on average 1.2732142857142856) internal successors, (713), 576 states have internal predecessors, (713), 77 states have call successors, (77), 49 states have call predecessors, (77), 71 states have return successors, (102), 92 states have call predecessors, (102), 71 states have call successors, (102) [2022-01-31 16:15:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 892 transitions. [2022-01-31 16:15:40,535 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 892 transitions. Word has length 67 [2022-01-31 16:15:40,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:40,535 INFO L470 AbstractCegarLoop]: Abstraction has 709 states and 892 transitions. [2022-01-31 16:15:40,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:40,535 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 892 transitions. [2022-01-31 16:15:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 16:15:40,536 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:40,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:15:40,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 16:15:40,537 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:40,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:40,537 INFO L85 PathProgramCache]: Analyzing trace with hash -238065346, now seen corresponding path program 1 times [2022-01-31 16:15:40,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:40,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107758727] [2022-01-31 16:15:40,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:40,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:40,689 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 16:15:40,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:40,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107758727] [2022-01-31 16:15:40,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107758727] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:40,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:40,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 16:15:40,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075066612] [2022-01-31 16:15:40,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:40,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 16:15:40,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:40,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 16:15:40,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-31 16:15:40,690 INFO L87 Difference]: Start difference. First operand 709 states and 892 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:41,537 INFO L93 Difference]: Finished difference Result 763 states and 966 transitions. [2022-01-31 16:15:41,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 16:15:41,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2022-01-31 16:15:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:41,539 INFO L225 Difference]: With dead ends: 763 [2022-01-31 16:15:41,539 INFO L226 Difference]: Without dead ends: 746 [2022-01-31 16:15:41,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:41,539 INFO L933 BasicCegarLoop]: 463 mSDtfsCounter, 1100 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:41,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1116 Valid, 817 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:15:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-01-31 16:15:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 690. [2022-01-31 16:15:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 546 states have (on average 1.2637362637362637) internal successors, (690), 561 states have internal predecessors, (690), 76 states have call successors, (76), 48 states have call predecessors, (76), 67 states have return successors, (98), 88 states have call predecessors, (98), 70 states have call successors, (98) [2022-01-31 16:15:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 864 transitions. [2022-01-31 16:15:41,555 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 864 transitions. Word has length 68 [2022-01-31 16:15:41,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:41,556 INFO L470 AbstractCegarLoop]: Abstraction has 690 states and 864 transitions. [2022-01-31 16:15:41,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 864 transitions. [2022-01-31 16:15:41,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 16:15:41,557 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:41,557 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] [2022-01-31 16:15:41,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 16:15:41,557 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:41,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash -653091009, now seen corresponding path program 1 times [2022-01-31 16:15:41,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:41,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086490421] [2022-01-31 16:15:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:41,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:41,740 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 16:15:41,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:41,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086490421] [2022-01-31 16:15:41,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086490421] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:41,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:41,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:41,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709908718] [2022-01-31 16:15:41,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:41,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:41,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:41,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:41,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:41,741 INFO L87 Difference]: Start difference. First operand 690 states and 864 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:43,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:43,265 INFO L93 Difference]: Finished difference Result 816 states and 1041 transitions. [2022-01-31 16:15:43,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 16:15:43,265 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-01-31 16:15:43,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:43,267 INFO L225 Difference]: With dead ends: 816 [2022-01-31 16:15:43,267 INFO L226 Difference]: Without dead ends: 816 [2022-01-31 16:15:43,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-01-31 16:15:43,267 INFO L933 BasicCegarLoop]: 472 mSDtfsCounter, 1734 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1848 mSolverCounterSat, 633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 2481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 633 IncrementalHoareTripleChecker+Valid, 1848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:43,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1741 Valid, 1014 Invalid, 2481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [633 Valid, 1848 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 16:15:43,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2022-01-31 16:15:43,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 690. [2022-01-31 16:15:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 546 states have (on average 1.26007326007326) internal successors, (688), 561 states have internal predecessors, (688), 76 states have call successors, (76), 48 states have call predecessors, (76), 67 states have return successors, (98), 88 states have call predecessors, (98), 70 states have call successors, (98) [2022-01-31 16:15:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 862 transitions. [2022-01-31 16:15:43,274 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 862 transitions. Word has length 68 [2022-01-31 16:15:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:43,274 INFO L470 AbstractCegarLoop]: Abstraction has 690 states and 862 transitions. [2022-01-31 16:15:43,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 862 transitions. [2022-01-31 16:15:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-31 16:15:43,275 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:43,275 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 16:15:43,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 16:15:43,275 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:43,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:43,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1034853120, now seen corresponding path program 1 times [2022-01-31 16:15:43,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:43,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558638391] [2022-01-31 16:15:43,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:43,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 16:15:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 16:15:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:43,514 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 16:15:43,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:43,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558638391] [2022-01-31 16:15:43,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558638391] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:43,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:43,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 16:15:43,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405015084] [2022-01-31 16:15:43,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:43,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 16:15:43,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:43,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 16:15:43,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:15:43,515 INFO L87 Difference]: Start difference. First operand 690 states and 862 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 16:15:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:45,366 INFO L93 Difference]: Finished difference Result 778 states and 990 transitions. [2022-01-31 16:15:45,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 16:15:45,367 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2022-01-31 16:15:45,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:45,368 INFO L225 Difference]: With dead ends: 778 [2022-01-31 16:15:45,368 INFO L226 Difference]: Without dead ends: 756 [2022-01-31 16:15:45,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2022-01-31 16:15:45,369 INFO L933 BasicCegarLoop]: 459 mSDtfsCounter, 566 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 4524 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 4734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 4524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:45,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [571 Valid, 2641 Invalid, 4734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 4524 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 16:15:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-01-31 16:15:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 688. [2022-01-31 16:15:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 545 states have (on average 1.2587155963302752) internal successors, (686), 560 states have internal predecessors, (686), 75 states have call successors, (75), 48 states have call predecessors, (75), 67 states have return successors, (97), 87 states have call predecessors, (97), 69 states have call successors, (97) [2022-01-31 16:15:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 858 transitions. [2022-01-31 16:15:45,376 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 858 transitions. Word has length 74 [2022-01-31 16:15:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:45,376 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 858 transitions. [2022-01-31 16:15:45,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 16:15:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 858 transitions. [2022-01-31 16:15:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-31 16:15:45,377 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:45,377 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] [2022-01-31 16:15:45,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 16:15:45,377 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:45,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash -8057471, now seen corresponding path program 1 times [2022-01-31 16:15:45,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:45,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312717023] [2022-01-31 16:15:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:45,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 16:15:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 16:15:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:45,669 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 16:15:45,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:45,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312717023] [2022-01-31 16:15:45,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312717023] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:45,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:45,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 16:15:45,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709161859] [2022-01-31 16:15:45,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:45,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 16:15:45,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:45,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 16:15:45,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-01-31 16:15:45,671 INFO L87 Difference]: Start difference. First operand 688 states and 858 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (10), 10 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 16:15:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:47,994 INFO L93 Difference]: Finished difference Result 759 states and 958 transitions. [2022-01-31 16:15:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 16:15:47,995 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (10), 10 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2022-01-31 16:15:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:47,996 INFO L225 Difference]: With dead ends: 759 [2022-01-31 16:15:47,996 INFO L226 Difference]: Without dead ends: 735 [2022-01-31 16:15:47,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 16:15:47,997 INFO L933 BasicCegarLoop]: 450 mSDtfsCounter, 767 mSDsluCounter, 2554 mSDsCounter, 0 mSdLazyCounter, 5469 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 5754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 5469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:47,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [769 Valid, 3004 Invalid, 5754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 5469 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 16:15:47,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-01-31 16:15:48,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 685. [2022-01-31 16:15:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 543 states have (on average 1.2578268876611418) internal successors, (683), 558 states have internal predecessors, (683), 74 states have call successors, (74), 48 states have call predecessors, (74), 67 states have return successors, (96), 86 states have call predecessors, (96), 68 states have call successors, (96) [2022-01-31 16:15:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 853 transitions. [2022-01-31 16:15:48,003 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 853 transitions. Word has length 70 [2022-01-31 16:15:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:48,003 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 853 transitions. [2022-01-31 16:15:48,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (10), 10 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 16:15:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 853 transitions. [2022-01-31 16:15:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-31 16:15:48,004 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:48,004 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 16:15:48,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-31 16:15:48,004 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:48,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:48,004 INFO L85 PathProgramCache]: Analyzing trace with hash 226042889, now seen corresponding path program 1 times [2022-01-31 16:15:48,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:48,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014897299] [2022-01-31 16:15:48,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:48,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:15:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:48,306 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 16:15:48,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:48,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014897299] [2022-01-31 16:15:48,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014897299] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:48,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:48,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 16:15:48,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646550303] [2022-01-31 16:15:48,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:48,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 16:15:48,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:48,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 16:15:48,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:48,307 INFO L87 Difference]: Start difference. First operand 685 states and 853 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:49,992 INFO L93 Difference]: Finished difference Result 752 states and 948 transitions. [2022-01-31 16:15:49,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 16:15:49,992 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 72 [2022-01-31 16:15:49,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:49,994 INFO L225 Difference]: With dead ends: 752 [2022-01-31 16:15:49,994 INFO L226 Difference]: Without dead ends: 733 [2022-01-31 16:15:49,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:15:49,994 INFO L933 BasicCegarLoop]: 450 mSDtfsCounter, 465 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 4196 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 2376 SdHoareTripleChecker+Invalid, 4372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 4196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:49,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 2376 Invalid, 4372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 4196 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 16:15:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2022-01-31 16:15:49,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 683. [2022-01-31 16:15:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 542 states have (on average 1.2564575645756457) internal successors, (681), 557 states have internal predecessors, (681), 73 states have call successors, (73), 48 states have call predecessors, (73), 67 states have return successors, (95), 85 states have call predecessors, (95), 67 states have call successors, (95) [2022-01-31 16:15:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 849 transitions. [2022-01-31 16:15:50,000 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 849 transitions. Word has length 72 [2022-01-31 16:15:50,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:50,000 INFO L470 AbstractCegarLoop]: Abstraction has 683 states and 849 transitions. [2022-01-31 16:15:50,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 849 transitions. [2022-01-31 16:15:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 16:15:50,001 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:50,001 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] [2022-01-31 16:15:50,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-31 16:15:50,001 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:50,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:50,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1536662915, now seen corresponding path program 1 times [2022-01-31 16:15:50,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:50,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917888484] [2022-01-31 16:15:50,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:50,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 16:15:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:50,280 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 16:15:50,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:50,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917888484] [2022-01-31 16:15:50,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917888484] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:50,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:50,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 16:15:50,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741933256] [2022-01-31 16:15:50,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:50,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 16:15:50,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:50,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 16:15:50,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:15:50,281 INFO L87 Difference]: Start difference. First operand 683 states and 849 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:52,305 INFO L93 Difference]: Finished difference Result 747 states and 941 transitions. [2022-01-31 16:15:52,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 16:15:52,305 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2022-01-31 16:15:52,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:52,307 INFO L225 Difference]: With dead ends: 747 [2022-01-31 16:15:52,307 INFO L226 Difference]: Without dead ends: 719 [2022-01-31 16:15:52,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:15:52,307 INFO L933 BasicCegarLoop]: 440 mSDtfsCounter, 235 mSDsluCounter, 1934 mSDsCounter, 0 mSdLazyCounter, 4800 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 4890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 4800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:52,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 2374 Invalid, 4890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 4800 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-31 16:15:52,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-01-31 16:15:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 671. [2022-01-31 16:15:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 533 states have (on average 1.2570356472795496) internal successors, (670), 548 states have internal predecessors, (670), 71 states have call successors, (71), 48 states have call predecessors, (71), 66 states have return successors, (92), 82 states have call predecessors, (92), 65 states have call successors, (92) [2022-01-31 16:15:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 833 transitions. [2022-01-31 16:15:52,313 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 833 transitions. Word has length 69 [2022-01-31 16:15:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:52,313 INFO L470 AbstractCegarLoop]: Abstraction has 671 states and 833 transitions. [2022-01-31 16:15:52,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 833 transitions. [2022-01-31 16:15:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 16:15:52,314 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:52,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] [2022-01-31 16:15:52,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-31 16:15:52,315 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:52,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:52,315 INFO L85 PathProgramCache]: Analyzing trace with hash 300413188, now seen corresponding path program 1 times [2022-01-31 16:15:52,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:52,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954652649] [2022-01-31 16:15:52,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:52,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:15:52,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:52,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954652649] [2022-01-31 16:15:52,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954652649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:52,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:52,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:52,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180698030] [2022-01-31 16:15:52,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:52,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:52,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:52,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:52,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:52,505 INFO L87 Difference]: Start difference. First operand 671 states and 833 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:53,874 INFO L93 Difference]: Finished difference Result 794 states and 1003 transitions. [2022-01-31 16:15:53,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 16:15:53,875 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-01-31 16:15:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:53,876 INFO L225 Difference]: With dead ends: 794 [2022-01-31 16:15:53,876 INFO L226 Difference]: Without dead ends: 794 [2022-01-31 16:15:53,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2022-01-31 16:15:53,877 INFO L933 BasicCegarLoop]: 444 mSDtfsCounter, 1893 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 665 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1900 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:53,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1900 Valid, 951 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [665 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 16:15:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-01-31 16:15:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 669. [2022-01-31 16:15:53,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 531 states have (on average 1.256120527306968) internal successors, (667), 546 states have internal predecessors, (667), 71 states have call successors, (71), 48 states have call predecessors, (71), 66 states have return successors, (92), 82 states have call predecessors, (92), 65 states have call successors, (92) [2022-01-31 16:15:53,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 830 transitions. [2022-01-31 16:15:53,883 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 830 transitions. Word has length 69 [2022-01-31 16:15:53,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:53,883 INFO L470 AbstractCegarLoop]: Abstraction has 669 states and 830 transitions. [2022-01-31 16:15:53,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 830 transitions. [2022-01-31 16:15:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 16:15:53,884 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:53,885 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] [2022-01-31 16:15:53,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-31 16:15:53,885 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:53,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:53,885 INFO L85 PathProgramCache]: Analyzing trace with hash 300444932, now seen corresponding path program 1 times [2022-01-31 16:15:53,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:53,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607052992] [2022-01-31 16:15:53,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:53,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:53,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:15:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:54,144 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 16:15:54,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:54,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607052992] [2022-01-31 16:15:54,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607052992] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:54,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:54,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 16:15:54,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937216818] [2022-01-31 16:15:54,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:54,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 16:15:54,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:54,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 16:15:54,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-01-31 16:15:54,146 INFO L87 Difference]: Start difference. First operand 669 states and 830 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:55,748 INFO L93 Difference]: Finished difference Result 724 states and 909 transitions. [2022-01-31 16:15:55,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 16:15:55,748 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2022-01-31 16:15:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:55,750 INFO L225 Difference]: With dead ends: 724 [2022-01-31 16:15:55,750 INFO L226 Difference]: Without dead ends: 692 [2022-01-31 16:15:55,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2022-01-31 16:15:55,751 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 379 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 3909 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 4030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:55,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 1636 Invalid, 4030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 3909 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 16:15:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-01-31 16:15:55,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 640. [2022-01-31 16:15:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 507 states have (on average 1.252465483234714) internal successors, (635), 521 states have internal predecessors, (635), 70 states have call successors, (70), 47 states have call predecessors, (70), 62 states have return successors, (88), 78 states have call predecessors, (88), 64 states have call successors, (88) [2022-01-31 16:15:55,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 793 transitions. [2022-01-31 16:15:55,756 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 793 transitions. Word has length 69 [2022-01-31 16:15:55,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:55,756 INFO L470 AbstractCegarLoop]: Abstraction has 640 states and 793 transitions. [2022-01-31 16:15:55,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:15:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 793 transitions. [2022-01-31 16:15:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 16:15:55,757 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:55,757 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] [2022-01-31 16:15:55,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-31 16:15:55,758 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:55,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:55,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1365836196, now seen corresponding path program 1 times [2022-01-31 16:15:55,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:55,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728368907] [2022-01-31 16:15:55,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:55,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:55,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:15:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,018 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 16:15:56,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:56,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728368907] [2022-01-31 16:15:56,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728368907] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:56,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:56,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 16:15:56,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127747828] [2022-01-31 16:15:56,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:56,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 16:15:56,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:56,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 16:15:56,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 16:15:56,019 INFO L87 Difference]: Start difference. First operand 640 states and 793 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:56,890 INFO L93 Difference]: Finished difference Result 688 states and 865 transitions. [2022-01-31 16:15:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:15:56,890 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-01-31 16:15:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:56,891 INFO L225 Difference]: With dead ends: 688 [2022-01-31 16:15:56,891 INFO L226 Difference]: Without dead ends: 683 [2022-01-31 16:15:56,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:15:56,892 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 893 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:56,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [895 Valid, 1173 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:15:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-01-31 16:15:56,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 635. [2022-01-31 16:15:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 503 states have (on average 1.2524850894632207) internal successors, (630), 517 states have internal predecessors, (630), 69 states have call successors, (69), 47 states have call predecessors, (69), 62 states have return successors, (87), 77 states have call predecessors, (87), 63 states have call successors, (87) [2022-01-31 16:15:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 786 transitions. [2022-01-31 16:15:56,898 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 786 transitions. Word has length 69 [2022-01-31 16:15:56,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:56,898 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 786 transitions. [2022-01-31 16:15:56,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 786 transitions. [2022-01-31 16:15:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 16:15:56,899 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:56,899 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] [2022-01-31 16:15:56,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-31 16:15:56,899 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:56,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:56,899 INFO L85 PathProgramCache]: Analyzing trace with hash -415492251, now seen corresponding path program 1 times [2022-01-31 16:15:56,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:56,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148568303] [2022-01-31 16:15:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:56,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:56,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 16:15:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:15:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:57,131 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 16:15:57,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:57,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148568303] [2022-01-31 16:15:57,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148568303] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:57,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:57,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 16:15:57,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506618831] [2022-01-31 16:15:57,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:57,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 16:15:57,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:57,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 16:15:57,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-01-31 16:15:57,132 INFO L87 Difference]: Start difference. First operand 635 states and 786 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:58,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:58,669 INFO L93 Difference]: Finished difference Result 707 states and 886 transitions. [2022-01-31 16:15:58,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 16:15:58,669 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-01-31 16:15:58,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:58,671 INFO L225 Difference]: With dead ends: 707 [2022-01-31 16:15:58,671 INFO L226 Difference]: Without dead ends: 680 [2022-01-31 16:15:58,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2022-01-31 16:15:58,671 INFO L933 BasicCegarLoop]: 444 mSDtfsCounter, 1120 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 3369 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 3773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 3369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:58,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1123 Valid, 2155 Invalid, 3773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 3369 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 16:15:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-01-31 16:15:58,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 632. [2022-01-31 16:15:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 501 states have (on average 1.251497005988024) internal successors, (627), 515 states have internal predecessors, (627), 68 states have call successors, (68), 47 states have call predecessors, (68), 62 states have return successors, (86), 76 states have call predecessors, (86), 62 states have call successors, (86) [2022-01-31 16:15:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 781 transitions. [2022-01-31 16:15:58,679 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 781 transitions. Word has length 69 [2022-01-31 16:15:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:58,679 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 781 transitions. [2022-01-31 16:15:58,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 16:15:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 781 transitions. [2022-01-31 16:15:58,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 16:15:58,680 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:58,680 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] [2022-01-31 16:15:58,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-31 16:15:58,681 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:58,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:58,681 INFO L85 PathProgramCache]: Analyzing trace with hash 135714178, now seen corresponding path program 1 times [2022-01-31 16:15:58,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:58,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499442743] [2022-01-31 16:15:58,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:58,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:15:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:15:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:15:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:15:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:15:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 16:15:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:58,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 16:15:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:59,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:15:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:15:59,004 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 16:15:59,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:15:59,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499442743] [2022-01-31 16:15:59,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499442743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:15:59,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:15:59,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:15:59,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568932741] [2022-01-31 16:15:59,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:15:59,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:15:59,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:15:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:15:59,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:15:59,006 INFO L87 Difference]: Start difference. First operand 632 states and 781 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 16:15:59,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:15:59,962 INFO L93 Difference]: Finished difference Result 684 states and 858 transitions. [2022-01-31 16:15:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 16:15:59,963 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-01-31 16:15:59,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:15:59,964 INFO L225 Difference]: With dead ends: 684 [2022-01-31 16:15:59,964 INFO L226 Difference]: Without dead ends: 684 [2022-01-31 16:15:59,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-01-31 16:15:59,966 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 689 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 16:15:59,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [690 Valid, 1162 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 16:15:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-01-31 16:15:59,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 632. [2022-01-31 16:15:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 501 states have (on average 1.249500998003992) internal successors, (626), 515 states have internal predecessors, (626), 68 states have call successors, (68), 47 states have call predecessors, (68), 62 states have return successors, (86), 76 states have call predecessors, (86), 62 states have call successors, (86) [2022-01-31 16:15:59,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 780 transitions. [2022-01-31 16:15:59,971 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 780 transitions. Word has length 71 [2022-01-31 16:15:59,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:15:59,971 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 780 transitions. [2022-01-31 16:15:59,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 16:15:59,971 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 780 transitions. [2022-01-31 16:15:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 16:15:59,972 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:15:59,972 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] [2022-01-31 16:15:59,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-31 16:15:59,972 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:15:59,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:15:59,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1161206177, now seen corresponding path program 1 times [2022-01-31 16:15:59,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:15:59,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439959710] [2022-01-31 16:15:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:15:59,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:15:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:00,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:00,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:00,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:00,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:16:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:00,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:00,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 16:16:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:00,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 16:16:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:00,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:16:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:00,263 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 16:16:00,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:00,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439959710] [2022-01-31 16:16:00,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439959710] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:00,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:00,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 16:16:00,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894406856] [2022-01-31 16:16:00,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:00,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 16:16:00,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:00,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 16:16:00,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:16:00,264 INFO L87 Difference]: Start difference. First operand 632 states and 780 transitions. Second operand has 21 states, 20 states have (on average 2.65) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 16:16:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:01,988 INFO L93 Difference]: Finished difference Result 717 states and 901 transitions. [2022-01-31 16:16:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 16:16:01,991 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71 [2022-01-31 16:16:01,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:01,992 INFO L225 Difference]: With dead ends: 717 [2022-01-31 16:16:01,993 INFO L226 Difference]: Without dead ends: 682 [2022-01-31 16:16:01,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2022-01-31 16:16:01,993 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 710 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 4034 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 4297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 4034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:01,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [714 Valid, 2416 Invalid, 4297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 4034 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 16:16:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-01-31 16:16:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 627. [2022-01-31 16:16:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 497 states have (on average 1.2454728370221329) internal successors, (619), 511 states have internal predecessors, (619), 67 states have call successors, (67), 47 states have call predecessors, (67), 62 states have return successors, (84), 75 states have call predecessors, (84), 61 states have call successors, (84) [2022-01-31 16:16:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 770 transitions. [2022-01-31 16:16:01,998 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 770 transitions. Word has length 71 [2022-01-31 16:16:01,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:01,998 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 770 transitions. [2022-01-31 16:16:01,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 16:16:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 770 transitions. [2022-01-31 16:16:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 16:16:01,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:01,999 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] [2022-01-31 16:16:01,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-31 16:16:02,000 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1109131485, now seen corresponding path program 1 times [2022-01-31 16:16:02,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:02,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486277707] [2022-01-31 16:16:02,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:02,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:16:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 16:16:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 16:16:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:16:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:02,182 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 16:16:02,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:02,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486277707] [2022-01-31 16:16:02,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486277707] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:02,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:02,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:16:02,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307212656] [2022-01-31 16:16:02,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:02,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:16:02,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:02,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:16:02,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:16:02,184 INFO L87 Difference]: Start difference. First operand 627 states and 770 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 16:16:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:03,205 INFO L93 Difference]: Finished difference Result 677 states and 844 transitions. [2022-01-31 16:16:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:16:03,205 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-01-31 16:16:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:03,206 INFO L225 Difference]: With dead ends: 677 [2022-01-31 16:16:03,206 INFO L226 Difference]: Without dead ends: 671 [2022-01-31 16:16:03,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-01-31 16:16:03,207 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 442 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 1646 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:03,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 1145 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1646 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 16:16:03,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-01-31 16:16:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 621. [2022-01-31 16:16:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 492 states have (on average 1.2459349593495934) internal successors, (613), 506 states have internal predecessors, (613), 66 states have call successors, (66), 47 states have call predecessors, (66), 62 states have return successors, (83), 74 states have call predecessors, (83), 60 states have call successors, (83) [2022-01-31 16:16:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 762 transitions. [2022-01-31 16:16:03,212 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 762 transitions. Word has length 71 [2022-01-31 16:16:03,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:03,212 INFO L470 AbstractCegarLoop]: Abstraction has 621 states and 762 transitions. [2022-01-31 16:16:03,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 16:16:03,212 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 762 transitions. [2022-01-31 16:16:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 16:16:03,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:03,213 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] [2022-01-31 16:16:03,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-31 16:16:03,213 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:03,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:03,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1256769401, now seen corresponding path program 1 times [2022-01-31 16:16:03,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:03,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703164337] [2022-01-31 16:16:03,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:03,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:03,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:03,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:03,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:03,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:16:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:03,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:03,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:16:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:03,446 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 16:16:03,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:03,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703164337] [2022-01-31 16:16:03,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703164337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:03,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:03,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 16:16:03,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882680158] [2022-01-31 16:16:03,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:03,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 16:16:03,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:03,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 16:16:03,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-01-31 16:16:03,447 INFO L87 Difference]: Start difference. First operand 621 states and 762 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:16:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:05,078 INFO L93 Difference]: Finished difference Result 738 states and 910 transitions. [2022-01-31 16:16:05,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 16:16:05,078 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2022-01-31 16:16:05,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:05,079 INFO L225 Difference]: With dead ends: 738 [2022-01-31 16:16:05,079 INFO L226 Difference]: Without dead ends: 713 [2022-01-31 16:16:05,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2022-01-31 16:16:05,080 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 753 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 3547 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 3811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 3547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:05,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [766 Valid, 2017 Invalid, 3811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 3547 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 16:16:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-01-31 16:16:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 627. [2022-01-31 16:16:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 498 states have (on average 1.2349397590361446) internal successors, (615), 512 states have internal predecessors, (615), 66 states have call successors, (66), 47 states have call predecessors, (66), 62 states have return successors, (83), 74 states have call predecessors, (83), 60 states have call successors, (83) [2022-01-31 16:16:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 764 transitions. [2022-01-31 16:16:05,090 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 764 transitions. Word has length 71 [2022-01-31 16:16:05,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:05,090 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 764 transitions. [2022-01-31 16:16:05,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 16:16:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 764 transitions. [2022-01-31 16:16:05,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 16:16:05,091 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:05,091 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 16:16:05,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-31 16:16:05,091 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:05,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash 958622839, now seen corresponding path program 1 times [2022-01-31 16:16:05,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:05,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755474819] [2022-01-31 16:16:05,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:05,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:16:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 16:16:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:16:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:16:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:05,270 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 16:16:05,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:05,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755474819] [2022-01-31 16:16:05,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755474819] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:05,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:05,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 16:16:05,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832432658] [2022-01-31 16:16:05,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:05,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 16:16:05,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:05,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 16:16:05,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-01-31 16:16:05,271 INFO L87 Difference]: Start difference. First operand 627 states and 764 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 16:16:06,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:06,076 INFO L93 Difference]: Finished difference Result 676 states and 836 transitions. [2022-01-31 16:16:06,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 16:16:06,077 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2022-01-31 16:16:06,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:06,078 INFO L225 Difference]: With dead ends: 676 [2022-01-31 16:16:06,078 INFO L226 Difference]: Without dead ends: 665 [2022-01-31 16:16:06,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-01-31 16:16:06,078 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 626 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:06,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [627 Valid, 1138 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 16:16:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-01-31 16:16:06,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 615. [2022-01-31 16:16:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 487 states have (on average 1.2299794661190966) internal successors, (599), 501 states have internal predecessors, (599), 65 states have call successors, (65), 47 states have call predecessors, (65), 62 states have return successors, (82), 73 states have call predecessors, (82), 59 states have call successors, (82) [2022-01-31 16:16:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 746 transitions. [2022-01-31 16:16:06,083 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 746 transitions. Word has length 73 [2022-01-31 16:16:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:06,084 INFO L470 AbstractCegarLoop]: Abstraction has 615 states and 746 transitions. [2022-01-31 16:16:06,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 16:16:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 746 transitions. [2022-01-31 16:16:06,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 16:16:06,084 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:06,085 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 16:16:06,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-31 16:16:06,086 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:06,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:06,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1514534938, now seen corresponding path program 1 times [2022-01-31 16:16:06,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:06,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570982210] [2022-01-31 16:16:06,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:06,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:16:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:16:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:06,365 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 16:16:06,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:06,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570982210] [2022-01-31 16:16:06,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570982210] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:06,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:06,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 16:16:06,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072974956] [2022-01-31 16:16:06,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:06,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 16:16:06,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:06,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 16:16:06,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:16:06,367 INFO L87 Difference]: Start difference. First operand 615 states and 746 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-31 16:16:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:09,301 INFO L93 Difference]: Finished difference Result 1360 states and 1669 transitions. [2022-01-31 16:16:09,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-31 16:16:09,301 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 73 [2022-01-31 16:16:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:09,303 INFO L225 Difference]: With dead ends: 1360 [2022-01-31 16:16:09,303 INFO L226 Difference]: Without dead ends: 1353 [2022-01-31 16:16:09,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=676, Invalid=2630, Unknown=0, NotChecked=0, Total=3306 [2022-01-31 16:16:09,307 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 2588 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 3985 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2593 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 4843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 3985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:09,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2593 Valid, 1432 Invalid, 4843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 3985 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 16:16:09,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2022-01-31 16:16:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 974. [2022-01-31 16:16:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 775 states have (on average 1.2490322580645161) internal successors, (968), 798 states have internal predecessors, (968), 99 states have call successors, (99), 77 states have call predecessors, (99), 99 states have return successors, (130), 105 states have call predecessors, (130), 93 states have call successors, (130) [2022-01-31 16:16:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1197 transitions. [2022-01-31 16:16:09,316 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1197 transitions. Word has length 73 [2022-01-31 16:16:09,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:09,316 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1197 transitions. [2022-01-31 16:16:09,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-31 16:16:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1197 transitions. [2022-01-31 16:16:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 16:16:09,318 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:09,318 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 16:16:09,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-31 16:16:09,318 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:09,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:09,318 INFO L85 PathProgramCache]: Analyzing trace with hash -293312583, now seen corresponding path program 1 times [2022-01-31 16:16:09,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:09,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126559508] [2022-01-31 16:16:09,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:09,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:16:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 16:16:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:16:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 16:16:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 16:16:09,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:09,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126559508] [2022-01-31 16:16:09,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126559508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:09,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:09,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 16:16:09,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809734243] [2022-01-31 16:16:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:09,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 16:16:09,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:09,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 16:16:09,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-01-31 16:16:09,481 INFO L87 Difference]: Start difference. First operand 974 states and 1197 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-31 16:16:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:11,208 INFO L93 Difference]: Finished difference Result 1243 states and 1537 transitions. [2022-01-31 16:16:11,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 16:16:11,209 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 73 [2022-01-31 16:16:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:11,211 INFO L225 Difference]: With dead ends: 1243 [2022-01-31 16:16:11,211 INFO L226 Difference]: Without dead ends: 1243 [2022-01-31 16:16:11,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2022-01-31 16:16:11,211 INFO L933 BasicCegarLoop]: 697 mSDtfsCounter, 2475 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 822 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2479 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 2994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 822 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:11,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2479 Valid, 1408 Invalid, 2994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [822 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 16:16:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2022-01-31 16:16:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1067. [2022-01-31 16:16:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 848 states have (on average 1.2382075471698113) internal successors, (1050), 866 states have internal predecessors, (1050), 113 states have call successors, (113), 81 states have call predecessors, (113), 105 states have return successors, (146), 124 states have call predecessors, (146), 107 states have call successors, (146) [2022-01-31 16:16:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1309 transitions. [2022-01-31 16:16:11,221 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1309 transitions. Word has length 73 [2022-01-31 16:16:11,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:11,221 INFO L470 AbstractCegarLoop]: Abstraction has 1067 states and 1309 transitions. [2022-01-31 16:16:11,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-31 16:16:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1309 transitions. [2022-01-31 16:16:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-31 16:16:11,223 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:11,223 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 16:16:11,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-01-31 16:16:11,223 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:11,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1233732800, now seen corresponding path program 1 times [2022-01-31 16:16:11,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:11,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644119723] [2022-01-31 16:16:11,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:11,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:16:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 16:16:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 16:16:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:16:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:11,549 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 16:16:11,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:11,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644119723] [2022-01-31 16:16:11,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644119723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:11,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:11,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 16:16:11,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453317277] [2022-01-31 16:16:11,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:11,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 16:16:11,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:11,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 16:16:11,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-01-31 16:16:11,550 INFO L87 Difference]: Start difference. First operand 1067 states and 1309 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 16:16:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:13,330 INFO L93 Difference]: Finished difference Result 1198 states and 1495 transitions. [2022-01-31 16:16:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 16:16:13,331 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2022-01-31 16:16:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:13,333 INFO L225 Difference]: With dead ends: 1198 [2022-01-31 16:16:13,333 INFO L226 Difference]: Without dead ends: 1159 [2022-01-31 16:16:13,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2022-01-31 16:16:13,333 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 590 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 4016 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 2483 SdHoareTripleChecker+Invalid, 4245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 4016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:13,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [593 Valid, 2483 Invalid, 4245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 4016 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 16:16:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-01-31 16:16:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1063. [2022-01-31 16:16:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 844 states have (on average 1.2369668246445498) internal successors, (1044), 862 states have internal predecessors, (1044), 113 states have call successors, (113), 81 states have call predecessors, (113), 105 states have return successors, (146), 124 states have call predecessors, (146), 107 states have call successors, (146) [2022-01-31 16:16:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1303 transitions. [2022-01-31 16:16:13,344 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1303 transitions. Word has length 77 [2022-01-31 16:16:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:13,345 INFO L470 AbstractCegarLoop]: Abstraction has 1063 states and 1303 transitions. [2022-01-31 16:16:13,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 16:16:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1303 transitions. [2022-01-31 16:16:13,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-31 16:16:13,347 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:13,347 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 16:16:13,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-01-31 16:16:13,347 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:13,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash -7999414, now seen corresponding path program 1 times [2022-01-31 16:16:13,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:13,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540341484] [2022-01-31 16:16:13,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:13,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 16:16:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 16:16:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 16:16:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 16:16:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 16:16:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 16:16:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 16:16:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 16:16:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 16:16:13,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 16:16:13,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 16:16:13,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540341484] [2022-01-31 16:16:13,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540341484] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 16:16:13,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 16:16:13,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 16:16:13,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621526693] [2022-01-31 16:16:13,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 16:16:13,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 16:16:13,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 16:16:13,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 16:16:13,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-01-31 16:16:13,576 INFO L87 Difference]: Start difference. First operand 1063 states and 1303 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 16:16:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 16:16:14,772 INFO L93 Difference]: Finished difference Result 1155 states and 1435 transitions. [2022-01-31 16:16:14,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 16:16:14,772 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 75 [2022-01-31 16:16:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 16:16:14,774 INFO L225 Difference]: With dead ends: 1155 [2022-01-31 16:16:14,774 INFO L226 Difference]: Without dead ends: 1125 [2022-01-31 16:16:14,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-01-31 16:16:14,775 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 565 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 16:16:14,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 1560 Invalid, 2385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 16:16:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2022-01-31 16:16:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1045. [2022-01-31 16:16:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 830 states have (on average 1.236144578313253) internal successors, (1026), 848 states have internal predecessors, (1026), 109 states have call successors, (109), 81 states have call predecessors, (109), 105 states have return successors, (140), 120 states have call predecessors, (140), 103 states have call successors, (140) [2022-01-31 16:16:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1275 transitions. [2022-01-31 16:16:14,785 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1275 transitions. Word has length 75 [2022-01-31 16:16:14,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 16:16:14,786 INFO L470 AbstractCegarLoop]: Abstraction has 1045 states and 1275 transitions. [2022-01-31 16:16:14,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 16:16:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1275 transitions. [2022-01-31 16:16:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 16:16:14,787 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 16:16:14,787 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 16:16:14,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-01-31 16:16:14,787 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 16:16:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 16:16:14,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1981078137, now seen corresponding path program 1 times [2022-01-31 16:16:14,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 16:16:14,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928143949] [2022-01-31 16:16:14,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 16:16:14,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 16:16:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 16:16:14,797 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-31 16:16:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 16:16:14,837 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-31 16:16:14,837 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-31 16:16:14,838 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 16:16:14,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-01-31 16:16:14,841 INFO L732 BasicCegarLoop]: Path program 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] [2022-01-31 16:16:14,843 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 16:16:14,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 04:16:14 BasicIcfg [2022-01-31 16:16:14,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 16:16:14,919 INFO L158 Benchmark]: Toolchain (without parser) took 125168.67ms. Allocated memory was 172.0MB in the beginning and 423.6MB in the end (delta: 251.7MB). Free memory was 117.4MB in the beginning and 194.7MB in the end (delta: -77.3MB). Peak memory consumption was 175.4MB. Max. memory is 8.0GB. [2022-01-31 16:16:14,919 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 172.0MB. Free memory is still 135.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 16:16:14,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.53ms. Allocated memory was 172.0MB in the beginning and 305.1MB in the end (delta: 133.2MB). Free memory was 117.3MB in the beginning and 260.8MB in the end (delta: -143.6MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. [2022-01-31 16:16:14,920 INFO L158 Benchmark]: Boogie Preprocessor took 82.16ms. Allocated memory is still 305.1MB. Free memory was 260.8MB in the beginning and 255.5MB in the end (delta: 5.3MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-31 16:16:14,920 INFO L158 Benchmark]: RCFGBuilder took 962.86ms. Allocated memory is still 305.1MB. Free memory was 255.5MB in the beginning and 190.1MB in the end (delta: 65.5MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. [2022-01-31 16:16:14,920 INFO L158 Benchmark]: IcfgTransformer took 51.35ms. Allocated memory is still 305.1MB. Free memory was 190.1MB in the beginning and 182.2MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-01-31 16:16:14,921 INFO L158 Benchmark]: TraceAbstraction took 123535.82ms. Allocated memory was 305.1MB in the beginning and 423.6MB in the end (delta: 118.5MB). Free memory was 181.7MB in the beginning and 194.7MB in the end (delta: -13.0MB). Peak memory consumption was 106.5MB. Max. memory is 8.0GB. [2022-01-31 16:16:14,925 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.72ms. Allocated memory is still 172.0MB. Free memory is still 135.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 530.53ms. Allocated memory was 172.0MB in the beginning and 305.1MB in the end (delta: 133.2MB). Free memory was 117.3MB in the beginning and 260.8MB in the end (delta: -143.6MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 82.16ms. Allocated memory is still 305.1MB. Free memory was 260.8MB in the beginning and 255.5MB in the end (delta: 5.3MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 962.86ms. Allocated memory is still 305.1MB. Free memory was 255.5MB in the beginning and 190.1MB in the end (delta: 65.5MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. * IcfgTransformer took 51.35ms. Allocated memory is still 305.1MB. Free memory was 190.1MB in the beginning and 182.2MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 123535.82ms. Allocated memory was 305.1MB in the beginning and 423.6MB in the end (delta: 118.5MB). Free memory was 181.7MB in the beginning and 194.7MB in the end (delta: -13.0MB). Peak memory consumption was 106.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 59]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int s ; [L33] int UNLOADED ; [L34] int NP ; [L35] int DC ; [L36] int SKIP1 ; [L37] int SKIP2 ; [L38] int MPR1 ; [L39] int MPR3 ; [L40] int IPC ; [L41] int pended ; [L42] int compFptr ; [L43] int compRegistered ; [L44] int lowerDriverReturn ; [L45] int setEventCalled ; [L46] int customIrp ; [L47] int routine ; [L48] int myStatus ; [L49] int pirp ; [L50] int Executive ; [L51] int Suspended ; [L52] int KernelMode ; [L53] int DeviceUsageTypePaging ; VAL [\old(compFptr)=147535, \old(compRegistered)=147529, \old(customIrp)=147518, \old(DC)=147533, \old(DeviceUsageTypePaging)=147522, \old(Executive)=147515, \old(IPC)=147524, \old(KernelMode)=147520, \old(lowerDriverReturn)=147513, \old(MPR1)=147526, \old(MPR3)=147536, \old(myStatus)=147532, \old(NP)=147516, \old(pended)=147519, \old(pirp)=147527, \old(routine)=147514, \old(s)=147521, \old(setEventCalled)=147517, \old(SKIP1)=147523, \old(SKIP2)=147530, \old(Suspended)=147528, \old(UNLOADED)=147534, compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L1718] int pirp__IoStatus__Status ; [L1719] int d = __VERIFIER_nondet_int() ; [L1720] int status = __VERIFIER_nondet_int() ; [L1721] int irp = __VERIFIER_nondet_int() ; [L1722] int we_should_unload = __VERIFIER_nondet_int() ; [L1723] int irp_choice = __VERIFIER_nondet_int() ; [L1724] int devobj = __VERIFIER_nondet_int() ; [L1725] int __cil_tmp9 ; [L1730] s = 0 [L1731] UNLOADED = 0 [L1732] NP = 0 [L1733] DC = 0 [L1734] SKIP1 = 0 [L1735] SKIP2 = 0 [L1736] MPR1 = 0 [L1737] MPR3 = 0 [L1738] IPC = 0 [L1739] pended = 0 [L1740] compFptr = 0 [L1741] compRegistered = 0 [L1742] lowerDriverReturn = 0 [L1743] setEventCalled = 0 [L1744] customIrp = 0 [L1745] routine = 0 [L1746] myStatus = 0 [L1747] pirp = 0 [L1748] Executive = 0 [L1749] Suspended = 5 [L1750] KernelMode = 0 [L1751] DeviceUsageTypePaging = 1 [L1754] pirp = irp VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=0, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=0, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=-2, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1755] CALL _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=1, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=-2, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=5, UNLOADED=0] [L67] UNLOADED = 0 [L68] NP = 1 [L69] DC = 2 [L70] SKIP1 = 3 [L71] SKIP2 = 4 [L72] MPR1 = 5 [L73] MPR3 = 6 [L74] IPC = 7 [L75] s = UNLOADED [L76] pended = 0 [L77] compFptr = 0 [L78] compRegistered = 0 [L79] lowerDriverReturn = 0 [L80] setEventCalled = 0 [L81] customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-2, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1755] RET _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-2, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1757] COND TRUE status >= 0 [L1758] s = NP [L1759] customIrp = 0 [L1760] setEventCalled = customIrp [L1761] lowerDriverReturn = setEventCalled [L1762] compRegistered = lowerDriverReturn [L1763] compFptr = compRegistered [L1764] pended = compFptr [L1765] pirp__IoStatus__Status = 0 [L1766] myStatus = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1767] COND TRUE irp_choice == 0 [L1768] pirp__IoStatus__Status = -1073741637 [L1769] myStatus = -1073741637 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1772] CALL stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1707] s = NP [L1708] customIrp = 0 [L1709] setEventCalled = customIrp [L1710] lowerDriverReturn = setEventCalled [L1711] compRegistered = lowerDriverReturn [L1712] compFptr = compRegistered [L1713] pended = compFptr VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1772] RET stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1775] COND FALSE !(status < 0) [L1779] int tmp_ndt_1; [L1780] tmp_ndt_1 = __VERIFIER_nondet_int() [L1781] COND TRUE tmp_ndt_1 == 2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1798] CALL, EXPR CdAudioDeviceControl(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L313] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L314] int status ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L317] COND FALSE !(deviceExtension__Active == 2) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L320] COND FALSE !(deviceExtension__Active == 3) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L323] COND FALSE !(deviceExtension__Active == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L326] COND TRUE deviceExtension__Active == 7 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] CALL, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1591] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1592] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1593] int irpSp__Control ; [L1594] int tmp ; [L1595] int tmp___0 ; [L1596] int __cil_tmp8 ; [L1597] int __cil_tmp9 ; [L1598] int __cil_tmp10 ; [L1599] int __cil_tmp11 ; [L1600] int __cil_tmp12 ; [L1604] __cil_tmp8 = 56 [L1605] __cil_tmp9 = 16384 [L1606] __cil_tmp10 = 131072 [L1607] __cil_tmp11 = 147456 [L1608] __cil_tmp12 = 147512 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=-3, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=-3, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1610] COND FALSE !(s != NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=-3, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1615] COND FALSE !(compRegistered != 0) [L1620] compRegistered = 1 [L1621] routine = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=-3, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] irpSp__Control = 224 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=-3, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] CALL, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1900] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1901] int returnVal2 ; [L1902] int compRetStatus ; [L1903] int lcontext = __VERIFIER_nondet_int() ; [L1904] unsigned long __cil_tmp8 ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=4, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE \read(compRegistered) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=4, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1908] COND TRUE routine == 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=4, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] CALL, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=4, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1569] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1570] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1573] COND TRUE \read(Irp__PendingReturned) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=4, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=4, customIrp=0, DC=2, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=-4, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1574] COND TRUE pended == 0 [L1575] pended = 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=4, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=4, customIrp=0, DC=2, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=-4, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1582] COND FALSE !(myStatus >= 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=4, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=4, customIrp=0, DC=2, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=-4, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1587] return (myStatus); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=4, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=-1073741637, compFptr=0, compRegistered=1, Context=4, customIrp=0, DC=2, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=-4, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] RET, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, HPCdrCompletion(DeviceObject, Irp, lcontext)=-1073741637, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=4, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1920] __cil_tmp8 = (unsigned long )compRetStatus VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=4, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1921] COND FALSE !(__cil_tmp8 == -1073741802) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=4, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1928] COND FALSE !(\read(Irp__PendingReturned)) [L1931] int tmp_ndt_4; [L1932] tmp_ndt_4 = __VERIFIER_nondet_int() [L1933] COND TRUE tmp_ndt_4 == 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=4, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1944] returnVal2 = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=4, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, returnVal2=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1958] COND TRUE s == NP [L1959] s = IPC [L1960] lowerDriverReturn = returnVal2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=4, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1981] return (returnVal2); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=-3, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=-3, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, Irp__PendingReturned=0, KernelMode=0, lcontext=4, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1626] RET, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=-3, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IofCallDriver(deviceExtension__TargetDeviceObject, Irp)=0, IPC=7, Irp=-2, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1628] return (tmp); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=-3, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp=0, UNLOADED=0] [L348] RET, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, CdAudioHPCdrDeviceControl(DeviceObject, Irp)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L363] return (status); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=-2, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=-2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0] [L1798] RET, EXPR CdAudioDeviceControl(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, CdAudioDeviceControl(devobj, pirp)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1798] status = CdAudioDeviceControl(devobj, pirp) [L1819] COND FALSE !(\read(we_should_unload)) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1825] COND TRUE pended == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1826] COND FALSE !(s == NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1833] COND TRUE pended == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1834] COND FALSE !(s == MPR3) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1841] COND TRUE s != UNLOADED VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1842] COND TRUE status != -1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1843] COND TRUE s != SKIP2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1844] COND FALSE !(s != IPC) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1857] COND FALSE !(pended != 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1869] COND TRUE status != 259 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=-2, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1871] CALL errorFn() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L59] reach_error() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 517 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 123.4s, OverallIterations: 67, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 109.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72103 SdHoareTripleChecker+Valid, 98.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71683 mSDsluCounter, 116949 SdHoareTripleChecker+Invalid, 83.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78104 mSDsCounter, 25185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186530 IncrementalHoareTripleChecker+Invalid, 211715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25185 mSolverCounterUnsat, 38845 mSDtfsCounter, 186530 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1748 GetRequests, 647 SyntacticMatches, 14 SemanticMatches, 1087 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 15.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1067occurred in iteration=64, InterpolantAutomatonStates: 893, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 66 MinimizatonAttempts, 8496 StatesRemovedByMinimization, 66 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 3939 NumberOfCodeBlocks, 3939 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 3800 ConstructedInterpolants, 0 QuantifiedInterpolants, 20068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 66 InterpolantComputations, 66 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-31 16:16:14,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...