./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--platform--x86--ideapad-laptop.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--platform--x86--ideapad-laptop.ko-main.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 64bit --witnessprinter.graph.data.programhash 2259272f0273dfac0cad582092d6645e308d8387476548b6016b816b129472dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:54:26,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:54:26,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:54:26,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:54:26,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:54:26,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:54:26,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:54:26,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:54:26,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:54:26,940 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:54:26,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:54:26,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:54:26,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:54:26,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:54:26,942 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:54:26,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:54:26,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:54:26,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:54:26,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:54:26,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:54:26,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:54:26,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:54:26,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:54:26,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:54:26,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:54:26,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:54:26,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:54:26,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:54:26,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:54:26,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:54:26,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:54:26,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:54:26,943 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:54:26,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:54:26,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:54:26,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:54:26,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:54:26,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:54:26,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:54:26,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:54:26,943 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2259272f0273dfac0cad582092d6645e308d8387476548b6016b816b129472dc [2025-03-04 03:54:27,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:54:27,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:54:27,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:54:27,157 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:54:27,157 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:54:27,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--platform--x86--ideapad-laptop.ko-main.cil.out.i [2025-03-04 03:54:28,297 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/860e9ba97/171bedb9277b4b99af33c02c3d3755d2/FLAG061fdf0cd [2025-03-04 03:54:28,718 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:54:28,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--platform--x86--ideapad-laptop.ko-main.cil.out.i [2025-03-04 03:54:28,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/860e9ba97/171bedb9277b4b99af33c02c3d3755d2/FLAG061fdf0cd [2025-03-04 03:54:28,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/860e9ba97/171bedb9277b4b99af33c02c3d3755d2 [2025-03-04 03:54:28,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:54:28,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:54:28,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:54:28,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:54:28,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:54:28,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:54:28" (1/1) ... [2025-03-04 03:54:28,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70675efd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:28, skipping insertion in model container [2025-03-04 03:54:28,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:54:28" (1/1) ... [2025-03-04 03:54:28,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:54:29,569 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--platform--x86--ideapad-laptop.ko-main.cil.out.i[160403,160416] [2025-03-04 03:54:29,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:54:29,673 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:54:29,752 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3881-3882] [2025-03-04 03:54:29,835 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--platform--x86--ideapad-laptop.ko-main.cil.out.i[160403,160416] [2025-03-04 03:54:29,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:54:29,912 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:54:29,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:29 WrapperNode [2025-03-04 03:54:29,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:54:29,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:54:29,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:54:29,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:54:29,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:29" (1/1) ... [2025-03-04 03:54:29,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:29" (1/1) ... [2025-03-04 03:54:30,076 INFO L138 Inliner]: procedures = 196, calls = 1148, calls flagged for inlining = 91, calls inlined = 82, statements flattened = 2802 [2025-03-04 03:54:30,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:54:30,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:54:30,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:54:30,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:54:30,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:29" (1/1) ... [2025-03-04 03:54:30,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:29" (1/1) ... [2025-03-04 03:54:30,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:29" (1/1) ... [2025-03-04 03:54:30,215 INFO L175 MemorySlicer]: Split 642 memory accesses to 46 slices as follows [3, 4, 8, 6, 4, 7, 2, 8, 1, 2, 2, 4, 177, 56, 8, 11, 8, 10, 2, 5, 3, 4, 3, 5, 34, 20, 3, 4, 4, 3, 4, 184, 3, 4, 2, 3, 4, 3, 4, 2, 3, 4, 2, 3, 2, 4]. 29 percent of accesses are in the largest equivalence class. The 329 initializations are split as follows [3, 4, 8, 6, 4, 7, 2, 8, 0, 0, 0, 0, 3, 0, 8, 11, 8, 10, 2, 0, 0, 4, 3, 5, 0, 0, 3, 4, 0, 3, 4, 184, 3, 4, 0, 3, 4, 3, 4, 0, 3, 4, 0, 3, 0, 4]. The 240 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 4, 114, 56, 0, 0, 0, 0, 0, 2, 2, 0, 0, 0, 34, 14, 0, 0, 4, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0]. [2025-03-04 03:54:30,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:29" (1/1) ... [2025-03-04 03:54:30,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:29" (1/1) ... [2025-03-04 03:54:30,285 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:29" (1/1) ... [2025-03-04 03:54:30,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:29" (1/1) ... [2025-03-04 03:54:30,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:29" (1/1) ... [2025-03-04 03:54:30,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:29" (1/1) ... [2025-03-04 03:54:30,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:54:30,356 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:54:30,356 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:54:30,356 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:54:30,357 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:29" (1/1) ... [2025-03-04 03:54:30,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:54:30,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:54:30,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 03:54:30,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 03:54:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:54:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:54:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:54:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:54:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:54:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:54:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 03:54:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 03:54:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 03:54:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 03:54:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 03:54:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 03:54:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 03:54:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 03:54:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 03:54:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 03:54:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 03:54:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#24 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#25 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#26 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#27 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#28 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#29 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#30 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#31 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#32 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#33 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#34 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#35 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#36 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#37 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#38 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#39 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#40 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#41 [2025-03-04 03:54:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#42 [2025-03-04 03:54:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#43 [2025-03-04 03:54:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#44 [2025-03-04 03:54:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#45 [2025-03-04 03:54:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_input_exit [2025-03-04 03:54:30,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_input_exit [2025-03-04 03:54:30,408 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2025-03-04 03:54:30,408 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2025-03-04 03:54:30,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 03:54:30,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 03:54:30,408 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_input_report [2025-03-04 03:54:30,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_input_report [2025-03-04 03:54:30,408 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2025-03-04 03:54:30,409 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-04 03:54:30,409 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 03:54:30,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-04 03:54:30,409 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_sync_rfk_state [2025-03-04 03:54:30,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_sync_rfk_state [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-03-04 03:54:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#27 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#28 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#29 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#30 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#31 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#32 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#33 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#34 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#35 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#36 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#37 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#38 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#39 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#40 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#41 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#42 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#43 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#44 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#45 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read_ec_data [2025-03-04 03:54:30,410 INFO L138 BoogieDeclarations]: Found implementation of procedure read_ec_data [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-03-04 03:54:30,410 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_sync_touchpad_state [2025-03-04 03:54:30,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_sync_touchpad_state [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 03:54:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 03:54:30,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 03:54:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 03:54:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 03:54:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 03:54:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 03:54:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 03:54:30,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#27 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#28 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#29 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#30 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#31 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#32 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#33 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#34 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#35 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#36 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#37 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#38 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#39 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#40 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#41 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#42 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#43 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#44 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#45 [2025-03-04 03:54:30,414 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 03:54:30,414 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 03:54:30,415 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_backlight_init [2025-03-04 03:54:30,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_backlight_init [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure acpi_evaluate_integer [2025-03-04 03:54:30,415 INFO L138 BoogieDeclarations]: Found implementation of procedure acpi_evaluate_integer [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2025-03-04 03:54:30,415 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_acpi_notify [2025-03-04 03:54:30,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_acpi_notify [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-03-04 03:54:30,415 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-03-04 03:54:30,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#27 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#28 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#29 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#30 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#31 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#32 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#33 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#34 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#35 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#36 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#37 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#38 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#39 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#40 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#41 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#42 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#43 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#44 [2025-03-04 03:54:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#45 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure rfkill_destroy [2025-03-04 03:54:30,419 INFO L138 BoogieDeclarations]: Found implementation of procedure rfkill_destroy [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#38 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#39 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#40 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#41 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#42 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#43 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#44 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#45 [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure backlight_update_status [2025-03-04 03:54:30,419 INFO L138 BoogieDeclarations]: Found implementation of procedure backlight_update_status [2025-03-04 03:54:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure single_open [2025-03-04 03:54:30,419 INFO L138 BoogieDeclarations]: Found implementation of procedure single_open [2025-03-04 03:54:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_acpi_add [2025-03-04 03:54:30,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_acpi_add [2025-03-04 03:54:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_backlight_update_status [2025-03-04 03:54:30,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_backlight_update_status [2025-03-04 03:54:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-04 03:54:30,420 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-04 03:54:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure rfkill_init_sw_state [2025-03-04 03:54:30,420 INFO L138 BoogieDeclarations]: Found implementation of procedure rfkill_init_sw_state [2025-03-04 03:54:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 03:54:30,421 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 03:54:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure debugfs_create_file [2025-03-04 03:54:30,421 INFO L138 BoogieDeclarations]: Found implementation of procedure debugfs_create_file [2025-03-04 03:54:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:54:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:54:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:54:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:54:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:54:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:54:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 03:54:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 03:54:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 03:54:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 03:54:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 03:54:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#38 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#39 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#40 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#41 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#42 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#43 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#44 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#45 [2025-03-04 03:54:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure single_release [2025-03-04 03:54:30,422 INFO L138 BoogieDeclarations]: Found implementation of procedure single_release [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_backlight_get_brightness [2025-03-04 03:54:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_backlight_get_brightness [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_unregister_rfkill [2025-03-04 03:54:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_unregister_rfkill [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure seq_lseek [2025-03-04 03:54:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_lseek [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure method_vpcr [2025-03-04 03:54:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure method_vpcr [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure method_vpcw [2025-03-04 03:54:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure method_vpcw [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure sparse_keymap_free [2025-03-04 03:54:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure sparse_keymap_free [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#27 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#28 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#29 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#30 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#31 [2025-03-04 03:54:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#32 [2025-03-04 03:54:30,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#33 [2025-03-04 03:54:30,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#34 [2025-03-04 03:54:30,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#35 [2025-03-04 03:54:30,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#36 [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#37 [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#38 [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#39 [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#40 [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#41 [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#42 [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#43 [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#44 [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#45 [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-04 03:54:30,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_acpi_resume [2025-03-04 03:54:30,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_acpi_resume [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write_ec_cmd [2025-03-04 03:54:30,425 INFO L138 BoogieDeclarations]: Found implementation of procedure write_ec_cmd [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_platform_exit [2025-03-04 03:54:30,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_platform_exit [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure ideapad_debugfs_exit [2025-03-04 03:54:30,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ideapad_debugfs_exit [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:54:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#38 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#39 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#40 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#41 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#42 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#43 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#44 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#45 [2025-03-04 03:54:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:54:30,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:54:30,980 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:54:30,981 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:54:31,032 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3958: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-04 03:54:31,045 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6631: havoc sparse_keymap_report_event_#t~nondet466#1; [2025-03-04 03:54:31,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4541: call ULTIMATE.dealloc(~#hw_blocked~0#1.base, ~#hw_blocked~0#1.offset);havoc ~#hw_blocked~0#1.base, ~#hw_blocked~0#1.offset; [2025-03-04 03:54:31,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6598: havoc rfkill_set_hw_state_#t~nondet460#1; [2025-03-04 03:54:31,124 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4909: call ULTIMATE.dealloc(~#value~3#1.base, ~#value~3#1.offset);havoc ~#value~3#1.base, ~#value~3#1.offset;call ULTIMATE.dealloc(~#param~0#1.base, ~#param~0#1.offset);havoc ~#param~0#1.base, ~#param~0#1.offset; [2025-03-04 03:54:31,124 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6473: havoc i8042_command_#t~nondet435#1; [2025-03-04 03:54:31,155 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6436: havoc #t~nondet427; [2025-03-04 03:54:31,160 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6465: havoc #t~ret433.base, #t~ret433.offset; [2025-03-04 03:54:31,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6584: havoc rfkill_alloc_#t~ret458#1.base, rfkill_alloc_#t~ret458#1.offset; [2025-03-04 03:54:31,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6444: havoc acpi_video_backlight_support_#t~nondet429#1; [2025-03-04 03:54:31,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6568: havoc platform_device_alloc_#t~ret456#1.base, platform_device_alloc_#t~ret456#1.offset; [2025-03-04 03:54:31,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6635: havoc sparse_keymap_setup_#t~nondet467#1; [2025-03-04 03:54:31,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6594: havoc rfkill_register_#t~nondet459#1; [2025-03-04 03:54:31,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6480: havoc input_register_device_#t~nondet436#1; [2025-03-04 03:54:31,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4573: call ULTIMATE.dealloc(ideapad_register_rfkill_~#sw_blocked~0#1.base, ideapad_register_rfkill_~#sw_blocked~0#1.offset);havoc ideapad_register_rfkill_~#sw_blocked~0#1.base, ideapad_register_rfkill_~#sw_blocked~0#1.offset; [2025-03-04 03:54:31,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6456: havoc debugfs_create_dir_#t~ret431#1.base, debugfs_create_dir_#t~ret431#1.offset; [2025-03-04 03:54:31,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6639: havoc sysfs_create_group_#t~nondet468#1; [2025-03-04 03:54:31,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4013: havoc input_allocate_device_#t~ret59#1.base, input_allocate_device_#t~ret59#1.offset; [2025-03-04 03:54:31,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6565: havoc platform_device_add_#t~nondet455#1; [2025-03-04 03:54:31,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4055: call ULTIMATE.dealloc(read_method_int_~#result~0#1.base, read_method_int_~#result~0#1.offset);havoc read_method_int_~#result~0#1.base, read_method_int_~#result~0#1.offset; [2025-03-04 03:54:31,394 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4939: call ULTIMATE.dealloc(~#cfg~0#1.base, ~#cfg~0#1.offset);havoc ~#cfg~0#1.base, ~#cfg~0#1.offset; [2025-03-04 03:54:31,406 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4781: havoc #t~mem280;call ULTIMATE.dealloc(~#now~0.base, ~#now~0.offset);havoc ~#now~0.base, ~#now~0.offset; [2025-03-04 03:54:31,408 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6608: havoc #t~nondet461; [2025-03-04 03:54:31,428 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4069: call ULTIMATE.dealloc(~#result~1.base, ~#result~1.offset);havoc ~#result~1.base, ~#result~1.offset;call ULTIMATE.dealloc(~#params~0.base, ~#params~0.offset);havoc ~#params~0.base, ~#params~0.offset;call ULTIMATE.dealloc(~#in_obj~0.base, ~#in_obj~0.offset);havoc ~#in_obj~0.base, ~#in_obj~0.offset; [2025-03-04 03:54:31,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4088: call ULTIMATE.dealloc(~#params~1#1.base, ~#params~1#1.offset);havoc ~#params~1#1.base, ~#params~1#1.offset;call ULTIMATE.dealloc(~#in_obj~1#1.base, ~#in_obj~1#1.offset);havoc ~#in_obj~1#1.base, ~#in_obj~1#1.offset; [2025-03-04 03:54:31,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6440: havoc acpi_evaluate_object_#t~nondet428#1; [2025-03-04 03:54:40,959 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6543: havoc ldv_ideapad_pm_suspend_noirq_2_#t~nondet451#1; [2025-03-04 03:54:40,959 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6511: havoc ldv_ideapad_pm_poweroff_noirq_2_#t~nondet443#1; [2025-03-04 03:54:40,959 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6547: havoc ldv_ideapad_pm_thaw_early_2_#t~nondet452#1; [2025-03-04 03:54:40,959 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6515: havoc ldv_ideapad_pm_prepare_2_#t~nondet444#1; [2025-03-04 03:54:40,959 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4500: call ULTIMATE.dealloc(ideapad_is_visible_~#value~1#1.base, ideapad_is_visible_~#value~1#1.offset);havoc ideapad_is_visible_~#value~1#1.base, ideapad_is_visible_~#value~1#1.offset; [2025-03-04 03:54:40,959 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4403: call ULTIMATE.dealloc(show_ideapad_cam_~#result~2#1.base, show_ideapad_cam_~#result~2#1.offset);havoc show_ideapad_cam_~#result~2#1.base, show_ideapad_cam_~#result~2#1.offset; [2025-03-04 03:54:40,959 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6551: havoc ldv_ideapad_pm_thaw_noirq_2_#t~nondet453#1; [2025-03-04 03:54:40,959 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6519: havoc ldv_ideapad_pm_restore_early_2_#t~nondet445#1; [2025-03-04 03:54:40,959 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6487: havoc ldv_ideapad_pm_complete_2_#t~nondet437#1; [2025-03-04 03:54:40,960 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6523: havoc ldv_ideapad_pm_restore_noirq_2_#t~nondet446#1; [2025-03-04 03:54:40,960 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6491: havoc ldv_ideapad_pm_freeze_2_#t~nondet438#1; [2025-03-04 03:54:40,960 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6527: havoc ldv_ideapad_pm_resume_early_2_#t~nondet447#1; [2025-03-04 03:54:40,960 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4446: call ULTIMATE.dealloc(show_ideapad_fan_~#result~3#1.base, show_ideapad_fan_~#result~3#1.offset);havoc show_ideapad_fan_~#result~3#1.base, show_ideapad_fan_~#result~3#1.offset; [2025-03-04 03:54:40,960 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6495: havoc ldv_ideapad_pm_freeze_late_2_#t~nondet439#1; [2025-03-04 03:54:40,960 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6429: havoc acpi_bus_register_driver_#t~nondet426#1; [2025-03-04 03:54:40,960 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6531: havoc ldv_ideapad_pm_resume_noirq_2_#t~nondet448#1; [2025-03-04 03:54:40,960 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6499: havoc ldv_ideapad_pm_freeze_noirq_2_#t~nondet440#1; [2025-03-04 03:54:40,960 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6535: havoc ldv_ideapad_pm_suspend_2_#t~nondet449#1; [2025-03-04 03:54:40,960 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6503: havoc ldv_ideapad_pm_poweroff_2_#t~nondet441#1; [2025-03-04 03:54:40,960 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6539: havoc ldv_ideapad_pm_suspend_late_2_#t~nondet450#1; [2025-03-04 03:54:40,961 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6507: havoc ldv_ideapad_pm_poweroff_late_2_#t~nondet442#1; [2025-03-04 03:54:40,985 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6616: havoc #t~nondet463; [2025-03-04 03:54:41,244 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4107: call ULTIMATE.dealloc(~#val~0.base, ~#val~0.offset);havoc ~#val~0.base, ~#val~0.offset; [2025-03-04 03:54:41,269 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6469: havoc #t~nondet434; [2025-03-04 03:54:41,294 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6581: havoc #t~nondet457; [2025-03-04 03:54:41,421 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3968: havoc __kmalloc_#t~ret26#1.base, __kmalloc_#t~ret26#1.offset; [2025-03-04 03:54:41,733 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6447: havoc backlight_device_register_#t~ret430#1.base, backlight_device_register_#t~ret430#1.offset; [2025-03-04 03:54:41,733 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4804: call ULTIMATE.dealloc(~#props~0#1.base, ~#props~0#1.offset);havoc ~#props~0#1.base, ~#props~0#1.offset;call ULTIMATE.dealloc(~#max~0#1.base, ~#max~0#1.offset);havoc ~#max~0#1.base, ~#max~0#1.offset;call ULTIMATE.dealloc(~#now~1#1.base, ~#now~1#1.offset);havoc ~#now~1#1.base, ~#now~1#1.offset;call ULTIMATE.dealloc(~#power~0#1.base, ~#power~0#1.offset);havoc ~#power~0#1.base, ~#power~0#1.offset; [2025-03-04 03:54:42,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5060: call ULTIMATE.dealloc(~#vpc1~0#1.base, ~#vpc1~0#1.offset);havoc ~#vpc1~0#1.base, ~#vpc1~0#1.offset;call ULTIMATE.dealloc(~#vpc2~0#1.base, ~#vpc2~0#1.offset);havoc ~#vpc2~0#1.base, ~#vpc2~0#1.offset; [2025-03-04 03:54:42,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4887: call ULTIMATE.dealloc(ideapad_backlight_notify_brightness_~#now~2#1.base, ideapad_backlight_notify_brightness_~#now~2#1.offset);havoc ideapad_backlight_notify_brightness_~#now~2#1.base, ideapad_backlight_notify_brightness_~#now~2#1.offset; [2025-03-04 03:54:42,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4723: call ULTIMATE.dealloc(ideapad_input_novokey_~#long_pressed~0#1.base, ideapad_input_novokey_~#long_pressed~0#1.offset);havoc ideapad_input_novokey_~#long_pressed~0#1.base, ideapad_input_novokey_~#long_pressed~0#1.offset; [2025-03-04 03:54:42,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4864: call ULTIMATE.dealloc(ideapad_backlight_notify_power_~#power~1#1.base, ideapad_backlight_notify_power_~#power~1#1.offset);havoc ideapad_backlight_notify_power_~#power~1#1.base, ideapad_backlight_notify_power_~#power~1#1.offset; [2025-03-04 03:54:42,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4741: call ULTIMATE.dealloc(ideapad_check_special_buttons_~#value~2#1.base, ideapad_check_special_buttons_~#value~2#1.offset);havoc ideapad_check_special_buttons_~#value~2#1.base, ideapad_check_special_buttons_~#value~2#1.offset; [2025-03-04 03:54:42,958 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6620: havoc #t~nondet464; [2025-03-04 03:54:43,091 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3875: havoc #t~mem1;havoc #t~bitwise2; [2025-03-04 03:54:43,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6459: havoc #t~ret432.base, #t~ret432.offset; [2025-03-04 03:54:43,165 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6624: havoc #t~nondet465; [2025-03-04 03:54:43,444 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4149: call ULTIMATE.dealloc(~#val~1.base, ~#val~1.offset);havoc ~#val~1.base, ~#val~1.offset; [2025-03-04 03:54:43,757 INFO L? ?]: Removed 857 outVars from TransFormulas that were not future-live. [2025-03-04 03:54:43,757 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:54:43,787 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:54:43,787 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 03:54:43,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:54:43 BoogieIcfgContainer [2025-03-04 03:54:43,788 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:54:43,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:54:43,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:54:43,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:54:43,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:54:28" (1/3) ... [2025-03-04 03:54:43,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a11b925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:54:43, skipping insertion in model container [2025-03-04 03:54:43,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:54:29" (2/3) ... [2025-03-04 03:54:43,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a11b925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:54:43, skipping insertion in model container [2025-03-04 03:54:43,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:54:43" (3/3) ... [2025-03-04 03:54:43,797 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--platform--x86--ideapad-laptop.ko-main.cil.out.i [2025-03-04 03:54:43,807 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:54:43,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 32_7a_cilled_linux-3.8-rc1-drivers--platform--x86--ideapad-laptop.ko-main.cil.out.i that has 41 procedures, 733 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-04 03:54:43,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:54:43,858 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;@5e8a3b1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:54:43,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:54:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 733 states, 565 states have (on average 1.4495575221238939) internal successors, (819), 584 states have internal predecessors, (819), 126 states have call successors, (126), 40 states have call predecessors, (126), 40 states have return successors, (126), 122 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-04 03:54:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 03:54:43,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:54:43,874 INFO L218 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] [2025-03-04 03:54:43,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:54:43,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:54:43,880 INFO L85 PathProgramCache]: Analyzing trace with hash -48804776, now seen corresponding path program 1 times [2025-03-04 03:54:43,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:54:43,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902977158] [2025-03-04 03:54:43,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:54:43,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:54:46,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 03:54:46,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 03:54:46,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:54:46,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:54:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:54:47,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:54:47,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902977158] [2025-03-04 03:54:47,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902977158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:54:47,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:54:47,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:54:47,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880565820] [2025-03-04 03:54:47,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:54:47,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:54:47,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:54:47,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:54:47,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:54:47,309 INFO L87 Difference]: Start difference. First operand has 733 states, 565 states have (on average 1.4495575221238939) internal successors, (819), 584 states have internal predecessors, (819), 126 states have call successors, (126), 40 states have call predecessors, (126), 40 states have return successors, (126), 122 states have call predecessors, (126), 126 states have call successors, (126) 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) [2025-03-04 03:54:51,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:54:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:54:52,082 INFO L93 Difference]: Finished difference Result 2169 states and 3241 transitions. [2025-03-04 03:54:52,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:54:52,084 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 [2025-03-04 03:54:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:54:52,104 INFO L225 Difference]: With dead ends: 2169 [2025-03-04 03:54:52,104 INFO L226 Difference]: Without dead ends: 1435 [2025-03-04 03:54:52,113 INFO L434 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 [2025-03-04 03:54:52,114 INFO L435 NwaCegarLoop]: 1057 mSDtfsCounter, 1019 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-04 03:54:52,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 2100 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-03-04 03:54:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2025-03-04 03:54:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1431. [2025-03-04 03:54:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1107 states have (on average 1.4444444444444444) internal successors, (1599), 1135 states have internal predecessors, (1599), 245 states have call successors, (245), 79 states have call predecessors, (245), 78 states have return successors, (238), 230 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-04 03:54:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2082 transitions. [2025-03-04 03:54:52,214 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2082 transitions. Word has length 22 [2025-03-04 03:54:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:54:52,214 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 2082 transitions. [2025-03-04 03:54:52,215 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) [2025-03-04 03:54:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2082 transitions. [2025-03-04 03:54:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 03:54:52,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:54:52,218 INFO L218 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] [2025-03-04 03:54:52,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 03:54:52,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:54:52,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:54:52,219 INFO L85 PathProgramCache]: Analyzing trace with hash -420661323, now seen corresponding path program 1 times [2025-03-04 03:54:52,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:54:52,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377226723] [2025-03-04 03:54:52,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:54:52,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:54:54,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 03:54:54,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 03:54:54,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:54:54,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:54:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:54:54,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:54:54,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377226723] [2025-03-04 03:54:54,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377226723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:54:54,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:54:54,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:54:54,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567267984] [2025-03-04 03:54:54,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:54:54,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:54:54,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:54:54,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:54:54,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:54:54,798 INFO L87 Difference]: Start difference. First operand 1431 states and 2082 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-03-04 03:54:54,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:54:54,962 INFO L93 Difference]: Finished difference Result 1457 states and 2114 transitions. [2025-03-04 03:54:54,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:54:54,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 25 [2025-03-04 03:54:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:54:54,990 INFO L225 Difference]: With dead ends: 1457 [2025-03-04 03:54:54,990 INFO L226 Difference]: Without dead ends: 1444 [2025-03-04 03:54:54,991 INFO L434 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 [2025-03-04 03:54:54,992 INFO L435 NwaCegarLoop]: 1068 mSDtfsCounter, 1051 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:54:54,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 1084 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:54:54,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2025-03-04 03:54:55,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1431. [2025-03-04 03:54:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1107 states have (on average 1.4435411020776874) internal successors, (1598), 1135 states have internal predecessors, (1598), 245 states have call successors, (245), 79 states have call predecessors, (245), 78 states have return successors, (238), 230 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-04 03:54:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2081 transitions. [2025-03-04 03:54:55,062 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2081 transitions. Word has length 25 [2025-03-04 03:54:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:54:55,062 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 2081 transitions. [2025-03-04 03:54:55,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-03-04 03:54:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2081 transitions. [2025-03-04 03:54:55,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 03:54:55,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:54:55,064 INFO L218 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] [2025-03-04 03:54:55,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:54:55,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:54:55,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:54:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash -392032172, now seen corresponding path program 1 times [2025-03-04 03:54:55,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:54:55,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726683519] [2025-03-04 03:54:55,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:54:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:54:57,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 03:54:57,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 03:54:57,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:54:57,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:54:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:54:57,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:54:57,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726683519] [2025-03-04 03:54:57,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726683519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:54:57,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:54:57,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:54:57,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213574860] [2025-03-04 03:54:57,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:54:57,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:54:57,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:54:57,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:54:57,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:54:57,487 INFO L87 Difference]: Start difference. First operand 1431 states and 2081 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-03-04 03:55:01,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:55:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:55:01,999 INFO L93 Difference]: Finished difference Result 1433 states and 2082 transitions. [2025-03-04 03:55:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:55:02,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 25 [2025-03-04 03:55:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:55:02,007 INFO L225 Difference]: With dead ends: 1433 [2025-03-04 03:55:02,007 INFO L226 Difference]: Without dead ends: 1430 [2025-03-04 03:55:02,008 INFO L434 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 [2025-03-04 03:55:02,008 INFO L435 NwaCegarLoop]: 1050 mSDtfsCounter, 1032 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-04 03:55:02,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 1050 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-04 03:55:02,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2025-03-04 03:55:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2025-03-04 03:55:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1107 states have (on average 1.4426377597109303) internal successors, (1597), 1134 states have internal predecessors, (1597), 244 states have call successors, (244), 79 states have call predecessors, (244), 78 states have return successors, (238), 230 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-04 03:55:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2079 transitions. [2025-03-04 03:55:02,055 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2079 transitions. Word has length 25 [2025-03-04 03:55:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:55:02,056 INFO L471 AbstractCegarLoop]: Abstraction has 1430 states and 2079 transitions. [2025-03-04 03:55:02,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-03-04 03:55:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2079 transitions. [2025-03-04 03:55:02,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 03:55:02,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:55:02,058 INFO L218 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] [2025-03-04 03:55:02,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:55:02,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:55:02,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:55:02,058 INFO L85 PathProgramCache]: Analyzing trace with hash 730789914, now seen corresponding path program 1 times [2025-03-04 03:55:02,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:55:02,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686905235] [2025-03-04 03:55:02,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:55:02,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:55:04,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 03:55:04,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 03:55:04,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:55:04,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:55:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:55:04,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:55:04,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686905235] [2025-03-04 03:55:04,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686905235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:55:04,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:55:04,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:55:04,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908033593] [2025-03-04 03:55:04,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:55:04,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:55:04,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:55:04,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:55:04,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:55:04,339 INFO L87 Difference]: Start difference. First operand 1430 states and 2079 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) 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) [2025-03-04 03:55:08,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:55:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:55:08,891 INFO L93 Difference]: Finished difference Result 1432 states and 2080 transitions. [2025-03-04 03:55:08,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:55:08,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) 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 [2025-03-04 03:55:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:55:08,898 INFO L225 Difference]: With dead ends: 1432 [2025-03-04 03:55:08,898 INFO L226 Difference]: Without dead ends: 1429 [2025-03-04 03:55:08,899 INFO L434 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 [2025-03-04 03:55:08,901 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 1029 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-04 03:55:08,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 1048 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-04 03:55:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2025-03-04 03:55:08,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1429. [2025-03-04 03:55:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1107 states have (on average 1.4417344173441735) internal successors, (1596), 1133 states have internal predecessors, (1596), 243 states have call successors, (243), 79 states have call predecessors, (243), 78 states have return successors, (238), 230 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-04 03:55:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2077 transitions. [2025-03-04 03:55:08,951 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2077 transitions. Word has length 26 [2025-03-04 03:55:08,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:55:08,952 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 2077 transitions. [2025-03-04 03:55:08,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) 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) [2025-03-04 03:55:08,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2077 transitions. [2025-03-04 03:55:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 03:55:08,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:55:08,953 INFO L218 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] [2025-03-04 03:55:08,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:55:08,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:55:08,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:55:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1178535189, now seen corresponding path program 1 times [2025-03-04 03:55:08,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:55:08,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110342650] [2025-03-04 03:55:08,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:55:08,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:55:10,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 03:55:11,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 03:55:11,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:55:11,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:55:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:55:11,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:55:11,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110342650] [2025-03-04 03:55:11,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110342650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:55:11,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:55:11,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:55:11,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140323874] [2025-03-04 03:55:11,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:55:11,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:55:11,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:55:11,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:55:11,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:55:11,227 INFO L87 Difference]: Start difference. First operand 1429 states and 2077 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-03-04 03:55:15,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:55:15,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:55:15,764 INFO L93 Difference]: Finished difference Result 1431 states and 2078 transitions. [2025-03-04 03:55:15,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:55:15,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 27 [2025-03-04 03:55:15,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:55:15,773 INFO L225 Difference]: With dead ends: 1431 [2025-03-04 03:55:15,773 INFO L226 Difference]: Without dead ends: 1428 [2025-03-04 03:55:15,774 INFO L434 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 [2025-03-04 03:55:15,775 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 1026 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-04 03:55:15,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1046 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-04 03:55:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-03-04 03:55:15,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2025-03-04 03:55:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1107 states have (on average 1.4408310749774165) internal successors, (1595), 1132 states have internal predecessors, (1595), 242 states have call successors, (242), 79 states have call predecessors, (242), 78 states have return successors, (238), 230 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-04 03:55:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2075 transitions. [2025-03-04 03:55:15,824 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2075 transitions. Word has length 27 [2025-03-04 03:55:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:55:15,824 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 2075 transitions. [2025-03-04 03:55:15,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2025-03-04 03:55:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2075 transitions. [2025-03-04 03:55:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 03:55:15,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:55:15,826 INFO L218 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] [2025-03-04 03:55:15,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 03:55:15,826 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:55:15,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:55:15,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2121231493, now seen corresponding path program 1 times [2025-03-04 03:55:15,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:55:15,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378119373] [2025-03-04 03:55:15,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:55:15,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:55:17,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 03:55:17,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 03:55:17,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:55:17,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:55:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:55:18,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:55:18,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378119373] [2025-03-04 03:55:18,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378119373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:55:18,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:55:18,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:55:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070966001] [2025-03-04 03:55:18,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:55:18,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:55:18,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:55:18,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:55:18,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:55:18,083 INFO L87 Difference]: Start difference. First operand 1428 states and 2075 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2025-03-04 03:55:22,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:55:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:55:22,643 INFO L93 Difference]: Finished difference Result 1430 states and 2076 transitions. [2025-03-04 03:55:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:55:22,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 28 [2025-03-04 03:55:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:55:22,652 INFO L225 Difference]: With dead ends: 1430 [2025-03-04 03:55:22,652 INFO L226 Difference]: Without dead ends: 1427 [2025-03-04 03:55:22,653 INFO L434 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 [2025-03-04 03:55:22,654 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 1023 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-04 03:55:22,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1044 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-04 03:55:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2025-03-04 03:55:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2025-03-04 03:55:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1107 states have (on average 1.4399277326106594) internal successors, (1594), 1131 states have internal predecessors, (1594), 241 states have call successors, (241), 79 states have call predecessors, (241), 78 states have return successors, (238), 230 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-04 03:55:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2073 transitions. [2025-03-04 03:55:22,712 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 2073 transitions. Word has length 28 [2025-03-04 03:55:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:55:22,712 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 2073 transitions. [2025-03-04 03:55:22,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2025-03-04 03:55:22,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2073 transitions. [2025-03-04 03:55:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 03:55:22,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:55:22,714 INFO L218 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] [2025-03-04 03:55:22,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 03:55:22,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:55:22,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:55:22,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1334784554, now seen corresponding path program 1 times [2025-03-04 03:55:22,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:55:22,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791341780] [2025-03-04 03:55:22,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:55:22,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:55:24,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 03:55:24,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 03:55:24,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:55:24,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:55:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:55:24,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:55:24,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791341780] [2025-03-04 03:55:24,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791341780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:55:24,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:55:24,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:55:24,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300401546] [2025-03-04 03:55:24,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:55:24,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:55:24,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:55:24,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:55:24,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:55:24,968 INFO L87 Difference]: Start difference. First operand 1427 states and 2073 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2025-03-04 03:55:29,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:55:29,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:55:29,654 INFO L93 Difference]: Finished difference Result 3501 states and 4994 transitions. [2025-03-04 03:55:29,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:55:29,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 29 [2025-03-04 03:55:29,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:55:29,665 INFO L225 Difference]: With dead ends: 3501 [2025-03-04 03:55:29,665 INFO L226 Difference]: Without dead ends: 2069 [2025-03-04 03:55:29,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:55:29,671 INFO L435 NwaCegarLoop]: 1051 mSDtfsCounter, 989 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-04 03:55:29,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1493 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-04 03:55:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2025-03-04 03:55:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 2063. [2025-03-04 03:55:29,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2063 states, 1556 states have (on average 1.3823907455012854) internal successors, (2151), 1588 states have internal predecessors, (2151), 368 states have call successors, (368), 139 states have call predecessors, (368), 138 states have return successors, (372), 359 states have call predecessors, (372), 366 states have call successors, (372) [2025-03-04 03:55:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 2891 transitions. [2025-03-04 03:55:29,756 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 2891 transitions. Word has length 29 [2025-03-04 03:55:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:55:29,757 INFO L471 AbstractCegarLoop]: Abstraction has 2063 states and 2891 transitions. [2025-03-04 03:55:29,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2025-03-04 03:55:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2891 transitions. [2025-03-04 03:55:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-04 03:55:29,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:55:29,766 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:55:29,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 03:55:29,766 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:55:29,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:55:29,766 INFO L85 PathProgramCache]: Analyzing trace with hash 656330325, now seen corresponding path program 1 times [2025-03-04 03:55:29,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:55:29,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827748679] [2025-03-04 03:55:29,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:55:29,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:55:31,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-04 03:55:31,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-04 03:55:31,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:55:31,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:55:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-04 03:55:32,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:55:32,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827748679] [2025-03-04 03:55:32,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827748679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:55:32,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:55:32,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:55:32,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599826592] [2025-03-04 03:55:32,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:55:32,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:55:32,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:55:32,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:55:32,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:55:32,372 INFO L87 Difference]: Start difference. First operand 2063 states and 2891 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 03:55:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:55:32,793 INFO L93 Difference]: Finished difference Result 4841 states and 6870 transitions. [2025-03-04 03:55:32,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:55:32,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 220 [2025-03-04 03:55:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:55:32,806 INFO L225 Difference]: With dead ends: 4841 [2025-03-04 03:55:32,807 INFO L226 Difference]: Without dead ends: 2781 [2025-03-04 03:55:32,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:55:32,813 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 540 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:55:32,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 2055 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:55:32,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2025-03-04 03:55:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2781. [2025-03-04 03:55:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2150 states have (on average 1.4288372093023256) internal successors, (3072), 2184 states have internal predecessors, (3072), 452 states have call successors, (452), 179 states have call predecessors, (452), 178 states have return successors, (456), 443 states have call predecessors, (456), 450 states have call successors, (456) [2025-03-04 03:55:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3980 transitions. [2025-03-04 03:55:32,916 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3980 transitions. Word has length 220 [2025-03-04 03:55:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:55:32,916 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3980 transitions. [2025-03-04 03:55:32,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 03:55:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3980 transitions. [2025-03-04 03:55:32,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-04 03:55:32,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:55:32,924 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:55:32,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 03:55:32,925 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:55:32,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:55:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1887466615, now seen corresponding path program 1 times [2025-03-04 03:55:32,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:55:32,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550798764] [2025-03-04 03:55:32,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:55:32,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:55:35,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-04 03:55:35,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-04 03:55:35,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:55:35,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:55:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-04 03:55:35,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:55:35,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550798764] [2025-03-04 03:55:35,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550798764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:55:35,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:55:35,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:55:35,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747783799] [2025-03-04 03:55:35,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:55:35,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:55:35,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:55:35,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:55:35,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:55:35,622 INFO L87 Difference]: Start difference. First operand 2781 states and 3980 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 03:55:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:55:35,974 INFO L93 Difference]: Finished difference Result 5567 states and 7987 transitions. [2025-03-04 03:55:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:55:35,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 238 [2025-03-04 03:55:35,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:55:35,990 INFO L225 Difference]: With dead ends: 5567 [2025-03-04 03:55:35,990 INFO L226 Difference]: Without dead ends: 2789 [2025-03-04 03:55:35,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:55:36,001 INFO L435 NwaCegarLoop]: 1032 mSDtfsCounter, 0 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3091 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:55:36,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3091 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:55:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2025-03-04 03:55:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 2789. [2025-03-04 03:55:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2158 states have (on average 1.427247451343837) internal successors, (3080), 2192 states have internal predecessors, (3080), 452 states have call successors, (452), 179 states have call predecessors, (452), 178 states have return successors, (456), 443 states have call predecessors, (456), 450 states have call successors, (456) [2025-03-04 03:55:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3988 transitions. [2025-03-04 03:55:36,113 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3988 transitions. Word has length 238 [2025-03-04 03:55:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:55:36,113 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 3988 transitions. [2025-03-04 03:55:36,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 03:55:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3988 transitions. [2025-03-04 03:55:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-04 03:55:36,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:55:36,123 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:55:36,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 03:55:36,123 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:55:36,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:55:36,124 INFO L85 PathProgramCache]: Analyzing trace with hash -43035211, now seen corresponding path program 1 times [2025-03-04 03:55:36,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:55:36,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18398245] [2025-03-04 03:55:36,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:55:36,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:55:38,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-04 03:55:38,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-04 03:55:38,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:55:38,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:55:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-04 03:55:39,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:55:39,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18398245] [2025-03-04 03:55:39,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18398245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:55:39,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:55:39,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:55:39,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128084916] [2025-03-04 03:55:39,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:55:39,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:55:39,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:55:39,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:55:39,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:55:39,030 INFO L87 Difference]: Start difference. First operand 2789 states and 3988 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 03:55:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:55:39,539 INFO L93 Difference]: Finished difference Result 5591 states and 8015 transitions. [2025-03-04 03:55:39,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:55:39,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 238 [2025-03-04 03:55:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:55:39,553 INFO L225 Difference]: With dead ends: 5591 [2025-03-04 03:55:39,553 INFO L226 Difference]: Without dead ends: 2805 [2025-03-04 03:55:39,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:55:39,561 INFO L435 NwaCegarLoop]: 1031 mSDtfsCounter, 1 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:55:39,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3078 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:55:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2025-03-04 03:55:39,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2797. [2025-03-04 03:55:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2797 states, 2166 states have (on average 1.425669436749769) internal successors, (3088), 2200 states have internal predecessors, (3088), 452 states have call successors, (452), 179 states have call predecessors, (452), 178 states have return successors, (456), 443 states have call predecessors, (456), 450 states have call successors, (456) [2025-03-04 03:55:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 3996 transitions. [2025-03-04 03:55:39,672 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 3996 transitions. Word has length 238 [2025-03-04 03:55:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:55:39,673 INFO L471 AbstractCegarLoop]: Abstraction has 2797 states and 3996 transitions. [2025-03-04 03:55:39,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 03:55:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 3996 transitions. [2025-03-04 03:55:39,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-04 03:55:39,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:55:39,682 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:55:39,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 03:55:39,683 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:55:39,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:55:39,683 INFO L85 PathProgramCache]: Analyzing trace with hash -164743920, now seen corresponding path program 1 times [2025-03-04 03:55:39,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:55:39,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432359919] [2025-03-04 03:55:39,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:55:39,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:55:41,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-04 03:55:41,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-04 03:55:41,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:55:41,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:55:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 03:55:42,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:55:42,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432359919] [2025-03-04 03:55:42,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432359919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:55:42,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:55:42,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:55:42,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435216248] [2025-03-04 03:55:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:55:42,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:55:42,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:55:42,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:55:42,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:55:42,378 INFO L87 Difference]: Start difference. First operand 2797 states and 3996 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 03:55:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:55:42,912 INFO L93 Difference]: Finished difference Result 5611 states and 8039 transitions. [2025-03-04 03:55:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:55:42,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 248 [2025-03-04 03:55:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:55:42,926 INFO L225 Difference]: With dead ends: 5611 [2025-03-04 03:55:42,926 INFO L226 Difference]: Without dead ends: 2817 [2025-03-04 03:55:42,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:55:42,934 INFO L435 NwaCegarLoop]: 1034 mSDtfsCounter, 1 mSDsluCounter, 2052 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3086 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:55:42,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3086 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:55:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2025-03-04 03:55:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2805. [2025-03-04 03:55:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2805 states, 2174 states have (on average 1.424103035878565) internal successors, (3096), 2208 states have internal predecessors, (3096), 452 states have call successors, (452), 179 states have call predecessors, (452), 178 states have return successors, (456), 443 states have call predecessors, (456), 450 states have call successors, (456) [2025-03-04 03:55:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 4004 transitions. [2025-03-04 03:55:43,032 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 4004 transitions. Word has length 248 [2025-03-04 03:55:43,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:55:43,033 INFO L471 AbstractCegarLoop]: Abstraction has 2805 states and 4004 transitions. [2025-03-04 03:55:43,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 03:55:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 4004 transitions. [2025-03-04 03:55:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-04 03:55:43,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:55:43,082 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:55:43,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 03:55:43,082 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:55:43,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:55:43,083 INFO L85 PathProgramCache]: Analyzing trace with hash -896974604, now seen corresponding path program 1 times [2025-03-04 03:55:43,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:55:43,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719937499] [2025-03-04 03:55:43,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:55:43,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:55:45,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-04 03:55:45,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-04 03:55:45,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:55:45,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:55:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-04 03:55:46,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:55:46,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719937499] [2025-03-04 03:55:46,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719937499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:55:46,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:55:46,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:55:46,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365234439] [2025-03-04 03:55:46,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:55:46,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:55:46,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:55:46,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:55:46,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:55:46,187 INFO L87 Difference]: Start difference. First operand 2805 states and 4004 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 03:55:46,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:55:46,632 INFO L93 Difference]: Finished difference Result 5735 states and 8219 transitions. [2025-03-04 03:55:46,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:55:46,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 266 [2025-03-04 03:55:46,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:55:46,654 INFO L225 Difference]: With dead ends: 5735 [2025-03-04 03:55:46,654 INFO L226 Difference]: Without dead ends: 2933 [2025-03-04 03:55:46,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:55:46,665 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 27 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:55:46,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2049 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:55:46,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2025-03-04 03:55:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2813. [2025-03-04 03:55:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2182 states have (on average 1.4225481209899176) internal successors, (3104), 2216 states have internal predecessors, (3104), 452 states have call successors, (452), 179 states have call predecessors, (452), 178 states have return successors, (456), 443 states have call predecessors, (456), 450 states have call successors, (456) [2025-03-04 03:55:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 4012 transitions. [2025-03-04 03:55:46,771 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 4012 transitions. Word has length 266 [2025-03-04 03:55:46,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:55:46,772 INFO L471 AbstractCegarLoop]: Abstraction has 2813 states and 4012 transitions. [2025-03-04 03:55:46,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 03:55:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 4012 transitions. [2025-03-04 03:55:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-04 03:55:46,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:55:46,781 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:55:46,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 03:55:46,781 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:55:46,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:55:46,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1536513994, now seen corresponding path program 1 times [2025-03-04 03:55:46,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:55:46,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865263735] [2025-03-04 03:55:46,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:55:46,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:55:49,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-04 03:55:49,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 03:55:49,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:55:49,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:55:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-04 03:55:49,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:55:49,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865263735] [2025-03-04 03:55:49,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865263735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:55:49,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614729048] [2025-03-04 03:55:49,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:55:49,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:55:49,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:55:49,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:55:49,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 03:55:53,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-04 03:55:53,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 03:55:53,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:55:53,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:55:53,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 6010 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:55:53,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:55:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-04 03:55:54,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:55:54,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614729048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:55:54,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:55:54,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:55:54,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000212191] [2025-03-04 03:55:54,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:55:54,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:55:54,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:55:54,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:55:54,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:55:54,082 INFO L87 Difference]: Start difference. First operand 2813 states and 4012 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24)