./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 791fd4c1f54f973c646b3f11f7eb2f654eca269cacf7e504443ee0d13fbe9694 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:31:18,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:31:19,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:31:19,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:31:19,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:31:19,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:31:19,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:31:19,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:31:19,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:31:19,050 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:31:19,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:31:19,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:31:19,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:31:19,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:31:19,054 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:31:19,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:31:19,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:31:19,055 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:31:19,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:31:19,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:31:19,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:31:19,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:31:19,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:31:19,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:31:19,060 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:31:19,060 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:31:19,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:31:19,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:31:19,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:31:19,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:31:19,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:31:19,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:31:19,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:31:19,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:31:19,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:31:19,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:31:19,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:31:19,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:31:19,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:31:19,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:31:19,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:31:19,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:31:19,067 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 791fd4c1f54f973c646b3f11f7eb2f654eca269cacf7e504443ee0d13fbe9694 [2024-10-10 22:31:19,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:31:19,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:31:19,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:31:19,347 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:31:19,348 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:31:19,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2024-10-10 22:31:20,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:31:21,047 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:31:21,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2024-10-10 22:31:21,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d8faa457f/81a762b1a9d34fe7af621c99f8d35b82/FLAGbe8f67cb2 [2024-10-10 22:31:21,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d8faa457f/81a762b1a9d34fe7af621c99f8d35b82 [2024-10-10 22:31:21,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:31:21,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:31:21,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:31:21,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:31:21,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:31:21,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:31:21" (1/1) ... [2024-10-10 22:31:21,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b4bfe9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:21, skipping insertion in model container [2024-10-10 22:31:21,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:31:21" (1/1) ... [2024-10-10 22:31:21,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:31:21,873 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2024-10-10 22:31:22,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:31:22,178 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:31:22,188 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,8) [16] [2024-10-10 22:31:22,190 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [17] [2024-10-10 22:31:22,190 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [175] [2024-10-10 22:31:22,190 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [181] [2024-10-10 22:31:22,191 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [402] [2024-10-10 22:31:22,191 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [455] [2024-10-10 22:31:22,191 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,1) [474] [2024-10-10 22:31:22,191 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [475] [2024-10-10 22:31:22,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1148] [2024-10-10 22:31:22,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1321] [2024-10-10 22:31:22,193 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,8) [1417] [2024-10-10 22:31:22,193 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1418] [2024-10-10 22:31:22,193 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1421] [2024-10-10 22:31:22,193 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1422] [2024-10-10 22:31:22,193 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1423] [2024-10-10 22:31:22,193 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1424] [2024-10-10 22:31:22,194 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,1) [1425] [2024-10-10 22:31:22,194 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1426] [2024-10-10 22:31:22,194 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(push,4) [1433] [2024-10-10 22:31:22,194 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma pack(pop) [1434] [2024-10-10 22:31:22,195 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1435] [2024-10-10 22:31:22,195 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1436] [2024-10-10 22:31:22,195 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1437] [2024-10-10 22:31:22,195 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1441] [2024-10-10 22:31:22,195 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1442] [2024-10-10 22:31:22,196 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1464] [2024-10-10 22:31:22,196 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1465] [2024-10-10 22:31:22,196 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1466] [2024-10-10 22:31:22,196 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [1473] [2024-10-10 22:31:22,196 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [1474] [2024-10-10 22:31:22,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4164) [1475] [2024-10-10 22:31:22,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_enable) [1476] [2024-10-10 22:31:22,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_disable) [1477] [2024-10-10 22:31:22,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [1478] [2024-10-10 22:31:22,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1479] [2024-10-10 22:31:22,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1480] [2024-10-10 22:31:22,199 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1481] [2024-10-10 22:31:22,199 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1482] [2024-10-10 22:31:22,199 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1535] [2024-10-10 22:31:22,199 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [1536] [2024-10-10 22:31:22,199 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4200) [1600] [2024-10-10 22:31:22,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(default:4200) [1601] [2024-10-10 22:31:22,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(INIT,DriverEntry) [1642] [2024-10-10 22:31:22,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_AddDevice) [1643] [2024-10-10 22:31:22,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_CreateClose) [1644] [2024-10-10 22:31:22,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_IoCtl) [1645] [2024-10-10 22:31:22,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_InternIoCtl) [1646] [2024-10-10 22:31:22,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_Unload) [1647] [2024-10-10 22:31:22,201 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_DispatchPassThrough) [1648] [2024-10-10 22:31:22,201 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_PnP) [1649] [2024-10-10 22:31:22,201 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma alloc_text(PAGE,KbFilter_Power) [1650] [2024-10-10 22:31:22,201 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2349] [2024-10-10 22:31:22,201 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2350] [2024-10-10 22:31:22,201 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2351] [2024-10-10 22:31:22,201 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2352] [2024-10-10 22:31:22,202 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2353] [2024-10-10 22:31:22,202 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2354] [2024-10-10 22:31:22,202 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2355] [2024-10-10 22:31:22,202 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2356] [2024-10-10 22:31:22,202 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4035) [2357] [2024-10-10 22:31:22,202 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(push) [2358] [2024-10-10 22:31:22,202 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4164) [2359] [2024-10-10 22:31:22,202 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_enable) [2360] [2024-10-10 22:31:22,203 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma function(_disable) [2361] [2024-10-10 22:31:22,203 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(pop) [2362] [2024-10-10 22:31:22,203 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2363] [2024-10-10 22:31:22,205 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2364] [2024-10-10 22:31:22,205 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2365] [2024-10-10 22:31:22,205 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2366] [2024-10-10 22:31:22,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2367] [2024-10-10 22:31:22,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4103) [2368] [2024-10-10 22:31:22,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(disable:4200) [2369] [2024-10-10 22:31:22,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma warning(default:4200) [2370] [2024-10-10 22:31:22,259 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2024-10-10 22:31:22,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:31:22,394 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:31:22,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:22 WrapperNode [2024-10-10 22:31:22,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:31:22,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:31:22,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:31:22,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:31:22,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:22" (1/1) ... [2024-10-10 22:31:22,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:22" (1/1) ... [2024-10-10 22:31:22,517 INFO L138 Inliner]: procedures = 109, calls = 328, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1142 [2024-10-10 22:31:22,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:31:22,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:31:22,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:31:22,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:31:22,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:22" (1/1) ... [2024-10-10 22:31:22,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:22" (1/1) ... [2024-10-10 22:31:22,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:22" (1/1) ... [2024-10-10 22:31:22,612 INFO L175 MemorySlicer]: Split 203 memory accesses to 7 slices as follows [2, 79, 37, 8, 9, 3, 65]. 39 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 92 writes are split as follows [0, 28, 18, 1, 8, 2, 35]. [2024-10-10 22:31:22,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:22" (1/1) ... [2024-10-10 22:31:22,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:22" (1/1) ... [2024-10-10 22:31:22,659 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:22" (1/1) ... [2024-10-10 22:31:22,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:22" (1/1) ... [2024-10-10 22:31:22,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:22" (1/1) ... [2024-10-10 22:31:22,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:22" (1/1) ... [2024-10-10 22:31:22,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:31:22,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:31:22,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:31:22,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:31:22,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:22" (1/1) ... [2024-10-10 22:31:22,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:31:22,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:31:22,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:31:22,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:31:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2024-10-10 22:31:22,788 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2024-10-10 22:31:22,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-10 22:31:22,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-10 22:31:22,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-10 22:31:22,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-10 22:31:22,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-10 22:31:22,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-10 22:31:22,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-10 22:31:22,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-10 22:31:22,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-10 22:31:22,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-10 22:31:22,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-10 22:31:22,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-10 22:31:22,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-10 22:31:22,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-10 22:31:22,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-10 22:31:22,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-10 22:31:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-10 22:31:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-10 22:31:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-10 22:31:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-10 22:31:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-10 22:31:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 22:31:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 22:31:22,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-10 22:31:22,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-10 22:31:22,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-10 22:31:22,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-10 22:31:22,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-10 22:31:22,792 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2024-10-10 22:31:22,792 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2024-10-10 22:31:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 22:31:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 22:31:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-10 22:31:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-10 22:31:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-10 22:31:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-10 22:31:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-10 22:31:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2024-10-10 22:31:22,794 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2024-10-10 22:31:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2024-10-10 22:31:22,794 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2024-10-10 22:31:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-10 22:31:22,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:31:22,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 22:31:22,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-10 22:31:22,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-10 22:31:22,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-10 22:31:22,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-10 22:31:22,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-10 22:31:22,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-10 22:31:22,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-10 22:31:22,796 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2024-10-10 22:31:22,796 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2024-10-10 22:31:22,796 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2024-10-10 22:31:22,797 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2024-10-10 22:31:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-10 22:31:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-10 22:31:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-10 22:31:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-10 22:31:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-10 22:31:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-10 22:31:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-10 22:31:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 22:31:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:31:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 22:31:22,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-10 22:31:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-10 22:31:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-10 22:31:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-10 22:31:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-10 22:31:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-10 22:31:22,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-10 22:31:22,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-10 22:31:22,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-10 22:31:22,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-10 22:31:22,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-10 22:31:22,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-10 22:31:22,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:31:22,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:31:22,800 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2024-10-10 22:31:22,800 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2024-10-10 22:31:23,135 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:31:23,138 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:31:23,320 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-10 22:31:23,363 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2024-10-10 22:31:23,363 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2024-10-10 22:31:23,365 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-10 22:31:23,366 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-10 22:31:23,372 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-10 22:31:23,378 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-10 22:31:23,382 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-10 22:31:23,387 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-10 22:31:23,391 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-10 22:31:24,755 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume !false; [2024-10-10 22:31:24,755 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##95: assume false; [2024-10-10 22:31:24,755 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2024-10-10 22:31:24,755 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2024-10-10 22:31:24,755 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !false; [2024-10-10 22:31:24,756 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume false; [2024-10-10 22:31:24,756 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2024-10-10 22:31:24,756 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2024-10-10 22:31:24,756 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2024-10-10 22:31:24,756 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2024-10-10 22:31:24,756 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2024-10-10 22:31:24,757 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2024-10-10 22:31:24,757 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2024-10-10 22:31:24,757 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2024-10-10 22:31:24,871 INFO L? ?]: Removed 283 outVars from TransFormulas that were not future-live. [2024-10-10 22:31:24,872 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:31:24,988 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:31:24,989 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-10 22:31:24,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:31:24 BoogieIcfgContainer [2024-10-10 22:31:24,989 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:31:24,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:31:24,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:31:24,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:31:24,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:31:21" (1/3) ... [2024-10-10 22:31:24,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6714b035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:31:24, skipping insertion in model container [2024-10-10 22:31:24,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:31:22" (2/3) ... [2024-10-10 22:31:24,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6714b035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:31:24, skipping insertion in model container [2024-10-10 22:31:24,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:31:24" (3/3) ... [2024-10-10 22:31:25,000 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.c [2024-10-10 22:31:25,048 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:31:25,049 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:31:25,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:31:25,130 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f3dfa17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:31:25,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:31:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 214 states, 176 states have (on average 1.6988636363636365) internal successors, (299), 194 states have internal predecessors, (299), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-10 22:31:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 22:31:25,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:25,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:25,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:25,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1092688700, now seen corresponding path program 1 times [2024-10-10 22:31:25,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:25,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985348939] [2024-10-10 22:31:25,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:25,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:25,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:25,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985348939] [2024-10-10 22:31:25,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985348939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:25,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:25,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:31:25,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046745709] [2024-10-10 22:31:25,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:25,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:31:25,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:25,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:31:25,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:31:25,654 INFO L87 Difference]: Start difference. First operand has 214 states, 176 states have (on average 1.6988636363636365) internal successors, (299), 194 states have internal predecessors, (299), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:26,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:26,582 INFO L93 Difference]: Finished difference Result 425 states and 724 transitions. [2024-10-10 22:31:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:31:26,585 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-10 22:31:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:26,595 INFO L225 Difference]: With dead ends: 425 [2024-10-10 22:31:26,596 INFO L226 Difference]: Without dead ends: 209 [2024-10-10 22:31:26,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:31:26,605 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:26,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 22:31:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-10 22:31:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-10 22:31:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 173 states have (on average 1.606936416184971) internal successors, (278), 189 states have internal predecessors, (278), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-10 22:31:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 322 transitions. [2024-10-10 22:31:26,655 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 322 transitions. Word has length 13 [2024-10-10 22:31:26,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:26,656 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 322 transitions. [2024-10-10 22:31:26,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 322 transitions. [2024-10-10 22:31:26,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 22:31:26,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:26,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:26,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:31:26,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:26,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:26,659 INFO L85 PathProgramCache]: Analyzing trace with hash -834523262, now seen corresponding path program 1 times [2024-10-10 22:31:26,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:26,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094626608] [2024-10-10 22:31:26,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:26,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:26,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:26,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094626608] [2024-10-10 22:31:26,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094626608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:26,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:26,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:26,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655574635] [2024-10-10 22:31:26,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:26,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:26,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:26,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:26,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:26,895 INFO L87 Difference]: Start difference. First operand 209 states and 322 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:30,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:31:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:31,150 INFO L93 Difference]: Finished difference Result 226 states and 343 transitions. [2024-10-10 22:31:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:31,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-10 22:31:31,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:31,155 INFO L225 Difference]: With dead ends: 226 [2024-10-10 22:31:31,159 INFO L226 Difference]: Without dead ends: 209 [2024-10-10 22:31:31,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:31,161 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 0 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:31,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-10 22:31:31,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-10 22:31:31,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-10 22:31:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 173 states have (on average 1.6011560693641618) internal successors, (277), 189 states have internal predecessors, (277), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-10 22:31:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 321 transitions. [2024-10-10 22:31:31,182 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 321 transitions. Word has length 13 [2024-10-10 22:31:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:31,182 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 321 transitions. [2024-10-10 22:31:31,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 321 transitions. [2024-10-10 22:31:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-10 22:31:31,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:31,184 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:31,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:31:31,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:31,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1051561641, now seen corresponding path program 1 times [2024-10-10 22:31:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:31,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086732237] [2024-10-10 22:31:31,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:31,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:31,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:31,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086732237] [2024-10-10 22:31:31,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086732237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:31,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:31,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:31,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635085756] [2024-10-10 22:31:31,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:31,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:31,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:31,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:31,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:31,413 INFO L87 Difference]: Start difference. First operand 209 states and 321 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:35,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:31:37,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:31:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:37,415 INFO L93 Difference]: Finished difference Result 313 states and 470 transitions. [2024-10-10 22:31:37,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:37,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-10 22:31:37,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:37,417 INFO L225 Difference]: With dead ends: 313 [2024-10-10 22:31:37,417 INFO L226 Difference]: Without dead ends: 262 [2024-10-10 22:31:37,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:37,422 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 237 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:37,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 378 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 127 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2024-10-10 22:31:37,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-10 22:31:37,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 246. [2024-10-10 22:31:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 209 states have (on average 1.5311004784688995) internal successors, (320), 212 states have internal predecessors, (320), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (27), 25 states have call predecessors, (27), 18 states have call successors, (27) [2024-10-10 22:31:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 373 transitions. [2024-10-10 22:31:37,440 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 373 transitions. Word has length 20 [2024-10-10 22:31:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:37,441 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 373 transitions. [2024-10-10 22:31:37,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 373 transitions. [2024-10-10 22:31:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 22:31:37,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:37,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:37,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:31:37,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:37,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:37,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1408550771, now seen corresponding path program 1 times [2024-10-10 22:31:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:37,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93481881] [2024-10-10 22:31:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:37,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:37,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93481881] [2024-10-10 22:31:37,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93481881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:37,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:37,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:37,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568084994] [2024-10-10 22:31:37,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:37,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:37,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:37,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:37,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:37,647 INFO L87 Difference]: Start difference. First operand 246 states and 373 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:38,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:31:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:39,027 INFO L93 Difference]: Finished difference Result 371 states and 550 transitions. [2024-10-10 22:31:39,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:39,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-10 22:31:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:39,029 INFO L225 Difference]: With dead ends: 371 [2024-10-10 22:31:39,029 INFO L226 Difference]: Without dead ends: 292 [2024-10-10 22:31:39,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:39,031 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 261 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:39,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 364 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 22:31:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-10 22:31:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 270. [2024-10-10 22:31:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 235 states have (on average 1.5319148936170213) internal successors, (360), 236 states have internal predecessors, (360), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-10-10 22:31:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 408 transitions. [2024-10-10 22:31:39,059 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 408 transitions. Word has length 22 [2024-10-10 22:31:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:39,060 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 408 transitions. [2024-10-10 22:31:39,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 408 transitions. [2024-10-10 22:31:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 22:31:39,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:39,064 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:31:39,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:31:39,065 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:39,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:39,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1351311379, now seen corresponding path program 1 times [2024-10-10 22:31:39,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:39,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135246103] [2024-10-10 22:31:39,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:39,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:39,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:39,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135246103] [2024-10-10 22:31:39,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135246103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:39,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:39,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:39,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565751265] [2024-10-10 22:31:39,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:39,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:31:39,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:39,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:31:39,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:31:39,448 INFO L87 Difference]: Start difference. First operand 270 states and 408 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:41,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:31:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:42,828 INFO L93 Difference]: Finished difference Result 294 states and 435 transitions. [2024-10-10 22:31:42,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:31:42,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-10 22:31:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:42,831 INFO L225 Difference]: With dead ends: 294 [2024-10-10 22:31:42,831 INFO L226 Difference]: Without dead ends: 286 [2024-10-10 22:31:42,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:31:42,832 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 508 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:42,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 304 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-10 22:31:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-10 22:31:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 275. [2024-10-10 22:31:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 240 states have (on average 1.525) internal successors, (366), 241 states have internal predecessors, (366), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-10-10 22:31:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 414 transitions. [2024-10-10 22:31:42,854 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 414 transitions. Word has length 26 [2024-10-10 22:31:42,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:42,854 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 414 transitions. [2024-10-10 22:31:42,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 414 transitions. [2024-10-10 22:31:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-10 22:31:42,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:42,859 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:31:42,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:31:42,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:42,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:42,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2053465166, now seen corresponding path program 1 times [2024-10-10 22:31:42,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:42,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222721205] [2024-10-10 22:31:42,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:42,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:43,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:43,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222721205] [2024-10-10 22:31:43,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222721205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:43,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:43,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:31:43,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202299295] [2024-10-10 22:31:43,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:43,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:31:43,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:43,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:31:43,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:31:43,144 INFO L87 Difference]: Start difference. First operand 275 states and 414 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:44,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:31:46,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:46,089 INFO L93 Difference]: Finished difference Result 530 states and 800 transitions. [2024-10-10 22:31:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:31:46,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-10 22:31:46,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:46,092 INFO L225 Difference]: With dead ends: 530 [2024-10-10 22:31:46,092 INFO L226 Difference]: Without dead ends: 275 [2024-10-10 22:31:46,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:31:46,093 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:46,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 777 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 22:31:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-10 22:31:46,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-10-10 22:31:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 240 states have (on average 1.5208333333333333) internal successors, (365), 241 states have internal predecessors, (365), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-10-10 22:31:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 413 transitions. [2024-10-10 22:31:46,113 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 413 transitions. Word has length 28 [2024-10-10 22:31:46,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:46,113 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 413 transitions. [2024-10-10 22:31:46,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 413 transitions. [2024-10-10 22:31:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:31:46,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:46,116 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:31:46,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:31:46,116 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:46,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:46,117 INFO L85 PathProgramCache]: Analyzing trace with hash -229255744, now seen corresponding path program 1 times [2024-10-10 22:31:46,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:46,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11253594] [2024-10-10 22:31:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:46,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:46,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:46,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11253594] [2024-10-10 22:31:46,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11253594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:46,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:46,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:31:46,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539546334] [2024-10-10 22:31:46,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:46,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:31:46,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:46,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:31:46,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:31:46,416 INFO L87 Difference]: Start difference. First operand 275 states and 413 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:47,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:31:49,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:31:50,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:31:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:50,552 INFO L93 Difference]: Finished difference Result 543 states and 817 transitions. [2024-10-10 22:31:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:31:50,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-10 22:31:50,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:50,555 INFO L225 Difference]: With dead ends: 543 [2024-10-10 22:31:50,555 INFO L226 Difference]: Without dead ends: 275 [2024-10-10 22:31:50,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:31:50,557 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:50,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 780 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-10 22:31:50,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-10 22:31:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-10-10 22:31:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 240 states have (on average 1.5166666666666666) internal successors, (364), 241 states have internal predecessors, (364), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-10-10 22:31:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 412 transitions. [2024-10-10 22:31:50,574 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 412 transitions. Word has length 35 [2024-10-10 22:31:50,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:50,574 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 412 transitions. [2024-10-10 22:31:50,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 412 transitions. [2024-10-10 22:31:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:31:50,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:50,576 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:31:50,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:31:50,576 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:50,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1479102024, now seen corresponding path program 1 times [2024-10-10 22:31:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:50,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266113316] [2024-10-10 22:31:50,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:51,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:51,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266113316] [2024-10-10 22:31:51,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266113316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:51,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:51,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:51,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453615775] [2024-10-10 22:31:51,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:51,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:51,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:51,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:51,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:51,043 INFO L87 Difference]: Start difference. First operand 275 states and 412 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:52,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:31:53,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:53,093 INFO L93 Difference]: Finished difference Result 541 states and 814 transitions. [2024-10-10 22:31:53,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:53,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-10 22:31:53,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:53,095 INFO L225 Difference]: With dead ends: 541 [2024-10-10 22:31:53,095 INFO L226 Difference]: Without dead ends: 276 [2024-10-10 22:31:53,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:31:53,098 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:53,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 22:31:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-10 22:31:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-10-10 22:31:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 241 states have (on average 1.5145228215767634) internal successors, (365), 242 states have internal predecessors, (365), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-10-10 22:31:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 413 transitions. [2024-10-10 22:31:53,119 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 413 transitions. Word has length 35 [2024-10-10 22:31:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:53,120 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 413 transitions. [2024-10-10 22:31:53,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 413 transitions. [2024-10-10 22:31:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-10 22:31:53,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:53,122 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:31:53,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:31:53,122 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:53,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash -783745673, now seen corresponding path program 1 times [2024-10-10 22:31:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:53,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152835056] [2024-10-10 22:31:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:53,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:31:53,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:53,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152835056] [2024-10-10 22:31:53,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152835056] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:31:53,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656613356] [2024-10-10 22:31:53,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:53,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:31:53,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:31:53,617 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:31:53,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:31:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:54,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:31:54,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:31:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:31:54,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:31:54,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656613356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:54,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:31:54,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 22:31:54,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694609021] [2024-10-10 22:31:54,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:54,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:31:54,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:54,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:31:54,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:31:54,205 INFO L87 Difference]: Start difference. First operand 276 states and 413 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:57,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:31:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:57,236 INFO L93 Difference]: Finished difference Result 279 states and 415 transitions. [2024-10-10 22:31:57,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:31:57,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-10 22:31:57,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:57,239 INFO L225 Difference]: With dead ends: 279 [2024-10-10 22:31:57,239 INFO L226 Difference]: Without dead ends: 275 [2024-10-10 22:31:57,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:31:57,241 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 19 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:57,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 455 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 22:31:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-10 22:31:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-10-10 22:31:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 241 states have (on average 1.5062240663900415) internal successors, (363), 241 states have internal predecessors, (363), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-10-10 22:31:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 410 transitions. [2024-10-10 22:31:57,254 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 410 transitions. Word has length 36 [2024-10-10 22:31:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:57,255 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 410 transitions. [2024-10-10 22:31:57,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:31:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 410 transitions. [2024-10-10 22:31:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:31:57,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:57,258 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:31:57,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 22:31:57,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:31:57,459 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:57,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:57,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1945547580, now seen corresponding path program 1 times [2024-10-10 22:31:57,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:31:57,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098943192] [2024-10-10 22:31:57,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:57,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:31:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:31:57,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:31:57,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098943192] [2024-10-10 22:31:57,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098943192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:57,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:57,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:31:57,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386059207] [2024-10-10 22:31:57,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:57,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:31:57,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:31:57,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:31:57,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:31:57,900 INFO L87 Difference]: Start difference. First operand 275 states and 410 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:00,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:01,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:32:01,172 INFO L93 Difference]: Finished difference Result 294 states and 430 transitions. [2024-10-10 22:32:01,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:32:01,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-10 22:32:01,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:32:01,174 INFO L225 Difference]: With dead ends: 294 [2024-10-10 22:32:01,174 INFO L226 Difference]: Without dead ends: 286 [2024-10-10 22:32:01,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:32:01,175 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 492 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:32:01,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 303 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 22:32:01,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-10 22:32:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 276. [2024-10-10 22:32:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 242 states have (on average 1.5041322314049588) internal successors, (364), 242 states have internal predecessors, (364), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2024-10-10 22:32:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 411 transitions. [2024-10-10 22:32:01,187 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 411 transitions. Word has length 35 [2024-10-10 22:32:01,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:32:01,188 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 411 transitions. [2024-10-10 22:32:01,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 411 transitions. [2024-10-10 22:32:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-10 22:32:01,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:32:01,189 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:32:01,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:32:01,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:32:01,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:32:01,190 INFO L85 PathProgramCache]: Analyzing trace with hash -55985843, now seen corresponding path program 1 times [2024-10-10 22:32:01,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:32:01,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319388532] [2024-10-10 22:32:01,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:32:01,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:32:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:32:01,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:32:01,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319388532] [2024-10-10 22:32:01,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319388532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:32:01,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:32:01,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:32:01,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909293961] [2024-10-10 22:32:01,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:32:01,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:32:01,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:32:01,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:32:01,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:32:01,570 INFO L87 Difference]: Start difference. First operand 276 states and 411 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:05,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:06,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:32:06,315 INFO L93 Difference]: Finished difference Result 288 states and 422 transitions. [2024-10-10 22:32:06,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:32:06,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-10 22:32:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:32:06,317 INFO L225 Difference]: With dead ends: 288 [2024-10-10 22:32:06,317 INFO L226 Difference]: Without dead ends: 253 [2024-10-10 22:32:06,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:32:06,318 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 478 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:32:06,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 305 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-10 22:32:06,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-10 22:32:06,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2024-10-10 22:32:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.5251141552511416) internal successors, (334), 224 states have internal predecessors, (334), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-10 22:32:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2024-10-10 22:32:06,334 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 36 [2024-10-10 22:32:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:32:06,335 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2024-10-10 22:32:06,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2024-10-10 22:32:06,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:32:06,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:32:06,336 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:32:06,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:32:06,336 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:32:06,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:32:06,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1963528920, now seen corresponding path program 1 times [2024-10-10 22:32:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:32:06,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738235206] [2024-10-10 22:32:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:32:06,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:32:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:32:06,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:32:06,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738235206] [2024-10-10 22:32:06,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738235206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:32:06,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:32:06,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:32:06,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784993146] [2024-10-10 22:32:06,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:32:06,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:32:06,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:32:06,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:32:06,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:32:06,702 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:08,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:32:08,402 INFO L93 Difference]: Finished difference Result 298 states and 434 transitions. [2024-10-10 22:32:08,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:32:08,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-10 22:32:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:32:08,405 INFO L225 Difference]: With dead ends: 298 [2024-10-10 22:32:08,405 INFO L226 Difference]: Without dead ends: 265 [2024-10-10 22:32:08,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:32:08,406 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 298 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:32:08,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 411 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 22:32:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-10 22:32:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 250. [2024-10-10 22:32:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 219 states have (on average 1.5159817351598173) internal successors, (332), 224 states have internal predecessors, (332), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-10 22:32:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2024-10-10 22:32:08,418 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 42 [2024-10-10 22:32:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:32:08,418 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2024-10-10 22:32:08,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:08,419 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2024-10-10 22:32:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 22:32:08,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:32:08,419 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:32:08,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:32:08,420 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:32:08,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:32:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1026971197, now seen corresponding path program 1 times [2024-10-10 22:32:08,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:32:08,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805643249] [2024-10-10 22:32:08,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:32:08,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:32:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:08,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:32:08,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:32:08,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805643249] [2024-10-10 22:32:08,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805643249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:32:08,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:32:08,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:32:08,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850384025] [2024-10-10 22:32:08,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:32:08,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:32:08,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:32:08,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:32:08,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:32:08,663 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:10,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:32:10,860 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2024-10-10 22:32:10,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:32:10,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-10 22:32:10,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:32:10,863 INFO L225 Difference]: With dead ends: 274 [2024-10-10 22:32:10,863 INFO L226 Difference]: Without dead ends: 254 [2024-10-10 22:32:10,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:32:10,864 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 2 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:32:10,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 502 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 22:32:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-10 22:32:10,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2024-10-10 22:32:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 221 states have (on average 1.51131221719457) internal successors, (334), 226 states have internal predecessors, (334), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-10 22:32:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2024-10-10 22:32:10,881 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 44 [2024-10-10 22:32:10,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:32:10,881 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2024-10-10 22:32:10,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2024-10-10 22:32:10,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 22:32:10,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:32:10,882 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:32:10,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:32:10,883 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:32:10,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:32:10,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1953433795, now seen corresponding path program 1 times [2024-10-10 22:32:10,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:32:10,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461705397] [2024-10-10 22:32:10,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:32:10,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:32:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:32:11,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:32:11,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461705397] [2024-10-10 22:32:11,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461705397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:32:11,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:32:11,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:32:11,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100230964] [2024-10-10 22:32:11,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:32:11,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:32:11,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:32:11,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:32:11,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:32:11,116 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:32:11,783 INFO L93 Difference]: Finished difference Result 264 states and 388 transitions. [2024-10-10 22:32:11,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:32:11,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-10 22:32:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:32:11,785 INFO L225 Difference]: With dead ends: 264 [2024-10-10 22:32:11,785 INFO L226 Difference]: Without dead ends: 248 [2024-10-10 22:32:11,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:32:11,786 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 270 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:32:11,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 243 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:32:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-10 22:32:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2024-10-10 22:32:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 218 states have (on average 1.5045871559633028) internal successors, (328), 222 states have internal predecessors, (328), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-10 22:32:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 366 transitions. [2024-10-10 22:32:11,798 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 366 transitions. Word has length 44 [2024-10-10 22:32:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:32:11,798 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 366 transitions. [2024-10-10 22:32:11,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 366 transitions. [2024-10-10 22:32:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-10 22:32:11,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:32:11,799 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:32:11,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:32:11,800 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:32:11,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:32:11,800 INFO L85 PathProgramCache]: Analyzing trace with hash 435436015, now seen corresponding path program 1 times [2024-10-10 22:32:11,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:32:11,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705025370] [2024-10-10 22:32:11,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:32:11,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:32:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:32:12,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:32:12,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705025370] [2024-10-10 22:32:12,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705025370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:32:12,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:32:12,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:32:12,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234740603] [2024-10-10 22:32:12,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:32:12,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:32:12,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:32:12,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:32:12,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:32:12,082 INFO L87 Difference]: Start difference. First operand 248 states and 366 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:14,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:16,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:16,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:32:16,535 INFO L93 Difference]: Finished difference Result 264 states and 384 transitions. [2024-10-10 22:32:16,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:32:16,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-10 22:32:16,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:32:16,537 INFO L225 Difference]: With dead ends: 264 [2024-10-10 22:32:16,537 INFO L226 Difference]: Without dead ends: 246 [2024-10-10 22:32:16,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:32:16,538 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 5 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:32:16,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 722 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-10 22:32:16,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-10 22:32:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-10-10 22:32:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 216 states have (on average 1.5046296296296295) internal successors, (325), 220 states have internal predecessors, (325), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-10 22:32:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 363 transitions. [2024-10-10 22:32:16,550 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 363 transitions. Word has length 45 [2024-10-10 22:32:16,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:32:16,550 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 363 transitions. [2024-10-10 22:32:16,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 363 transitions. [2024-10-10 22:32:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 22:32:16,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:32:16,551 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:32:16,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:32:16,552 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:32:16,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:32:16,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2012317390, now seen corresponding path program 1 times [2024-10-10 22:32:16,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:32:16,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302938990] [2024-10-10 22:32:16,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:32:16,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:32:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-10 22:32:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:32:16,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:32:16,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302938990] [2024-10-10 22:32:16,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302938990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:32:16,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:32:16,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:32:16,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540884447] [2024-10-10 22:32:16,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:32:16,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:32:16,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:32:16,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:32:16,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:32:16,932 INFO L87 Difference]: Start difference. First operand 246 states and 363 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-10 22:32:18,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:21,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:22,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:25,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:32:25,704 INFO L93 Difference]: Finished difference Result 294 states and 421 transitions. [2024-10-10 22:32:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:32:25,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-10-10 22:32:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:32:25,706 INFO L225 Difference]: With dead ends: 294 [2024-10-10 22:32:25,706 INFO L226 Difference]: Without dead ends: 246 [2024-10-10 22:32:25,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:32:25,707 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 37 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:32:25,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1123 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-10-10 22:32:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-10 22:32:25,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-10-10 22:32:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 216 states have (on average 1.5) internal successors, (324), 220 states have internal predecessors, (324), 20 states have call successors, (20), 11 states have call predecessors, (20), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-10 22:32:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 362 transitions. [2024-10-10 22:32:25,742 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 362 transitions. Word has length 46 [2024-10-10 22:32:25,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:32:25,743 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 362 transitions. [2024-10-10 22:32:25,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-10 22:32:25,743 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 362 transitions. [2024-10-10 22:32:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-10 22:32:25,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:32:25,744 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:32:25,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 22:32:25,745 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:32:25,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:32:25,745 INFO L85 PathProgramCache]: Analyzing trace with hash -502045003, now seen corresponding path program 1 times [2024-10-10 22:32:25,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:32:25,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101003943] [2024-10-10 22:32:25,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:32:25,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:32:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:25,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-10 22:32:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:32:26,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:32:26,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101003943] [2024-10-10 22:32:26,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101003943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:32:26,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:32:26,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:32:26,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82510140] [2024-10-10 22:32:26,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:32:26,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:32:26,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:32:26,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:32:26,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:32:26,008 INFO L87 Difference]: Start difference. First operand 246 states and 362 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-10 22:32:27,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:28,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:32:29,857 INFO L93 Difference]: Finished difference Result 284 states and 402 transitions. [2024-10-10 22:32:29,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:32:29,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2024-10-10 22:32:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:32:29,860 INFO L225 Difference]: With dead ends: 284 [2024-10-10 22:32:29,860 INFO L226 Difference]: Without dead ends: 238 [2024-10-10 22:32:29,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:32:29,860 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 323 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:32:29,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 650 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-10 22:32:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-10 22:32:29,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 223. [2024-10-10 22:32:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 195 states have (on average 1.476923076923077) internal successors, (288), 199 states have internal predecessors, (288), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-10-10 22:32:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 321 transitions. [2024-10-10 22:32:29,876 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 321 transitions. Word has length 47 [2024-10-10 22:32:29,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:32:29,877 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 321 transitions. [2024-10-10 22:32:29,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-10 22:32:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 321 transitions. [2024-10-10 22:32:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 22:32:29,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:32:29,878 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:32:29,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 22:32:29,878 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:32:29,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:32:29,879 INFO L85 PathProgramCache]: Analyzing trace with hash -252186788, now seen corresponding path program 1 times [2024-10-10 22:32:29,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:32:29,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323783761] [2024-10-10 22:32:29,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:32:29,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:32:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:32:30,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:32:30,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323783761] [2024-10-10 22:32:30,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323783761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:32:30,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:32:30,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:32:30,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512499194] [2024-10-10 22:32:30,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:32:30,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:32:30,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:32:30,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:32:30,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:32:30,080 INFO L87 Difference]: Start difference. First operand 223 states and 321 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:31,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:33,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:33,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:32:33,960 INFO L93 Difference]: Finished difference Result 243 states and 344 transitions. [2024-10-10 22:32:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:32:33,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-10 22:32:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:32:33,962 INFO L225 Difference]: With dead ends: 243 [2024-10-10 22:32:33,962 INFO L226 Difference]: Without dead ends: 227 [2024-10-10 22:32:33,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:32:33,963 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 2 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:32:33,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 488 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-10 22:32:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-10 22:32:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2024-10-10 22:32:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 197 states have (on average 1.4720812182741116) internal successors, (290), 201 states have internal predecessors, (290), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-10-10 22:32:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 323 transitions. [2024-10-10 22:32:33,975 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 323 transitions. Word has length 46 [2024-10-10 22:32:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:32:33,975 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 323 transitions. [2024-10-10 22:32:33,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 323 transitions. [2024-10-10 22:32:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 22:32:33,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:32:33,976 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:32:33,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 22:32:33,976 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:32:33,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:32:33,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1946054748, now seen corresponding path program 1 times [2024-10-10 22:32:33,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:32:33,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317604941] [2024-10-10 22:32:33,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:32:33,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:32:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:32:34,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:32:34,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317604941] [2024-10-10 22:32:34,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317604941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:32:34,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:32:34,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:32:34,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382714433] [2024-10-10 22:32:34,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:32:34,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:32:34,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:32:34,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:32:34,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:32:34,207 INFO L87 Difference]: Start difference. First operand 225 states and 323 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:36,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:40,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:41,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:32:41,509 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2024-10-10 22:32:41,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:32:41,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-10 22:32:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:32:41,511 INFO L225 Difference]: With dead ends: 241 [2024-10-10 22:32:41,511 INFO L226 Difference]: Without dead ends: 223 [2024-10-10 22:32:41,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:32:41,512 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 5 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:32:41,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 724 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2024-10-10 22:32:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-10 22:32:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2024-10-10 22:32:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 195 states have (on average 1.471794871794872) internal successors, (287), 199 states have internal predecessors, (287), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-10-10 22:32:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 320 transitions. [2024-10-10 22:32:41,523 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 320 transitions. Word has length 46 [2024-10-10 22:32:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:32:41,524 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 320 transitions. [2024-10-10 22:32:41,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 320 transitions. [2024-10-10 22:32:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 22:32:41,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:32:41,525 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:32:41,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 22:32:41,525 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:32:41,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:32:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash -762720965, now seen corresponding path program 1 times [2024-10-10 22:32:41,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:32:41,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147528868] [2024-10-10 22:32:41,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:32:41,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:32:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:32:41,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:32:41,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147528868] [2024-10-10 22:32:41,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147528868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:32:41,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:32:41,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:32:41,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502860112] [2024-10-10 22:32:41,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:32:41,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:32:41,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:32:41,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:32:41,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:32:41,845 INFO L87 Difference]: Start difference. First operand 223 states and 320 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:43,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:44,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:44,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:32:44,682 INFO L93 Difference]: Finished difference Result 284 states and 402 transitions. [2024-10-10 22:32:44,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:32:44,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-10 22:32:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:32:44,684 INFO L225 Difference]: With dead ends: 284 [2024-10-10 22:32:44,684 INFO L226 Difference]: Without dead ends: 278 [2024-10-10 22:32:44,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:32:44,685 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 299 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:32:44,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 431 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 22:32:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-10 22:32:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 244. [2024-10-10 22:32:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 213 states have (on average 1.4366197183098592) internal successors, (306), 212 states have internal predecessors, (306), 18 states have call successors, (18), 10 states have call predecessors, (18), 12 states have return successors, (23), 22 states have call predecessors, (23), 14 states have call successors, (23) [2024-10-10 22:32:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 347 transitions. [2024-10-10 22:32:44,701 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 347 transitions. Word has length 46 [2024-10-10 22:32:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:32:44,701 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 347 transitions. [2024-10-10 22:32:44,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 347 transitions. [2024-10-10 22:32:44,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 22:32:44,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:32:44,703 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:32:44,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 22:32:44,703 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:32:44,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:32:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1435520571, now seen corresponding path program 1 times [2024-10-10 22:32:44,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:32:44,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515067638] [2024-10-10 22:32:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:32:44,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:32:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:32:44,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:32:44,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515067638] [2024-10-10 22:32:44,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515067638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:32:44,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:32:44,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:32:44,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571454796] [2024-10-10 22:32:44,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:32:44,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:32:44,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:32:44,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:32:44,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:32:44,996 INFO L87 Difference]: Start difference. First operand 244 states and 347 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:32:47,109 INFO L93 Difference]: Finished difference Result 282 states and 396 transitions. [2024-10-10 22:32:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:32:47,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-10 22:32:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:32:47,111 INFO L225 Difference]: With dead ends: 282 [2024-10-10 22:32:47,111 INFO L226 Difference]: Without dead ends: 249 [2024-10-10 22:32:47,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:32:47,111 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 279 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:32:47,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 458 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 22:32:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-10 22:32:47,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 221. [2024-10-10 22:32:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 193 states have (on average 1.461139896373057) internal successors, (282), 197 states have internal predecessors, (282), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-10-10 22:32:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 315 transitions. [2024-10-10 22:32:47,127 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 315 transitions. Word has length 46 [2024-10-10 22:32:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:32:47,127 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 315 transitions. [2024-10-10 22:32:47,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 315 transitions. [2024-10-10 22:32:47,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-10 22:32:47,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:32:47,128 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:32:47,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 22:32:47,129 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:32:47,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:32:47,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2124326647, now seen corresponding path program 1 times [2024-10-10 22:32:47,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:32:47,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115462629] [2024-10-10 22:32:47,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:32:47,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:32:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:32:47,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:32:47,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115462629] [2024-10-10 22:32:47,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115462629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:32:47,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:32:47,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:32:47,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805288037] [2024-10-10 22:32:47,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:32:47,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:32:47,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:32:47,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:32:47,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:32:47,441 INFO L87 Difference]: Start difference. First operand 221 states and 315 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:48,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-10 22:32:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:32:48,916 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2024-10-10 22:32:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:32:48,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-10 22:32:48,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:32:48,918 INFO L225 Difference]: With dead ends: 269 [2024-10-10 22:32:48,918 INFO L226 Difference]: Without dead ends: 263 [2024-10-10 22:32:48,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:32:48,919 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 282 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:32:48,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 418 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 22:32:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-10 22:32:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 230. [2024-10-10 22:32:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 202 states have (on average 1.4455445544554455) internal successors, (292), 205 states have internal predecessors, (292), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2024-10-10 22:32:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2024-10-10 22:32:48,938 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 47 [2024-10-10 22:32:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:32:48,938 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2024-10-10 22:32:48,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:32:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2024-10-10 22:32:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-10 22:32:48,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:32:48,940 INFO L215 NwaCegarLoop]: 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] [2024-10-10 22:32:48,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-10 22:32:48,943 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:32:48,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:32:48,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1433169863, now seen corresponding path program 1 times [2024-10-10 22:32:48,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:32:48,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192689473] [2024-10-10 22:32:48,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:32:48,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:32:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:49,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-10 22:32:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:32:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:32:49,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:32:49,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192689473] [2024-10-10 22:32:49,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192689473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:32:49,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:32:49,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:32:49,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652705684] [2024-10-10 22:32:49,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:32:49,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:32:49,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:32:49,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:32:49,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:32:49,242 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)