./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.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 3aefe7c24f7dbfd113682bd81b91ef3b049ad438c933de49acd0f78d1e093848 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 08:15:12,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 08:15:12,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 08:15:12,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 08:15:12,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 08:15:12,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 08:15:12,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 08:15:12,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 08:15:12,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 08:15:12,226 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 08:15:12,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 08:15:12,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 08:15:12,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 08:15:12,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 08:15:12,227 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 08:15:12,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 08:15:12,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 08:15:12,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 08:15:12,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 08:15:12,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 08:15:12,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 08:15:12,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 08:15:12,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 08:15:12,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 08:15:12,228 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 08:15:12,228 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 08:15:12,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 08:15:12,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 08:15:12,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 08:15:12,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 08:15:12,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 08:15:12,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 08:15:12,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 08:15:12,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 08:15:12,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 08:15:12,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 08:15:12,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 08:15:12,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 08:15:12,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 08:15:12,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 08:15:12,228 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 -> 3aefe7c24f7dbfd113682bd81b91ef3b049ad438c933de49acd0f78d1e093848 [2025-03-17 08:15:12,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 08:15:12,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 08:15:12,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 08:15:12,459 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 08:15:12,460 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 08:15:12,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2025-03-17 08:15:13,589 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e914ac819/842adb3ce7f748c5bdd771d5b391d6a2/FLAG64309b1c5 [2025-03-17 08:15:14,057 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 08:15:14,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2025-03-17 08:15:14,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e914ac819/842adb3ce7f748c5bdd771d5b391d6a2/FLAG64309b1c5 [2025-03-17 08:15:14,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e914ac819/842adb3ce7f748c5bdd771d5b391d6a2 [2025-03-17 08:15:14,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 08:15:14,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 08:15:14,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 08:15:14,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 08:15:14,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 08:15:14,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:15:14" (1/1) ... [2025-03-17 08:15:14,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a395567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:14, skipping insertion in model container [2025-03-17 08:15:14,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:15:14" (1/1) ... [2025-03-17 08:15:14,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 08:15:14,749 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/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i[133672,133685] [2025-03-17 08:15:14,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 08:15:14,792 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 08:15:14,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [3073] [2025-03-17 08:15:14,845 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)); [3087-3088] [2025-03-17 08:15:14,873 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [3102] [2025-03-17 08:15:14,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3105] [2025-03-17 08:15:14,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3108] [2025-03-17 08:15:14,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3111] [2025-03-17 08:15:14,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& kernel_stack)); [3173] [2025-03-17 08:15:14,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3176] [2025-03-17 08:15:14,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3179] [2025-03-17 08:15:14,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3182] [2025-03-17 08:15:14,965 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/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i[133672,133685] [2025-03-17 08:15:14,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 08:15:15,018 INFO L204 MainTranslator]: Completed translation [2025-03-17 08:15:15,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:15 WrapperNode [2025-03-17 08:15:15,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 08:15:15,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 08:15:15,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 08:15:15,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 08:15:15,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:15" (1/1) ... [2025-03-17 08:15:15,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:15" (1/1) ... [2025-03-17 08:15:15,198 INFO L138 Inliner]: procedures = 191, calls = 833, calls flagged for inlining = 89, calls inlined = 75, statements flattened = 2334 [2025-03-17 08:15:15,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 08:15:15,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 08:15:15,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 08:15:15,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 08:15:15,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:15" (1/1) ... [2025-03-17 08:15:15,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:15" (1/1) ... [2025-03-17 08:15:15,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:15" (1/1) ... [2025-03-17 08:15:15,342 INFO L175 MemorySlicer]: Split 435 memory accesses to 14 slices as follows [2, 1, 7, 5, 7, 35, 7, 8, 9, 2, 3, 113, 234, 2]. 54 percent of accesses are in the largest equivalence class. The 39 initializations are split as follows [2, 0, 7, 0, 7, 7, 7, 0, 9, 0, 0, 0, 0, 0]. The 171 writes are split as follows [0, 0, 0, 5, 0, 28, 0, 1, 0, 0, 0, 103, 34, 0]. [2025-03-17 08:15:15,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:15" (1/1) ... [2025-03-17 08:15:15,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:15" (1/1) ... [2025-03-17 08:15:15,408 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:15" (1/1) ... [2025-03-17 08:15:15,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:15" (1/1) ... [2025-03-17 08:15:15,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:15" (1/1) ... [2025-03-17 08:15:15,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:15" (1/1) ... [2025-03-17 08:15:15,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 08:15:15,473 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 08:15:15,473 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 08:15:15,473 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 08:15:15,474 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:15" (1/1) ... [2025-03-17 08:15:15,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 08:15:15,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:15:15,499 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-17 08:15:15,504 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-17 08:15:15,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 08:15:15,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 08:15:15,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 08:15:15,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 08:15:15,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 08:15:15,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 08:15:15,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 08:15:15,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-17 08:15:15,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-17 08:15:15,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-17 08:15:15,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-17 08:15:15,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-17 08:15:15,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-17 08:15:15,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-17 08:15:15,522 INFO L130 BoogieDeclarations]: Found specification of procedure input_event_size [2025-03-17 08:15:15,522 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event_size [2025-03-17 08:15:15,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-17 08:15:15,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-17 08:15:15,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-17 08:15:15,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-17 08:15:15,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 08:15:15,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2025-03-17 08:15:15,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-03-17 08:15:15,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-03-17 08:15:15,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-17 08:15:15,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-17 08:15:15,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-17 08:15:15,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-17 08:15:15,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-17 08:15:15,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-17 08:15:15,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-17 08:15:15,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-17 08:15:15,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-17 08:15:15,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-17 08:15:15,524 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-17 08:15:15,526 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-03-17 08:15:15,527 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-03-17 08:15:15,527 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-03-17 08:15:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2025-03-17 08:15:15,527 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2025-03-17 08:15:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-03-17 08:15:15,527 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-03-17 08:15:15,527 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_request_done [2025-03-17 08:15:15,528 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_request_done [2025-03-17 08:15:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 08:15:15,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 08:15:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-17 08:15:15,528 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-17 08:15:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 08:15:15,528 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 08:15:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_flat [2025-03-17 08:15:15,528 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_flat [2025-03-17 08:15:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 08:15:15,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-17 08:15:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-03-17 08:15:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-17 08:15:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure input_alloc_absinfo [2025-03-17 08:15:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure input_alloc_absinfo [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2025-03-17 08:15:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-17 08:15:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_request_find [2025-03-17 08:15:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_request_find [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_uinput_device [2025-03-17 08:15:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_uinput_device [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_allocate_device [2025-03-17 08:15:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_allocate_device [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-03-17 08:15:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_ioctl_handler [2025-03-17 08:15:15,529 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_ioctl_handler [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 08:15:15,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2025-03-17 08:15:15,530 INFO L138 BoogieDeclarations]: Found implementation of procedure __bad_percpu_size [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_ff_upload_from_user [2025-03-17 08:15:15,530 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_ff_upload_from_user [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_destroy_device [2025-03-17 08:15:15,530 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_destroy_device [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-17 08:15:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-17 08:15:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-17 08:15:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_max [2025-03-17 08:15:15,531 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_max [2025-03-17 08:15:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-03-17 08:15:15,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-03-17 08:15:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-03-17 08:15:15,531 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-03-17 08:15:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2025-03-17 08:15:15,531 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2025-03-17 08:15:15,531 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-03-17 08:15:15,532 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-03-17 08:15:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_min [2025-03-17 08:15:15,532 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_min [2025-03-17 08:15:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 08:15:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 08:15:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 08:15:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 08:15:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 08:15:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-17 08:15:15,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure is_compat_task [2025-03-17 08:15:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure is_compat_task [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-03-17 08:15:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait [2025-03-17 08:15:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-17 08:15:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-17 08:15:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-17 08:15:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2025-03-17 08:15:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-17 08:15:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-17 08:15:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-17 08:15:15,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2025-03-17 08:15:15,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2025-03-17 08:15:15,534 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-17 08:15:15,534 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-03-17 08:15:15,534 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 08:15:15,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 08:15:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-17 08:15:15,534 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-17 08:15:15,957 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 08:15:15,959 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 08:15:16,298 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3359: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-17 08:15:25,061 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4265: call ULTIMATE.dealloc(uinput_ff_upload_to_user_~#ff_up_compat~0#1.base, uinput_ff_upload_to_user_~#ff_up_compat~0#1.offset);havoc uinput_ff_upload_to_user_~#ff_up_compat~0#1.base, uinput_ff_upload_to_user_~#ff_up_compat~0#1.offset; [2025-03-17 08:15:25,062 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5407: havoc strndup_user_#t~ret537#1.base, strndup_user_#t~ret537#1.offset; [2025-03-17 08:15:25,062 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4899-1: ldv_mutex_lock_interruptible_12_#res#1 := ldv_mutex_lock_interruptible_12_~ldv_func_res~4#1; [2025-03-17 08:15:25,062 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5350: havoc input_register_device_#t~nondet528#1; [2025-03-17 08:15:25,062 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4360: call ULTIMATE.dealloc(~#ff_up~0#1.base, ~#ff_up~0#1.offset);havoc ~#ff_up~0#1.base, ~#ff_up~0#1.offset;call ULTIMATE.dealloc(~#ff_erase~0#1.base, ~#ff_erase~0#1.offset);havoc ~#ff_erase~0#1.base, ~#ff_erase~0#1.offset; [2025-03-17 08:15:25,062 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5336: havoc input_ff_create_#t~nondet526#1; [2025-03-17 08:15:25,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5383: havoc #t~nondet533; [2025-03-17 08:15:25,266 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3426: havoc #t~mem114.base, #t~mem114.offset;havoc #t~ite117;havoc #t~mem115.base, #t~mem115.offset;havoc #t~mem116; [2025-03-17 08:15:25,329 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5401: havoc #t~nondet536; [2025-03-17 08:15:25,345 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3369: havoc __kmalloc_#t~ret94#1.base, __kmalloc_#t~ret94#1.offset; [2025-03-17 08:15:25,366 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5286: havoc #t~nondet520; [2025-03-17 08:15:25,399 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080: havoc #t~mem1;havoc #t~bitwise2; [2025-03-17 08:15:25,415 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3474: havoc #t~mem128.base, #t~mem128.offset;havoc #t~ite131;havoc #t~mem129.base, #t~mem129.offset;havoc #t~mem130; [2025-03-17 08:15:25,425 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5290: havoc _copy_to_user_#t~nondet521#1; [2025-03-17 08:15:25,438 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3604: havoc #t~mem162.base, #t~mem162.offset; [2025-03-17 08:15:25,463 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5312: havoc dev_set_drvdata_#t~nondet523#1; [2025-03-17 08:15:25,463 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3394: havoc input_allocate_device_#t~ret103#1.base, input_allocate_device_#t~ret103#1.offset; [2025-03-17 08:15:25,517 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4311: call ULTIMATE.dealloc(~#ff_up_compat~1.base, ~#ff_up_compat~1.offset);havoc ~#ff_up_compat~1.base, ~#ff_up_compat~1.offset; [2025-03-17 08:15:25,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3444: havoc #t~mem120.base, #t~mem120.offset;havoc #t~ite123;havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122; [2025-03-17 08:15:26,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4165: call ULTIMATE.dealloc(uinput_read_~#__wait~1#1.base, uinput_read_~#__wait~1#1.offset);havoc uinput_read_~#__wait~1#1.base, uinput_read_~#__wait~1#1.offset; [2025-03-17 08:15:26,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5372: havoc misc_deregister_#t~nondet531#1; [2025-03-17 08:15:26,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5356: havoc kstrndup_#t~ret529#1.base, kstrndup_#t~ret529#1.offset; [2025-03-17 08:15:26,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4878-1: ldv_mutex_lock_interruptible_10_#res#1 := ldv_mutex_lock_interruptible_10_~ldv_func_res~3#1; [2025-03-17 08:15:26,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5376: havoc misc_register_#t~nondet532#1; [2025-03-17 08:15:26,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5394: havoc nonseekable_open_#t~nondet535#1; [2025-03-17 08:15:26,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5328: havoc input_event_from_user_#t~nondet524#1; [2025-03-17 08:15:26,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5346: havoc input_mt_init_slots_#t~nondet527#1; [2025-03-17 08:15:26,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4126: call ULTIMATE.dealloc(uinput_events_to_user_~#event~0#1.base, uinput_events_to_user_~#event~0#1.offset);havoc uinput_events_to_user_~#event~0#1.base, uinput_events_to_user_~#event~0#1.offset; [2025-03-17 08:15:26,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4060: call ULTIMATE.dealloc(uinput_inject_event_~#ev~0#1.base, uinput_inject_event_~#ev~0#1.offset);havoc uinput_inject_event_~#ev~0#1.base, uinput_inject_event_~#ev~0#1.offset; [2025-03-17 08:15:26,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5365: havoc memdup_user_#t~ret530#1.base, memdup_user_#t~ret530#1.offset; [2025-03-17 08:15:26,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5332: havoc input_event_to_user_#t~nondet525#1; [2025-03-17 08:15:26,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3864: call ULTIMATE.dealloc(uinput_open_~#__key~1#1.base, uinput_open_~#__key~1#1.offset);havoc uinput_open_~#__key~1#1.base, uinput_open_~#__key~1#1.offset;call ULTIMATE.dealloc(uinput_open_~#__key___0~0#1.base, uinput_open_~#__key___0~0#1.offset);havoc uinput_open_~#__key___0~0#1.base, uinput_open_~#__key___0~0#1.offset;call ULTIMATE.dealloc(uinput_open_~#__key___1~0#1.base, uinput_open_~#__key___1~0#1.offset);havoc uinput_open_~#__key___1~0#1.base, uinput_open_~#__key___1~0#1.offset;call ULTIMATE.dealloc(uinput_open_~#__key___2~0#1.base, uinput_open_~#__key___2~0#1.offset);havoc uinput_open_~#__key___2~0#1.base, uinput_open_~#__key___2~0#1.offset; [2025-03-17 08:15:26,566 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4857-1: ldv_mutex_lock_interruptible_8_#res#1 := ldv_mutex_lock_interruptible_8_~ldv_func_res~2#1; [2025-03-17 08:15:26,825 INFO L? ?]: Removed 1058 outVars from TransFormulas that were not future-live. [2025-03-17 08:15:26,825 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 08:15:26,865 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 08:15:26,867 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 08:15:26,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:15:26 BoogieIcfgContainer [2025-03-17 08:15:26,867 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 08:15:26,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 08:15:26,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 08:15:26,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 08:15:26,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 08:15:14" (1/3) ... [2025-03-17 08:15:26,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1800fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:15:26, skipping insertion in model container [2025-03-17 08:15:26,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:15" (2/3) ... [2025-03-17 08:15:26,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1800fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:15:26, skipping insertion in model container [2025-03-17 08:15:26,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:15:26" (3/3) ... [2025-03-17 08:15:26,876 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2025-03-17 08:15:26,887 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 08:15:26,888 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i that has 58 procedures, 744 locations, 1 initial locations, 29 loop locations, and 1 error locations. [2025-03-17 08:15:26,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 08:15:26,951 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;@2cd998d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 08:15:26,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 08:15:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 679 states, 491 states have (on average 1.384928716904277) internal successors, (680), 505 states have internal predecessors, (680), 142 states have call successors, (142), 44 states have call predecessors, (142), 44 states have return successors, (142), 140 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-17 08:15:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 08:15:26,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:26,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:15:26,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:26,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:26,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1725329307, now seen corresponding path program 1 times [2025-03-17 08:15:26,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:26,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749547802] [2025-03-17 08:15:26,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:26,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:27,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 08:15:27,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 08:15:27,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:27,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:27,391 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-17 08:15:27,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:27,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749547802] [2025-03-17 08:15:27,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749547802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:27,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:27,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:15:27,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455555066] [2025-03-17 08:15:27,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:27,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:15:27,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:27,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:15:27,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:15:27,411 INFO L87 Difference]: Start difference. First operand has 679 states, 491 states have (on average 1.384928716904277) internal successors, (680), 505 states have internal predecessors, (680), 142 states have call successors, (142), 44 states have call predecessors, (142), 44 states have return successors, (142), 140 states have call predecessors, (142), 142 states have call successors, (142) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 08:15:27,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:27,548 INFO L93 Difference]: Finished difference Result 1350 states and 1934 transitions. [2025-03-17 08:15:27,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:15:27,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-17 08:15:27,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:27,566 INFO L225 Difference]: With dead ends: 1350 [2025-03-17 08:15:27,567 INFO L226 Difference]: Without dead ends: 673 [2025-03-17 08:15:27,576 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-17 08:15:27,578 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 947 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:27,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 945 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:15:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-17 08:15:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2025-03-17 08:15:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 488 states have (on average 1.3770491803278688) internal successors, (672), 499 states have internal predecessors, (672), 141 states have call successors, (141), 44 states have call predecessors, (141), 43 states have return successors, (137), 135 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-17 08:15:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 950 transitions. [2025-03-17 08:15:27,682 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 950 transitions. Word has length 11 [2025-03-17 08:15:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:27,684 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 950 transitions. [2025-03-17 08:15:27,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 08:15:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 950 transitions. [2025-03-17 08:15:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 08:15:27,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:27,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:15:27,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 08:15:27,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:27,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:27,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1945049277, now seen corresponding path program 1 times [2025-03-17 08:15:27,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:27,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71719464] [2025-03-17 08:15:27,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:27,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:27,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 08:15:27,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 08:15:27,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:27,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:27,941 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-17 08:15:27,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:27,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71719464] [2025-03-17 08:15:27,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71719464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:27,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:27,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:15:27,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352743822] [2025-03-17 08:15:27,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:27,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:15:27,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:27,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:15:27,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:15:27,945 INFO L87 Difference]: Start difference. First operand 673 states and 950 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 08:15:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:28,013 INFO L93 Difference]: Finished difference Result 675 states and 951 transitions. [2025-03-17 08:15:28,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:15:28,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-17 08:15:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:28,023 INFO L225 Difference]: With dead ends: 675 [2025-03-17 08:15:28,024 INFO L226 Difference]: Without dead ends: 672 [2025-03-17 08:15:28,024 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-17 08:15:28,025 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 941 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:28,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 940 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:15:28,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-17 08:15:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2025-03-17 08:15:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 488 states have (on average 1.375) internal successors, (671), 498 states have internal predecessors, (671), 140 states have call successors, (140), 44 states have call predecessors, (140), 43 states have return successors, (137), 135 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-17 08:15:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 948 transitions. [2025-03-17 08:15:28,079 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 948 transitions. Word has length 12 [2025-03-17 08:15:28,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:28,079 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 948 transitions. [2025-03-17 08:15:28,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 08:15:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 948 transitions. [2025-03-17 08:15:28,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 08:15:28,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:28,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:15:28,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 08:15:28,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:28,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash 166432732, now seen corresponding path program 1 times [2025-03-17 08:15:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:28,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166502058] [2025-03-17 08:15:28,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:28,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:28,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 08:15:28,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 08:15:28,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:28,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:28,294 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-17 08:15:28,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:28,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166502058] [2025-03-17 08:15:28,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166502058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:28,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:28,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:15:28,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203672505] [2025-03-17 08:15:28,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:28,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:15:28,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:28,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:15:28,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:15:28,296 INFO L87 Difference]: Start difference. First operand 672 states and 948 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 08:15:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:28,449 INFO L93 Difference]: Finished difference Result 1952 states and 2774 transitions. [2025-03-17 08:15:28,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:15:28,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-17 08:15:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:28,461 INFO L225 Difference]: With dead ends: 1952 [2025-03-17 08:15:28,461 INFO L226 Difference]: Without dead ends: 1278 [2025-03-17 08:15:28,464 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-17 08:15:28,464 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 934 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:28,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 2416 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:15:28,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-03-17 08:15:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1275. [2025-03-17 08:15:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 930 states have (on average 1.3731182795698924) internal successors, (1277), 948 states have internal predecessors, (1277), 264 states have call successors, (264), 82 states have call predecessors, (264), 80 states have return successors, (268), 254 states have call predecessors, (268), 258 states have call successors, (268) [2025-03-17 08:15:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1809 transitions. [2025-03-17 08:15:28,547 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1809 transitions. Word has length 13 [2025-03-17 08:15:28,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:28,547 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1809 transitions. [2025-03-17 08:15:28,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 08:15:28,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1809 transitions. [2025-03-17 08:15:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 08:15:28,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:28,553 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:15:28,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 08:15:28,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:28,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:28,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1313534800, now seen corresponding path program 1 times [2025-03-17 08:15:28,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:28,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466340505] [2025-03-17 08:15:28,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:28,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:28,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 08:15:28,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 08:15:28,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:28,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 08:15:28,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:28,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466340505] [2025-03-17 08:15:28,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466340505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:28,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:28,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:15:28,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209264497] [2025-03-17 08:15:28,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:28,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:15:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:28,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:15:28,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:15:28,952 INFO L87 Difference]: Start difference. First operand 1275 states and 1809 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 08:15:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:30,148 INFO L93 Difference]: Finished difference Result 2699 states and 3861 transitions. [2025-03-17 08:15:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 08:15:30,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2025-03-17 08:15:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:30,160 INFO L225 Difference]: With dead ends: 2699 [2025-03-17 08:15:30,160 INFO L226 Difference]: Without dead ends: 1429 [2025-03-17 08:15:30,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 08:15:30,167 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 240 mSDsluCounter, 2537 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:30,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 3466 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 08:15:30,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2025-03-17 08:15:30,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1395. [2025-03-17 08:15:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1030 states have (on average 1.387378640776699) internal successors, (1429), 1048 states have internal predecessors, (1429), 284 states have call successors, (284), 82 states have call predecessors, (284), 80 states have return successors, (296), 274 states have call predecessors, (296), 278 states have call successors, (296) [2025-03-17 08:15:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 2009 transitions. [2025-03-17 08:15:30,249 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 2009 transitions. Word has length 41 [2025-03-17 08:15:30,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:30,249 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 2009 transitions. [2025-03-17 08:15:30,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 08:15:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 2009 transitions. [2025-03-17 08:15:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 08:15:30,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:30,251 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:15:30,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 08:15:30,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:30,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:30,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2109641093, now seen corresponding path program 1 times [2025-03-17 08:15:30,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:30,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925677242] [2025-03-17 08:15:30,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:30,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:30,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 08:15:30,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 08:15:30,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:30,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 08:15:30,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:30,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925677242] [2025-03-17 08:15:30,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925677242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:30,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:30,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:15:30,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882241395] [2025-03-17 08:15:30,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:30,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:15:30,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:30,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:15:30,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:15:30,498 INFO L87 Difference]: Start difference. First operand 1395 states and 2009 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 08:15:31,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:31,256 INFO L93 Difference]: Finished difference Result 2787 states and 4013 transitions. [2025-03-17 08:15:31,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:15:31,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2025-03-17 08:15:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:31,265 INFO L225 Difference]: With dead ends: 2787 [2025-03-17 08:15:31,265 INFO L226 Difference]: Without dead ends: 1397 [2025-03-17 08:15:31,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-17 08:15:31,276 INFO L435 NwaCegarLoop]: 1115 mSDtfsCounter, 852 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:31,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 2034 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 08:15:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2025-03-17 08:15:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1383. [2025-03-17 08:15:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1026 states have (on average 1.3869395711500974) internal successors, (1423), 1040 states have internal predecessors, (1423), 276 states have call successors, (276), 82 states have call predecessors, (276), 80 states have return successors, (274), 270 states have call predecessors, (274), 265 states have call successors, (274) [2025-03-17 08:15:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1973 transitions. [2025-03-17 08:15:31,345 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1973 transitions. Word has length 50 [2025-03-17 08:15:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:31,346 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 1973 transitions. [2025-03-17 08:15:31,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 08:15:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1973 transitions. [2025-03-17 08:15:31,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 08:15:31,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:31,348 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:15:31,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 08:15:31,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:31,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:31,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1265169222, now seen corresponding path program 1 times [2025-03-17 08:15:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:31,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015396750] [2025-03-17 08:15:31,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:31,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 08:15:31,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 08:15:31,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:31,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 08:15:31,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:31,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015396750] [2025-03-17 08:15:31,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015396750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:31,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:31,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:15:31,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905703603] [2025-03-17 08:15:31,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:31,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:15:31,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:31,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:15:31,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:15:31,651 INFO L87 Difference]: Start difference. First operand 1383 states and 1973 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 08:15:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:31,814 INFO L93 Difference]: Finished difference Result 1504 states and 2116 transitions. [2025-03-17 08:15:31,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:15:31,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2025-03-17 08:15:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:31,820 INFO L225 Difference]: With dead ends: 1504 [2025-03-17 08:15:31,821 INFO L226 Difference]: Without dead ends: 1158 [2025-03-17 08:15:31,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:15:31,823 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 2 mSDsluCounter, 3747 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4696 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:31,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4696 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:15:31,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-03-17 08:15:31,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1153. [2025-03-17 08:15:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 856 states have (on average 1.3703271028037383) internal successors, (1173), 866 states have internal predecessors, (1173), 224 states have call successors, (224), 74 states have call predecessors, (224), 72 states have return successors, (223), 221 states have call predecessors, (223), 214 states have call successors, (223) [2025-03-17 08:15:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1620 transitions. [2025-03-17 08:15:31,868 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1620 transitions. Word has length 50 [2025-03-17 08:15:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:31,869 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1620 transitions. [2025-03-17 08:15:31,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 08:15:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1620 transitions. [2025-03-17 08:15:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 08:15:31,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:31,873 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 08:15:31,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 08:15:31,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:31,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:31,873 INFO L85 PathProgramCache]: Analyzing trace with hash 760492432, now seen corresponding path program 1 times [2025-03-17 08:15:31,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:31,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304548986] [2025-03-17 08:15:31,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:31,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:31,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 08:15:31,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 08:15:31,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:31,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 08:15:32,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:32,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304548986] [2025-03-17 08:15:32,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304548986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:32,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:32,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:15:32,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986744157] [2025-03-17 08:15:32,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:32,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:15:32,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:32,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:15:32,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:15:32,133 INFO L87 Difference]: Start difference. First operand 1153 states and 1620 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 08:15:32,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:32,322 INFO L93 Difference]: Finished difference Result 1399 states and 1963 transitions. [2025-03-17 08:15:32,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:15:32,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2025-03-17 08:15:32,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:32,333 INFO L225 Difference]: With dead ends: 1399 [2025-03-17 08:15:32,333 INFO L226 Difference]: Without dead ends: 1150 [2025-03-17 08:15:32,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:15:32,335 INFO L435 NwaCegarLoop]: 943 mSDtfsCounter, 133 mSDsluCounter, 3572 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 4515 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:32,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 4515 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:15:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2025-03-17 08:15:32,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1145. [2025-03-17 08:15:32,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 849 states have (on average 1.3722025912838633) internal successors, (1165), 864 states have internal predecessors, (1165), 224 states have call successors, (224), 74 states have call predecessors, (224), 71 states have return successors, (217), 215 states have call predecessors, (217), 214 states have call successors, (217) [2025-03-17 08:15:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1606 transitions. [2025-03-17 08:15:32,374 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1606 transitions. Word has length 54 [2025-03-17 08:15:32,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:32,374 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1606 transitions. [2025-03-17 08:15:32,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 08:15:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1606 transitions. [2025-03-17 08:15:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 08:15:32,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:32,377 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 08:15:32,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 08:15:32,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:32,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:32,378 INFO L85 PathProgramCache]: Analyzing trace with hash -266079765, now seen corresponding path program 1 times [2025-03-17 08:15:32,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:32,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528217584] [2025-03-17 08:15:32,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:32,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:32,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 08:15:32,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 08:15:32,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:32,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 08:15:32,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:32,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528217584] [2025-03-17 08:15:32,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528217584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:32,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:32,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:15:32,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244755936] [2025-03-17 08:15:32,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:32,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:15:32,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:32,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:15:32,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:15:32,563 INFO L87 Difference]: Start difference. First operand 1145 states and 1606 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 08:15:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:33,478 INFO L93 Difference]: Finished difference Result 2291 states and 3215 transitions. [2025-03-17 08:15:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:15:33,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71 [2025-03-17 08:15:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:33,485 INFO L225 Difference]: With dead ends: 2291 [2025-03-17 08:15:33,485 INFO L226 Difference]: Without dead ends: 1148 [2025-03-17 08:15:33,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:15:33,489 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 0 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:33,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2809 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 08:15:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-03-17 08:15:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1148. [2025-03-17 08:15:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 851 states have (on average 1.3701527614571092) internal successors, (1166), 866 states have internal predecessors, (1166), 225 states have call successors, (225), 74 states have call predecessors, (225), 71 states have return successors, (218), 216 states have call predecessors, (218), 215 states have call successors, (218) [2025-03-17 08:15:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1609 transitions. [2025-03-17 08:15:33,528 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1609 transitions. Word has length 71 [2025-03-17 08:15:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:33,529 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1609 transitions. [2025-03-17 08:15:33,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 08:15:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1609 transitions. [2025-03-17 08:15:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 08:15:33,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:33,532 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 08:15:33,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 08:15:33,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:33,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1470289834, now seen corresponding path program 1 times [2025-03-17 08:15:33,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:33,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242809674] [2025-03-17 08:15:33,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:33,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:33,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 08:15:33,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 08:15:33,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:33,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 08:15:33,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:33,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242809674] [2025-03-17 08:15:33,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242809674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:33,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:33,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:15:33,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205253902] [2025-03-17 08:15:33,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:33,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:15:33,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:33,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:15:33,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:15:33,836 INFO L87 Difference]: Start difference. First operand 1148 states and 1609 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 08:15:33,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:33,958 INFO L93 Difference]: Finished difference Result 2275 states and 3188 transitions. [2025-03-17 08:15:33,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:15:33,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2025-03-17 08:15:33,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:33,966 INFO L225 Difference]: With dead ends: 2275 [2025-03-17 08:15:33,966 INFO L226 Difference]: Without dead ends: 1132 [2025-03-17 08:15:33,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:15:33,971 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 3 mSDsluCounter, 3746 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4688 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:33,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4688 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:15:33,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-03-17 08:15:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1131. [2025-03-17 08:15:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 835 states have (on average 1.3652694610778444) internal successors, (1140), 849 states have internal predecessors, (1140), 224 states have call successors, (224), 74 states have call predecessors, (224), 71 states have return successors, (218), 216 states have call predecessors, (218), 215 states have call successors, (218) [2025-03-17 08:15:34,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1582 transitions. [2025-03-17 08:15:34,012 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1582 transitions. Word has length 81 [2025-03-17 08:15:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:34,012 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1582 transitions. [2025-03-17 08:15:34,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 08:15:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1582 transitions. [2025-03-17 08:15:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 08:15:34,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:34,015 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-17 08:15:34,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 08:15:34,016 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:34,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:34,016 INFO L85 PathProgramCache]: Analyzing trace with hash 859598414, now seen corresponding path program 1 times [2025-03-17 08:15:34,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:34,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427670011] [2025-03-17 08:15:34,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:34,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:34,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 08:15:34,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 08:15:34,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:34,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 08:15:34,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:34,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427670011] [2025-03-17 08:15:34,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427670011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:15:34,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34347806] [2025-03-17 08:15:34,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:34,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:15:34,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:15:34,236 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-17 08:15:34,238 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-17 08:15:34,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 08:15:34,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 08:15:34,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:34,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:34,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 08:15:34,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:15:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 08:15:34,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 08:15:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 08:15:35,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34347806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 08:15:35,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 08:15:35,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-17 08:15:35,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962079145] [2025-03-17 08:15:35,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 08:15:35,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 08:15:35,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:35,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 08:15:35,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:15:35,040 INFO L87 Difference]: Start difference. First operand 1131 states and 1582 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 08:15:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:35,232 INFO L93 Difference]: Finished difference Result 2395 states and 3376 transitions. [2025-03-17 08:15:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 08:15:35,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 83 [2025-03-17 08:15:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:35,241 INFO L225 Difference]: With dead ends: 2395 [2025-03-17 08:15:35,242 INFO L226 Difference]: Without dead ends: 1269 [2025-03-17 08:15:35,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:15:35,246 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 188 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2781 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:35,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2781 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:15:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2025-03-17 08:15:35,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1235. [2025-03-17 08:15:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 927 states have (on average 1.3851132686084142) internal successors, (1284), 941 states have internal predecessors, (1284), 236 states have call successors, (236), 74 states have call predecessors, (236), 71 states have return successors, (230), 228 states have call predecessors, (230), 227 states have call successors, (230) [2025-03-17 08:15:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1750 transitions. [2025-03-17 08:15:35,293 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1750 transitions. Word has length 83 [2025-03-17 08:15:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:35,293 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1750 transitions. [2025-03-17 08:15:35,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 08:15:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1750 transitions. [2025-03-17 08:15:35,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 08:15:35,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:35,299 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2025-03-17 08:15:35,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 08:15:35,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 08:15:35,503 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:35,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash 980089546, now seen corresponding path program 1 times [2025-03-17 08:15:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:35,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909742980] [2025-03-17 08:15:35,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:35,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:35,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 08:15:35,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 08:15:35,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:35,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 08:15:35,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:35,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909742980] [2025-03-17 08:15:35,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909742980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:35,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:35,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:15:35,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211651093] [2025-03-17 08:15:35,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:35,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:15:35,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:35,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:15:35,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:15:35,787 INFO L87 Difference]: Start difference. First operand 1235 states and 1750 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 08:15:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:35,904 INFO L93 Difference]: Finished difference Result 2466 states and 3496 transitions. [2025-03-17 08:15:35,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:15:35,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 91 [2025-03-17 08:15:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:35,912 INFO L225 Difference]: With dead ends: 2466 [2025-03-17 08:15:35,912 INFO L226 Difference]: Without dead ends: 1236 [2025-03-17 08:15:35,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:15:35,918 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 21 mSDsluCounter, 3703 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4639 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:35,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4639 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:15:35,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2025-03-17 08:15:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1236. [2025-03-17 08:15:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 928 states have (on average 1.3836206896551724) internal successors, (1284), 942 states have internal predecessors, (1284), 236 states have call successors, (236), 74 states have call predecessors, (236), 71 states have return successors, (230), 228 states have call predecessors, (230), 227 states have call successors, (230) [2025-03-17 08:15:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1750 transitions. [2025-03-17 08:15:35,965 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1750 transitions. Word has length 91 [2025-03-17 08:15:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:35,966 INFO L471 AbstractCegarLoop]: Abstraction has 1236 states and 1750 transitions. [2025-03-17 08:15:35,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 08:15:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1750 transitions. [2025-03-17 08:15:35,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 08:15:35,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:35,971 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2025-03-17 08:15:35,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 08:15:35,971 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:35,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:35,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1165398657, now seen corresponding path program 1 times [2025-03-17 08:15:35,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:35,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602813684] [2025-03-17 08:15:35,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:35,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:36,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 08:15:36,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 08:15:36,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:36,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-17 08:15:36,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:36,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602813684] [2025-03-17 08:15:36,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602813684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:15:36,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394067008] [2025-03-17 08:15:36,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:36,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:15:36,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:15:36,336 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:15:36,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 08:15:36,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 08:15:36,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 08:15:36,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:36,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:36,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 08:15:36,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:15:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 08:15:36,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:15:36,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394067008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:36,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:15:36,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 8 [2025-03-17 08:15:36,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908320924] [2025-03-17 08:15:36,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:36,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 08:15:36,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:36,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 08:15:36,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 08:15:36,976 INFO L87 Difference]: Start difference. First operand 1236 states and 1750 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 08:15:38,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:15:38,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:38,290 INFO L93 Difference]: Finished difference Result 2471 states and 3499 transitions. [2025-03-17 08:15:38,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 08:15:38,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-03-17 08:15:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:38,299 INFO L225 Difference]: With dead ends: 2471 [2025-03-17 08:15:38,300 INFO L226 Difference]: Without dead ends: 1228 [2025-03-17 08:15:38,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 08:15:38,305 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 3 mSDsluCounter, 5610 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6549 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:38,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6549 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 08:15:38,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2025-03-17 08:15:38,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1228. [2025-03-17 08:15:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 922 states have (on average 1.3817787418655099) internal successors, (1274), 937 states have internal predecessors, (1274), 234 states have call successors, (234), 74 states have call predecessors, (234), 71 states have return successors, (227), 225 states have call predecessors, (227), 225 states have call successors, (227) [2025-03-17 08:15:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1735 transitions. [2025-03-17 08:15:38,353 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1735 transitions. Word has length 116 [2025-03-17 08:15:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:38,354 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1735 transitions. [2025-03-17 08:15:38,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 08:15:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1735 transitions. [2025-03-17 08:15:38,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 08:15:38,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:38,360 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2025-03-17 08:15:38,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 08:15:38,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 08:15:38,560 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:38,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:38,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1139309140, now seen corresponding path program 1 times [2025-03-17 08:15:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:38,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587691950] [2025-03-17 08:15:38,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:38,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:38,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 08:15:38,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 08:15:38,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:38,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-17 08:15:38,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:38,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587691950] [2025-03-17 08:15:38,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587691950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:38,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:38,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:15:38,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869903946] [2025-03-17 08:15:38,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:38,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:15:38,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:38,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:15:38,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:15:38,730 INFO L87 Difference]: Start difference. First operand 1228 states and 1735 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 08:15:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:38,802 INFO L93 Difference]: Finished difference Result 2451 states and 3488 transitions. [2025-03-17 08:15:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:15:38,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 155 [2025-03-17 08:15:38,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:38,809 INFO L225 Difference]: With dead ends: 2451 [2025-03-17 08:15:38,810 INFO L226 Difference]: Without dead ends: 1228 [2025-03-17 08:15:38,815 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-17 08:15:38,816 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 0 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:38,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1855 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:15:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2025-03-17 08:15:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1228. [2025-03-17 08:15:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 922 states have (on average 1.3752711496746204) internal successors, (1268), 937 states have internal predecessors, (1268), 234 states have call successors, (234), 74 states have call predecessors, (234), 71 states have return successors, (227), 225 states have call predecessors, (227), 225 states have call successors, (227) [2025-03-17 08:15:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1729 transitions. [2025-03-17 08:15:38,911 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1729 transitions. Word has length 155 [2025-03-17 08:15:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:38,911 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1729 transitions. [2025-03-17 08:15:38,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 08:15:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1729 transitions. [2025-03-17 08:15:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 08:15:38,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:38,917 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2025-03-17 08:15:38,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 08:15:38,918 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:38,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash 878064707, now seen corresponding path program 1 times [2025-03-17 08:15:38,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:38,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993111364] [2025-03-17 08:15:38,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:38,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:39,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 08:15:39,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 08:15:39,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:39,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-17 08:15:39,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:39,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993111364] [2025-03-17 08:15:39,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993111364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:39,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:39,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:15:39,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852309393] [2025-03-17 08:15:39,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:39,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:15:39,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:39,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:15:39,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:15:39,292 INFO L87 Difference]: Start difference. First operand 1228 states and 1729 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 08:15:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:39,400 INFO L93 Difference]: Finished difference Result 1307 states and 1825 transitions. [2025-03-17 08:15:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:15:39,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2025-03-17 08:15:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:39,407 INFO L225 Difference]: With dead ends: 1307 [2025-03-17 08:15:39,407 INFO L226 Difference]: Without dead ends: 1083 [2025-03-17 08:15:39,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:15:39,409 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 0 mSDsluCounter, 3722 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4657 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:39,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4657 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:15:39,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2025-03-17 08:15:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2025-03-17 08:15:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 820 states have (on average 1.3878048780487804) internal successors, (1138), 834 states have internal predecessors, (1138), 200 states have call successors, (200), 64 states have call predecessors, (200), 62 states have return successors, (195), 193 states have call predecessors, (195), 193 states have call successors, (195) [2025-03-17 08:15:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1533 transitions. [2025-03-17 08:15:39,443 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1533 transitions. Word has length 158 [2025-03-17 08:15:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:39,444 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1533 transitions. [2025-03-17 08:15:39,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 08:15:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1533 transitions. [2025-03-17 08:15:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-17 08:15:39,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:39,450 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 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] [2025-03-17 08:15:39,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 08:15:39,450 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:39,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:39,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1368040065, now seen corresponding path program 1 times [2025-03-17 08:15:39,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:39,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383963039] [2025-03-17 08:15:39,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:39,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:39,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 08:15:39,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 08:15:39,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:39,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 08:15:39,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:39,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383963039] [2025-03-17 08:15:39,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383963039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:39,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:39,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:15:39,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912618997] [2025-03-17 08:15:39,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:39,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:15:39,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:39,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:15:39,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:15:39,801 INFO L87 Difference]: Start difference. First operand 1083 states and 1533 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 08:15:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:39,899 INFO L93 Difference]: Finished difference Result 1185 states and 1660 transitions. [2025-03-17 08:15:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:15:39,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 166 [2025-03-17 08:15:39,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:39,901 INFO L225 Difference]: With dead ends: 1185 [2025-03-17 08:15:39,902 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 08:15:39,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:15:39,905 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 0 mSDsluCounter, 3634 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4545 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:39,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4545 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:15:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 08:15:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 08:15:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 08:15:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 08:15:39,907 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 166 [2025-03-17 08:15:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:39,907 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 08:15:39,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 08:15:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 08:15:39,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 08:15:39,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 08:15:39,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 08:15:39,911 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:15:39,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 08:15:44,137 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 08:15:44,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 08:15:44 BoogieIcfgContainer [2025-03-17 08:15:44,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 08:15:44,147 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 08:15:44,147 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 08:15:44,147 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 08:15:44,148 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:15:26" (3/4) ... [2025-03-17 08:15:44,149 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#12 [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure copy_from_user [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#11 [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#10 [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure uinput_ioctl_handler [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#7 [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#6 [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#9 [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#8 [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#13 [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __bad_percpu_size [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure input_event_size [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure uinput_ff_upload_from_user [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure uinput_destroy_device [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure input_abs_get_max [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __wake_up [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure variable_test_bit [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure get_current [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure uinput_request_done [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure signal_pending [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_lock_interruptible [2025-03-17 08:15:44,154 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure constant_test_bit [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure input_abs_get_min [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure is_compat_task [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kfree [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure might_fault [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure prepare_to_wait [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure input_abs_get_flat [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure copy_to_user [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure input_alloc_absinfo [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kzalloc [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure spin_lock [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_check_return_value [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure uinput_request_find [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __init_waitqueue_head [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure set_bit [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure spin_unlock [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_unlock_mutex_of_uinput_device [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure schedule [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#1 [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#0 [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#3 [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#2 [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#5 [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#4 [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _copy_from_user [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure finish_wait [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure uinput_allocate_device [2025-03-17 08:15:44,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2025-03-17 08:15:44,184 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 223 nodes and edges [2025-03-17 08:15:44,187 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 91 nodes and edges [2025-03-17 08:15:44,190 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-17 08:15:44,192 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 08:15:44,195 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 08:15:44,197 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 08:15:44,354 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 08:15:44,354 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 08:15:44,354 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 08:15:44,355 INFO L158 Benchmark]: Toolchain (without parser) took 30255.28ms. Allocated memory was 142.6MB in the beginning and 654.3MB in the end (delta: 511.7MB). Free memory was 98.9MB in the beginning and 388.4MB in the end (delta: -289.5MB). Peak memory consumption was 216.0MB. Max. memory is 16.1GB. [2025-03-17 08:15:44,355 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 08:15:44,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 919.88ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 57.4MB in the end (delta: 41.5MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2025-03-17 08:15:44,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 178.13ms. Allocated memory is still 142.6MB. Free memory was 57.4MB in the beginning and 94.3MB in the end (delta: -37.0MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2025-03-17 08:15:44,356 INFO L158 Benchmark]: Boogie Preprocessor took 272.50ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 83.7MB in the end (delta: 10.7MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2025-03-17 08:15:44,356 INFO L158 Benchmark]: IcfgBuilder took 11394.83ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 83.7MB in the beginning and 239.1MB in the end (delta: -155.4MB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. [2025-03-17 08:15:44,356 INFO L158 Benchmark]: TraceAbstraction took 17277.22ms. Allocated memory was 327.2MB in the beginning and 654.3MB in the end (delta: 327.2MB). Free memory was 236.1MB in the beginning and 425.7MB in the end (delta: -189.7MB). Peak memory consumption was 363.5MB. Max. memory is 16.1GB. [2025-03-17 08:15:44,356 INFO L158 Benchmark]: Witness Printer took 207.34ms. Allocated memory is still 654.3MB. Free memory was 425.7MB in the beginning and 388.4MB in the end (delta: 37.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 08:15:44,358 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 919.88ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 57.4MB in the end (delta: 41.5MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 178.13ms. Allocated memory is still 142.6MB. Free memory was 57.4MB in the beginning and 94.3MB in the end (delta: -37.0MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 272.50ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 83.7MB in the end (delta: 10.7MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * IcfgBuilder took 11394.83ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 83.7MB in the beginning and 239.1MB in the end (delta: -155.4MB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17277.22ms. Allocated memory was 327.2MB in the beginning and 654.3MB in the end (delta: 327.2MB). Free memory was 236.1MB in the beginning and 425.7MB in the end (delta: -189.7MB). Peak memory consumption was 363.5MB. Max. memory is 16.1GB. * Witness Printer took 207.34ms. Allocated memory is still 654.3MB. Free memory was 425.7MB in the beginning and 388.4MB in the end (delta: 37.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 3073]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [3073] - GenericResultAtLocation [Line: 3087]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3087-3088] - GenericResultAtLocation [Line: 3102]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [3102] - GenericResultAtLocation [Line: 3105]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3105] - GenericResultAtLocation [Line: 3108]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3108] - GenericResultAtLocation [Line: 3111]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3111] - GenericResultAtLocation [Line: 3173]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& kernel_stack)); [3173] - GenericResultAtLocation [Line: 3176]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3176] - GenericResultAtLocation [Line: 3179]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3179] - GenericResultAtLocation [Line: 3182]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3182] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4914]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 58 procedures, 744 locations, 1184 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4391 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4264 mSDsluCounter, 51535 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36689 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1024 IncrementalHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 14846 mSDtfsCounter, 1024 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 307 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1395occurred in iteration=4, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 96 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1351 NumberOfCodeBlocks, 1351 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1416 ConstructedInterpolants, 0 QuantifiedInterpolants, 1853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1947 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 302/316 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 08:15:44,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE