./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-551b009-m [2025-01-09 18:24:54,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:24:55,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:24:55,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:24:55,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:24:55,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:24:55,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:24:55,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:24:55,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:24:55,074 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:24:55,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:24:55,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:24:55,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:24:55,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:24:55,074 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:24:55,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:24:55,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:24:55,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:24:55,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:24:55,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:24:55,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:24:55,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:24:55,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:24:55,075 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:24:55,075 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:24:55,075 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:24:55,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:24:55,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:24:55,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:24:55,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:24:55,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:24:55,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:24:55,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:24:55,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:24:55,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:24:55,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:24:55,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:24:55,076 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:24:55,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:24:55,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:24:55,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:24:55,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:24:55,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:24:55,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:24:55,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:24:55,077 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-jdk21/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-01-09 18:24:55,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:24:55,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:24:55,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:24:55,334 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:24:55,334 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:24:55,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/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-01-09 18:24:56,561 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6944836be/fe28f4c1e97c4e99b4ec49ce2944c8af/FLAG43093633d [2025-01-09 18:24:57,062 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:24:57,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2025-01-09 18:24:57,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6944836be/fe28f4c1e97c4e99b4ec49ce2944c8af/FLAG43093633d [2025-01-09 18:24:57,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6944836be/fe28f4c1e97c4e99b4ec49ce2944c8af [2025-01-09 18:24:57,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:24:57,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:24:57,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:24:57,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:24:57,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:24:57,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:24:57" (1/1) ... [2025-01-09 18:24:57,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c42bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:57, skipping insertion in model container [2025-01-09 18:24:57,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:24:57" (1/1) ... [2025-01-09 18:24:57,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:24:58,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 18:24:58,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:24:58,221 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:24:58,297 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-01-09 18:24:58,300 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-01-09 18:24:58,301 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [3102] [2025-01-09 18:24:58,302 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3105] [2025-01-09 18:24:58,302 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3108] [2025-01-09 18:24:58,303 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3111] [2025-01-09 18:24:58,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& kernel_stack)); [3173] [2025-01-09 18:24:58,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3176] [2025-01-09 18:24:58,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3179] [2025-01-09 18:24:58,306 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3182] [2025-01-09 18:24:58,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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-01-09 18:24:58,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:24:58,451 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:24:58,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58 WrapperNode [2025-01-09 18:24:58,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:24:58,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:24:58,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:24:58,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:24:58,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58" (1/1) ... [2025-01-09 18:24:58,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58" (1/1) ... [2025-01-09 18:24:58,606 INFO L138 Inliner]: procedures = 191, calls = 833, calls flagged for inlining = 89, calls inlined = 75, statements flattened = 2334 [2025-01-09 18:24:58,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:24:58,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:24:58,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:24:58,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:24:58,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58" (1/1) ... [2025-01-09 18:24:58,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58" (1/1) ... [2025-01-09 18:24:58,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58" (1/1) ... [2025-01-09 18:24:58,785 INFO L175 MemorySlicer]: Split 435 memory accesses to 14 slices as follows [2, 2, 7, 8, 7, 7, 5, 35, 9, 3, 1, 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, 0, 7, 9, 0, 0, 0, 0, 0]. The 171 writes are split as follows [0, 0, 0, 1, 0, 0, 5, 28, 0, 0, 0, 103, 34, 0]. [2025-01-09 18:24:58,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58" (1/1) ... [2025-01-09 18:24:58,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58" (1/1) ... [2025-01-09 18:24:58,849 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58" (1/1) ... [2025-01-09 18:24:58,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58" (1/1) ... [2025-01-09 18:24:58,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58" (1/1) ... [2025-01-09 18:24:58,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58" (1/1) ... [2025-01-09 18:24:58,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58" (1/1) ... [2025-01-09 18:24:58,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:24:58,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:24:58,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:24:58,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:24:58,924 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58" (1/1) ... [2025-01-09 18:24:58,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:24:58,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:24:58,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 18:24:58,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 18:24:58,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:24:58,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:24:58,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure input_event_size [2025-01-09 18:24:58,977 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event_size [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-01-09 18:24:58,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 18:24:58,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 18:24:58,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2025-01-09 18:24:58,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2025-01-09 18:24:58,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:24:58,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:24:58,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:24:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:24:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:24:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:24:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:24:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:24:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:24:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-01-09 18:24:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-01-09 18:24:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-01-09 18:24:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-01-09 18:24:58,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-01-09 18:24:58,981 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_request_done [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_request_done [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_flat [2025-01-09 18:24:58,982 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_flat [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:24:58,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-01-09 18:24:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-01-09 18:24:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:24:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure input_alloc_absinfo [2025-01-09 18:24:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure input_alloc_absinfo [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2025-01-09 18:24:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:24:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_request_find [2025-01-09 18:24:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_request_find [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_uinput_device [2025-01-09 18:24:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_uinput_device [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_allocate_device [2025-01-09 18:24:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_allocate_device [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2025-01-09 18:24:58,983 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:24:58,983 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_ioctl_handler [2025-01-09 18:24:58,986 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_ioctl_handler [2025-01-09 18:24:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:24:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:24:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2025-01-09 18:24:58,987 INFO L138 BoogieDeclarations]: Found implementation of procedure __bad_percpu_size [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_ff_upload_from_user [2025-01-09 18:24:58,987 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_ff_upload_from_user [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_destroy_device [2025-01-09 18:24:58,987 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_destroy_device [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 18:24:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_max [2025-01-09 18:24:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_max [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-01-09 18:24:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-01-09 18:24:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2025-01-09 18:24:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-01-09 18:24:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_min [2025-01-09 18:24:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_min [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure is_compat_task [2025-01-09 18:24:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure is_compat_task [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2025-01-09 18:24:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait [2025-01-09 18:24:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 18:24:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-01-09 18:24:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-01-09 18:24:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2025-01-09 18:24:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2025-01-09 18:24:58,988 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-01-09 18:24:58,991 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-01-09 18:24:58,991 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-01-09 18:24:58,991 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2025-01-09 18:24:58,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2025-01-09 18:24:58,992 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-01-09 18:24:58,992 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-01-09 18:24:58,992 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:24:58,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:24:58,992 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-01-09 18:24:58,992 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-01-09 18:24:59,451 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:24:59,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:25:10,455 INFO L? ?]: Removed 1200 outVars from TransFormulas that were not future-live. [2025-01-09 18:25:10,456 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:25:10,480 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:25:10,483 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 18:25:10,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:25:10 BoogieIcfgContainer [2025-01-09 18:25:10,484 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:25:10,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:25:10,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:25:10,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:25:10,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:24:57" (1/3) ... [2025-01-09 18:25:10,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499d3ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:25:10, skipping insertion in model container [2025-01-09 18:25:10,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:24:58" (2/3) ... [2025-01-09 18:25:10,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499d3ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:25:10, skipping insertion in model container [2025-01-09 18:25:10,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:25:10" (3/3) ... [2025-01-09 18:25:10,493 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2025-01-09 18:25:10,505 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:25:10,506 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, 780 locations, 1 initial locations, 29 loop locations, and 1 error locations. [2025-01-09 18:25:10,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:25:10,555 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;@6da74bbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:25:10,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:25:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 715 states, 527 states have (on average 1.3586337760910816) internal successors, (716), 541 states have internal predecessors, (716), 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-01-09 18:25:10,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 18:25:10,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:10,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:25:10,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:10,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1531329268, now seen corresponding path program 1 times [2025-01-09 18:25:10,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:10,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916286682] [2025-01-09 18:25:10,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:10,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:10,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 18:25:10,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 18:25:10,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:10,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:25:11,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916286682] [2025-01-09 18:25:11,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916286682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:11,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:11,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:25:11,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191936181] [2025-01-09 18:25:11,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:11,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:25:11,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:11,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:25:11,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:25:11,044 INFO L87 Difference]: Start difference. First operand has 715 states, 527 states have (on average 1.3586337760910816) internal successors, (716), 541 states have internal predecessors, (716), 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 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-01-09 18:25:11,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:11,776 INFO L93 Difference]: Finished difference Result 1419 states and 2003 transitions. [2025-01-09 18:25:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:25:11,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 14 [2025-01-09 18:25:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:11,791 INFO L225 Difference]: With dead ends: 1419 [2025-01-09 18:25:11,792 INFO L226 Difference]: Without dead ends: 708 [2025-01-09 18:25:11,799 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-01-09 18:25:11,801 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 980 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:11,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 988 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 18:25:11,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-01-09 18:25:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2025-01-09 18:25:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 523 states have (on average 1.3518164435946463) internal successors, (707), 534 states have internal predecessors, (707), 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-01-09 18:25:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 985 transitions. [2025-01-09 18:25:11,882 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 985 transitions. Word has length 14 [2025-01-09 18:25:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:11,883 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 985 transitions. [2025-01-09 18:25:11,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-01-09 18:25:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 985 transitions. [2025-01-09 18:25:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 18:25:11,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:11,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:25:11,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:25:11,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:11,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:11,886 INFO L85 PathProgramCache]: Analyzing trace with hash 226283447, now seen corresponding path program 1 times [2025-01-09 18:25:11,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:11,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904091894] [2025-01-09 18:25:11,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:11,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:12,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 18:25:12,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 18:25:12,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:12,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:25:12,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904091894] [2025-01-09 18:25:12,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904091894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:12,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:12,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:25:12,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843761658] [2025-01-09 18:25:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:12,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:25:12,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:12,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:25:12,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:25:12,162 INFO L87 Difference]: Start difference. First operand 708 states and 985 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 18:25:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:12,890 INFO L93 Difference]: Finished difference Result 710 states and 986 transitions. [2025-01-09 18:25:12,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:25:12,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 15 [2025-01-09 18:25:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:12,898 INFO L225 Difference]: With dead ends: 710 [2025-01-09 18:25:12,898 INFO L226 Difference]: Without dead ends: 707 [2025-01-09 18:25:12,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:25:12,901 INFO L435 NwaCegarLoop]: 982 mSDtfsCounter, 973 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:12,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 982 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 18:25:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-01-09 18:25:12,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2025-01-09 18:25:12,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 523 states have (on average 1.349904397705545) internal successors, (706), 533 states have internal predecessors, (706), 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-01-09 18:25:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 983 transitions. [2025-01-09 18:25:12,952 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 983 transitions. Word has length 15 [2025-01-09 18:25:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:12,953 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 983 transitions. [2025-01-09 18:25:12,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 18:25:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 983 transitions. [2025-01-09 18:25:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 18:25:12,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:12,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:25:12,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:25:12,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:12,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:12,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1575426473, now seen corresponding path program 1 times [2025-01-09 18:25:12,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:12,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75361972] [2025-01-09 18:25:12,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:12,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:13,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 18:25:13,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 18:25:13,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:13,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:25:13,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:13,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75361972] [2025-01-09 18:25:13,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75361972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:13,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:13,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:25:13,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447507077] [2025-01-09 18:25:13,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:13,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:25:13,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:13,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:25:13,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:25:13,106 INFO L87 Difference]: Start difference. First operand 707 states and 983 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-09 18:25:13,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:13,630 INFO L93 Difference]: Finished difference Result 2049 states and 2871 transitions. [2025-01-09 18:25:13,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:25:13,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 16 [2025-01-09 18:25:13,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:13,638 INFO L225 Difference]: With dead ends: 2049 [2025-01-09 18:25:13,639 INFO L226 Difference]: Without dead ends: 1342 [2025-01-09 18:25:13,642 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-01-09 18:25:13,642 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 970 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:13,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 2408 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 18:25:13,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-01-09 18:25:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1339. [2025-01-09 18:25:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 994 states have (on average 1.3490945674044266) internal successors, (1341), 1012 states have internal predecessors, (1341), 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-01-09 18:25:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1873 transitions. [2025-01-09 18:25:13,746 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1873 transitions. Word has length 16 [2025-01-09 18:25:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:13,747 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 1873 transitions. [2025-01-09 18:25:13,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-01-09 18:25:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1873 transitions. [2025-01-09 18:25:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 18:25:13,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:13,752 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] [2025-01-09 18:25:13,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:25:13,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:13,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:13,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1565403306, now seen corresponding path program 1 times [2025-01-09 18:25:13,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:13,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823478606] [2025-01-09 18:25:13,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:13,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:13,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 18:25:13,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 18:25:13,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:13,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 18:25:13,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:13,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823478606] [2025-01-09 18:25:13,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823478606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:13,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:13,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:25:13,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893825038] [2025-01-09 18:25:13,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:13,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:25:13,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:13,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:25:13,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:25:13,953 INFO L87 Difference]: Start difference. First operand 1339 states and 1873 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-01-09 18:25:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:14,028 INFO L93 Difference]: Finished difference Result 2749 states and 3862 transitions. [2025-01-09 18:25:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:25:14,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 44 [2025-01-09 18:25:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:14,038 INFO L225 Difference]: With dead ends: 2749 [2025-01-09 18:25:14,038 INFO L226 Difference]: Without dead ends: 1418 [2025-01-09 18:25:14,041 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-01-09 18:25:14,042 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 54 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:14,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1932 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:25:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2025-01-09 18:25:14,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1409. [2025-01-09 18:25:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1054 states have (on average 1.3510436432637571) internal successors, (1424), 1072 states have internal predecessors, (1424), 274 states have call successors, (274), 82 states have call predecessors, (274), 80 states have return successors, (282), 264 states have call predecessors, (282), 268 states have call successors, (282) [2025-01-09 18:25:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1980 transitions. [2025-01-09 18:25:14,095 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1980 transitions. Word has length 44 [2025-01-09 18:25:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:14,095 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 1980 transitions. [2025-01-09 18:25:14,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-01-09 18:25:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1980 transitions. [2025-01-09 18:25:14,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 18:25:14,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:14,099 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, 1, 1, 1, 1, 1] [2025-01-09 18:25:14,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:25:14,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:14,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:14,099 INFO L85 PathProgramCache]: Analyzing trace with hash 620108975, now seen corresponding path program 1 times [2025-01-09 18:25:14,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:14,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300176237] [2025-01-09 18:25:14,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:14,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:14,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 18:25:14,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 18:25:14,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:14,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 18:25:14,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:14,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300176237] [2025-01-09 18:25:14,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300176237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:14,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:14,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:25:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135691818] [2025-01-09 18:25:14,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:14,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:25:14,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:14,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:25:14,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:25:14,329 INFO L87 Difference]: Start difference. First operand 1409 states and 1980 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-01-09 18:25:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:15,223 INFO L93 Difference]: Finished difference Result 2812 states and 3952 transitions. [2025-01-09 18:25:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:25:15,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 55 [2025-01-09 18:25:15,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:15,231 INFO L225 Difference]: With dead ends: 2812 [2025-01-09 18:25:15,231 INFO L226 Difference]: Without dead ends: 1411 [2025-01-09 18:25:15,237 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-01-09 18:25:15,239 INFO L435 NwaCegarLoop]: 1174 mSDtfsCounter, 882 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:15,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 2133 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 18:25:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2025-01-09 18:25:15,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1402. [2025-01-09 18:25:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1051 states have (on average 1.3501427212178878) internal successors, (1419), 1067 states have internal predecessors, (1419), 270 states have call successors, (270), 82 states have call predecessors, (270), 80 states have return successors, (266), 262 states have call predecessors, (266), 259 states have call successors, (266) [2025-01-09 18:25:15,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1955 transitions. [2025-01-09 18:25:15,288 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1955 transitions. Word has length 55 [2025-01-09 18:25:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:15,288 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 1955 transitions. [2025-01-09 18:25:15,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-01-09 18:25:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1955 transitions. [2025-01-09 18:25:15,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 18:25:15,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:15,292 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, 1, 1, 1] [2025-01-09 18:25:15,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:25:15,295 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:15,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1055784839, now seen corresponding path program 1 times [2025-01-09 18:25:15,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:15,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077626766] [2025-01-09 18:25:15,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:15,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 18:25:15,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 18:25:15,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:15,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 18:25:15,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:15,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077626766] [2025-01-09 18:25:15,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077626766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:15,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:15,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:25:15,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692906523] [2025-01-09 18:25:15,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:15,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:25:15,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:15,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:25:15,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:25:15,573 INFO L87 Difference]: Start difference. First operand 1402 states and 1955 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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-01-09 18:25:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:15,706 INFO L93 Difference]: Finished difference Result 1532 states and 2107 transitions. [2025-01-09 18:25:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:25:15,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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 53 [2025-01-09 18:25:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:15,712 INFO L225 Difference]: With dead ends: 1532 [2025-01-09 18:25:15,713 INFO L226 Difference]: Without dead ends: 1174 [2025-01-09 18:25:15,714 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-01-09 18:25:15,715 INFO L435 NwaCegarLoop]: 992 mSDtfsCounter, 2 mSDsluCounter, 3918 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4910 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:15,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4910 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:25:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-01-09 18:25:15,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1169. [2025-01-09 18:25:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 878 states have (on average 1.328018223234624) internal successors, (1166), 890 states have internal predecessors, (1166), 218 states have call successors, (218), 74 states have call predecessors, (218), 72 states have return successors, (215), 213 states have call predecessors, (215), 208 states have call successors, (215) [2025-01-09 18:25:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1599 transitions. [2025-01-09 18:25:15,756 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1599 transitions. Word has length 53 [2025-01-09 18:25:15,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:15,756 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1599 transitions. [2025-01-09 18:25:15,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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-01-09 18:25:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1599 transitions. [2025-01-09 18:25:15,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 18:25:15,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:15,758 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, 1, 1, 1, 1] [2025-01-09 18:25:15,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:25:15,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:15,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:15,759 INFO L85 PathProgramCache]: Analyzing trace with hash 657213630, now seen corresponding path program 1 times [2025-01-09 18:25:15,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:15,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435675823] [2025-01-09 18:25:15,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:15,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:15,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 18:25:15,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 18:25:15,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:15,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 18:25:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:16,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435675823] [2025-01-09 18:25:16,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435675823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:16,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:16,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:25:16,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819669285] [2025-01-09 18:25:16,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:16,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:25:16,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:16,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:25:16,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:25:16,001 INFO L87 Difference]: Start difference. First operand 1169 states and 1599 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (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-01-09 18:25:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:16,112 INFO L93 Difference]: Finished difference Result 1411 states and 1922 transitions. [2025-01-09 18:25:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:25:16,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (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 58 [2025-01-09 18:25:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:16,117 INFO L225 Difference]: With dead ends: 1411 [2025-01-09 18:25:16,117 INFO L226 Difference]: Without dead ends: 1164 [2025-01-09 18:25:16,118 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-01-09 18:25:16,119 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 134 mSDsluCounter, 3736 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 4720 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:16,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 4720 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:25:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2025-01-09 18:25:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1159. [2025-01-09 18:25:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 869 states have (on average 1.3302646720368239) internal successors, (1156), 884 states have internal predecessors, (1156), 218 states have call successors, (218), 74 states have call predecessors, (218), 71 states have return successors, (211), 209 states have call predecessors, (211), 208 states have call successors, (211) [2025-01-09 18:25:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1585 transitions. [2025-01-09 18:25:16,154 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1585 transitions. Word has length 58 [2025-01-09 18:25:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:16,155 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1585 transitions. [2025-01-09 18:25:16,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (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-01-09 18:25:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1585 transitions. [2025-01-09 18:25:16,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 18:25:16,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:16,158 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, 1, 1, 1, 1] [2025-01-09 18:25:16,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:25:16,159 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:16,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:16,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1326064945, now seen corresponding path program 1 times [2025-01-09 18:25:16,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:16,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667737746] [2025-01-09 18:25:16,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:16,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:16,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 18:25:16,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 18:25:16,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:16,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 18:25:16,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667737746] [2025-01-09 18:25:16,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667737746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:16,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:16,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:25:16,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571144865] [2025-01-09 18:25:16,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:16,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:25:16,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:16,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:25:16,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:25:16,318 INFO L87 Difference]: Start difference. First operand 1159 states and 1585 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-01-09 18:25:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:16,373 INFO L93 Difference]: Finished difference Result 2316 states and 3170 transitions. [2025-01-09 18:25:16,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:25:16,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 75 [2025-01-09 18:25:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:16,379 INFO L225 Difference]: With dead ends: 2316 [2025-01-09 18:25:16,379 INFO L226 Difference]: Without dead ends: 1162 [2025-01-09 18:25:16,382 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-01-09 18:25:16,382 INFO L435 NwaCegarLoop]: 980 mSDtfsCounter, 0 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:16,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2935 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:25:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-01-09 18:25:16,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2025-01-09 18:25:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 871 states have (on average 1.328358208955224) internal successors, (1157), 886 states have internal predecessors, (1157), 219 states have call successors, (219), 74 states have call predecessors, (219), 71 states have return successors, (212), 210 states have call predecessors, (212), 209 states have call successors, (212) [2025-01-09 18:25:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1588 transitions. [2025-01-09 18:25:16,414 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1588 transitions. Word has length 75 [2025-01-09 18:25:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:16,414 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1588 transitions. [2025-01-09 18:25:16,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-01-09 18:25:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1588 transitions. [2025-01-09 18:25:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 18:25:16,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:16,417 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, 1, 1, 1, 1, 1] [2025-01-09 18:25:16,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:25:16,417 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:16,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:16,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1839172203, now seen corresponding path program 1 times [2025-01-09 18:25:16,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:16,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363445044] [2025-01-09 18:25:16,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:16,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:16,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 18:25:16,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 18:25:16,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:16,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 18:25:16,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:16,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363445044] [2025-01-09 18:25:16,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363445044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:16,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:16,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:25:16,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432646960] [2025-01-09 18:25:16,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:16,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:25:16,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:16,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:25:16,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:25:16,698 INFO L87 Difference]: Start difference. First operand 1162 states and 1588 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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-01-09 18:25:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:16,787 INFO L93 Difference]: Finished difference Result 2295 states and 3138 transitions. [2025-01-09 18:25:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:25:16,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 88 [2025-01-09 18:25:16,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:16,792 INFO L225 Difference]: With dead ends: 2295 [2025-01-09 18:25:16,792 INFO L226 Difference]: Without dead ends: 1141 [2025-01-09 18:25:16,795 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-01-09 18:25:16,795 INFO L435 NwaCegarLoop]: 984 mSDtfsCounter, 3 mSDsluCounter, 3914 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4898 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:16,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4898 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:25:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-01-09 18:25:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1140. [2025-01-09 18:25:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 850 states have (on average 1.3247058823529412) internal successors, (1126), 864 states have internal predecessors, (1126), 218 states have call successors, (218), 74 states have call predecessors, (218), 71 states have return successors, (212), 210 states have call predecessors, (212), 209 states have call successors, (212) [2025-01-09 18:25:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1556 transitions. [2025-01-09 18:25:16,826 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1556 transitions. Word has length 88 [2025-01-09 18:25:16,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:16,826 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1556 transitions. [2025-01-09 18:25:16,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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-01-09 18:25:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1556 transitions. [2025-01-09 18:25:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 18:25:16,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:16,828 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:25:16,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:25:16,829 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:16,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:16,829 INFO L85 PathProgramCache]: Analyzing trace with hash -703471364, now seen corresponding path program 1 times [2025-01-09 18:25:16,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:16,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586395404] [2025-01-09 18:25:16,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:16,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:16,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 18:25:16,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 18:25:16,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:16,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:17,016 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 18:25:17,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:17,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586395404] [2025-01-09 18:25:17,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586395404] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:25:17,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930690102] [2025-01-09 18:25:17,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:17,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:25:17,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:25:17,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:25:17,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 18:25:17,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 18:25:17,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 18:25:17,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:17,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:17,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:25:17,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:25:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 18:25:17,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:25:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 18:25:17,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930690102] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:25:17,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:25:17,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 18:25:17,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53763969] [2025-01-09 18:25:17,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:25:17,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:25:17,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:17,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:25:17,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:25:17,752 INFO L87 Difference]: Start difference. First operand 1140 states and 1556 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-01-09 18:25:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:17,898 INFO L93 Difference]: Finished difference Result 2429 states and 3342 transitions. [2025-01-09 18:25:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:25:17,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 90 [2025-01-09 18:25:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:17,905 INFO L225 Difference]: With dead ends: 2429 [2025-01-09 18:25:17,905 INFO L226 Difference]: Without dead ends: 1297 [2025-01-09 18:25:17,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 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-01-09 18:25:17,908 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 295 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:17,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1994 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:25:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2025-01-09 18:25:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1258. [2025-01-09 18:25:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 956 states have (on average 1.3430962343096233) internal successors, (1284), 970 states have internal predecessors, (1284), 230 states have call successors, (230), 74 states have call predecessors, (230), 71 states have return successors, (224), 222 states have call predecessors, (224), 221 states have call successors, (224) [2025-01-09 18:25:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1738 transitions. [2025-01-09 18:25:17,943 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1738 transitions. Word has length 90 [2025-01-09 18:25:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:17,943 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1738 transitions. [2025-01-09 18:25:17,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-01-09 18:25:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1738 transitions. [2025-01-09 18:25:17,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 18:25:17,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:17,946 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:25:17,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 18:25:18,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 18:25:18,147 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:18,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash 821600570, now seen corresponding path program 1 times [2025-01-09 18:25:18,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:18,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920080934] [2025-01-09 18:25:18,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:18,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:18,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 18:25:18,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 18:25:18,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:18,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 18:25:18,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:18,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920080934] [2025-01-09 18:25:18,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920080934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:18,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:18,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:25:18,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669314085] [2025-01-09 18:25:18,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:18,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:25:18,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:18,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:25:18,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:25:18,394 INFO L87 Difference]: Start difference. First operand 1258 states and 1738 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 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-01-09 18:25:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:18,479 INFO L93 Difference]: Finished difference Result 2509 states and 3469 transitions. [2025-01-09 18:25:18,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:25:18,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 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 99 [2025-01-09 18:25:18,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:18,488 INFO L225 Difference]: With dead ends: 2509 [2025-01-09 18:25:18,488 INFO L226 Difference]: Without dead ends: 1259 [2025-01-09 18:25:18,493 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-01-09 18:25:18,494 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 21 mSDsluCounter, 3870 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4848 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:18,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4848 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:25:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-01-09 18:25:18,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1259. [2025-01-09 18:25:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 957 states have (on average 1.341692789968652) internal successors, (1284), 971 states have internal predecessors, (1284), 230 states have call successors, (230), 74 states have call predecessors, (230), 71 states have return successors, (224), 222 states have call predecessors, (224), 221 states have call successors, (224) [2025-01-09 18:25:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1738 transitions. [2025-01-09 18:25:18,540 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1738 transitions. Word has length 99 [2025-01-09 18:25:18,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:18,540 INFO L471 AbstractCegarLoop]: Abstraction has 1259 states and 1738 transitions. [2025-01-09 18:25:18,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 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-01-09 18:25:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1738 transitions. [2025-01-09 18:25:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 18:25:18,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:18,544 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] [2025-01-09 18:25:18,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 18:25:18,545 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:18,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:18,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1722017856, now seen corresponding path program 1 times [2025-01-09 18:25:18,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:18,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814063285] [2025-01-09 18:25:18,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:18,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:18,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 18:25:18,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 18:25:18,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:18,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 18:25:18,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:18,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814063285] [2025-01-09 18:25:18,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814063285] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:25:18,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896971023] [2025-01-09 18:25:18,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:18,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:25:18,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:25:18,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:25:18,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 18:25:19,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 18:25:19,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 18:25:19,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:19,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:19,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 18:25:19,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:25:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 18:25:19,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:25:19,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896971023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:19,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:25:19,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 8 [2025-01-09 18:25:19,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943879408] [2025-01-09 18:25:19,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:19,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 18:25:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:19,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 18:25:19,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 18:25:19,547 INFO L87 Difference]: Start difference. First operand 1259 states and 1738 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 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-01-09 18:25:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:19,643 INFO L93 Difference]: Finished difference Result 2514 states and 3472 transitions. [2025-01-09 18:25:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 18:25:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 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 123 [2025-01-09 18:25:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:19,649 INFO L225 Difference]: With dead ends: 2514 [2025-01-09 18:25:19,649 INFO L226 Difference]: Without dead ends: 1251 [2025-01-09 18:25:19,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 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-01-09 18:25:19,653 INFO L435 NwaCegarLoop]: 981 mSDtfsCounter, 3 mSDsluCounter, 5862 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6843 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:19,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6843 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:25:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-01-09 18:25:19,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2025-01-09 18:25:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 951 states have (on average 1.3396424815983177) internal successors, (1274), 966 states have internal predecessors, (1274), 228 states have call successors, (228), 74 states have call predecessors, (228), 71 states have return successors, (221), 219 states have call predecessors, (221), 219 states have call successors, (221) [2025-01-09 18:25:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1723 transitions. [2025-01-09 18:25:19,685 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1723 transitions. Word has length 123 [2025-01-09 18:25:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:19,685 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1723 transitions. [2025-01-09 18:25:19,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 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-01-09 18:25:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1723 transitions. [2025-01-09 18:25:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 18:25:19,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:19,689 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, 1, 1, 1, 1, 1] [2025-01-09 18:25:19,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 18:25:19,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:25:19,890 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:19,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:19,890 INFO L85 PathProgramCache]: Analyzing trace with hash -374873949, now seen corresponding path program 1 times [2025-01-09 18:25:19,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:19,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653886948] [2025-01-09 18:25:19,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:19,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:20,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 18:25:20,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 18:25:20,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:20,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 18:25:20,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:20,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653886948] [2025-01-09 18:25:20,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653886948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:20,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:20,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:25:20,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473069515] [2025-01-09 18:25:20,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:20,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:25:20,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:20,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:25:20,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:25:20,083 INFO L87 Difference]: Start difference. First operand 1251 states and 1723 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-01-09 18:25:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:20,125 INFO L93 Difference]: Finished difference Result 2494 states and 3459 transitions. [2025-01-09 18:25:20,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:25:20,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 163 [2025-01-09 18:25:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:20,131 INFO L225 Difference]: With dead ends: 2494 [2025-01-09 18:25:20,131 INFO L226 Difference]: Without dead ends: 1251 [2025-01-09 18:25:20,134 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-01-09 18:25:20,135 INFO L435 NwaCegarLoop]: 973 mSDtfsCounter, 0 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:20,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1939 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:25:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-01-09 18:25:20,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2025-01-09 18:25:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 951 states have (on average 1.3333333333333333) internal successors, (1268), 966 states have internal predecessors, (1268), 228 states have call successors, (228), 74 states have call predecessors, (228), 71 states have return successors, (221), 219 states have call predecessors, (221), 219 states have call successors, (221) [2025-01-09 18:25:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1717 transitions. [2025-01-09 18:25:20,165 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1717 transitions. Word has length 163 [2025-01-09 18:25:20,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:20,165 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 1717 transitions. [2025-01-09 18:25:20,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-01-09 18:25:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1717 transitions. [2025-01-09 18:25:20,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 18:25:20,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:20,169 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:25:20,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 18:25:20,169 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:20,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:20,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1981904212, now seen corresponding path program 1 times [2025-01-09 18:25:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:20,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359290075] [2025-01-09 18:25:20,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:20,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 18:25:20,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 18:25:20,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:20,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 18:25:20,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:20,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359290075] [2025-01-09 18:25:20,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359290075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:20,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:20,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:25:20,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333763082] [2025-01-09 18:25:20,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:20,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:25:20,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:20,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:25:20,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:25:20,437 INFO L87 Difference]: Start difference. First operand 1251 states and 1717 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 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-01-09 18:25:20,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:20,496 INFO L93 Difference]: Finished difference Result 1333 states and 1816 transitions. [2025-01-09 18:25:20,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:25:20,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 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 166 [2025-01-09 18:25:20,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:20,501 INFO L225 Difference]: With dead ends: 1333 [2025-01-09 18:25:20,502 INFO L226 Difference]: Without dead ends: 1102 [2025-01-09 18:25:20,503 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-01-09 18:25:20,503 INFO L435 NwaCegarLoop]: 977 mSDtfsCounter, 0 mSDsluCounter, 3890 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4867 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:20,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4867 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:25:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-01-09 18:25:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2025-01-09 18:25:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 845 states have (on average 1.3420118343195266) internal successors, (1134), 859 states have internal predecessors, (1134), 194 states have call successors, (194), 64 states have call predecessors, (194), 62 states have return successors, (189), 187 states have call predecessors, (189), 187 states have call successors, (189) [2025-01-09 18:25:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1517 transitions. [2025-01-09 18:25:20,529 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1517 transitions. Word has length 166 [2025-01-09 18:25:20,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:20,529 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1517 transitions. [2025-01-09 18:25:20,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 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-01-09 18:25:20,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1517 transitions. [2025-01-09 18:25:20,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 18:25:20,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:25:20,534 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:25:20,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 18:25:20,535 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:25:20,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:25:20,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1192004827, now seen corresponding path program 1 times [2025-01-09 18:25:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:25:20,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137804118] [2025-01-09 18:25:20,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:25:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:25:20,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 18:25:20,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 18:25:20,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:25:20,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:25:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-09 18:25:20,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:25:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137804118] [2025-01-09 18:25:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137804118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:25:20,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:25:20,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 18:25:20,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690296998] [2025-01-09 18:25:20,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:25:20,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 18:25:20,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:25:20,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 18:25:20,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:25:20,805 INFO L87 Difference]: Start difference. First operand 1102 states and 1517 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 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-01-09 18:25:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:25:20,861 INFO L93 Difference]: Finished difference Result 1212 states and 1652 transitions. [2025-01-09 18:25:20,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 18:25:20,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 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 175 [2025-01-09 18:25:20,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:25:20,863 INFO L225 Difference]: With dead ends: 1212 [2025-01-09 18:25:20,863 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 18:25:20,867 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-01-09 18:25:20,867 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 0 mSDsluCounter, 3798 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4750 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:25:20,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4750 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:25:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 18:25:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 18:25:20,868 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-01-09 18:25:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 18:25:20,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2025-01-09 18:25:20,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:25:20,870 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 18:25:20,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 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-01-09 18:25:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 18:25:20,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 18:25:20,875 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 18:25:20,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 18:25:20,877 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:25:20,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 18:25:25,452 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 18:25:25,477 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~retval~5 [2025-01-09 18:25:25,478 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_uinput_fops_file_operations~0 [2025-01-09 18:25:25,478 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_uinput_fops_file_operations~0 [2025-01-09 18:25:25,478 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_uinput_fops_file_operations~0 [2025-01-09 18:25:25,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 06:25:25 BoogieIcfgContainer [2025-01-09 18:25:25,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 18:25:25,479 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 18:25:25,479 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 18:25:25,480 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 18:25:25,480 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:25:10" (3/4) ... [2025-01-09 18:25:25,482 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 18:25:25,486 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#12 [2025-01-09 18:25:25,486 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure copy_from_user [2025-01-09 18:25:25,486 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#11 [2025-01-09 18:25:25,486 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#10 [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure uinput_ioctl_handler [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#7 [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#6 [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#9 [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#8 [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#13 [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __bad_percpu_size [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure input_event_size [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure uinput_ff_upload_from_user [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure uinput_destroy_device [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure input_abs_get_max [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __wake_up [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure variable_test_bit [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure get_current [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure uinput_request_done [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure signal_pending [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-01-09 18:25:25,487 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock_interruptible [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure constant_test_bit [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure input_abs_get_min [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure is_compat_task [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure might_fault [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure prepare_to_wait [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printk [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure input_abs_get_flat [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure copy_to_user [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure input_alloc_absinfo [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure spin_lock [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_return_value [2025-01-09 18:25:25,488 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure uinput_request_find [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __init_waitqueue_head [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure set_bit [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure spin_unlock [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_unlock_mutex_of_uinput_device [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure schedule [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#1 [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#0 [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#3 [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#2 [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#5 [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy#4 [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure _copy_from_user [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure finish_wait [2025-01-09 18:25:25,489 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure uinput_allocate_device [2025-01-09 18:25:25,490 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2025-01-09 18:25:25,513 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 227 nodes and edges [2025-01-09 18:25:25,516 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 93 nodes and edges [2025-01-09 18:25:25,518 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-01-09 18:25:25,521 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 18:25:25,523 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 18:25:25,525 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 18:25:25,567 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(ldv_mutex_mutex_of_uinput_device) == 1) && (1 == ldv_mutex_mutex_of_device)) && (ldv_mutex_mutex_of_uinput_device == 2)) && (ldv_mutex_lock == 1)) [2025-01-09 18:25:25,652 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(ldv_mutex_mutex_of_uinput_device) == 1) && (1 == ldv_mutex_mutex_of_device)) && (ldv_mutex_mutex_of_uinput_device == 2)) && (ldv_mutex_lock == 1)) [2025-01-09 18:25:25,691 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 18:25:25,692 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 18:25:25,692 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 18:25:25,693 INFO L158 Benchmark]: Toolchain (without parser) took 28589.38ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 99.1MB in the beginning and 281.6MB in the end (delta: -182.5MB). Peak memory consumption was 264.8MB. Max. memory is 16.1GB. [2025-01-09 18:25:25,693 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 18:25:25,693 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1348.49ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 56.7MB in the end (delta: 42.4MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2025-01-09 18:25:25,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 153.56ms. Allocated memory is still 142.6MB. Free memory was 56.7MB in the beginning and 39.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 18:25:25,694 INFO L158 Benchmark]: Boogie Preprocessor took 313.57ms. Allocated memory is still 142.6MB. Free memory was 39.9MB in the beginning and 55.0MB in the end (delta: -15.1MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2025-01-09 18:25:25,694 INFO L158 Benchmark]: RCFGBuilder took 11561.83ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 55.0MB in the beginning and 119.2MB in the end (delta: -64.2MB). Peak memory consumption was 162.9MB. Max. memory is 16.1GB. [2025-01-09 18:25:25,694 INFO L158 Benchmark]: TraceAbstraction took 14993.34ms. Allocated memory was 360.7MB in the beginning and 595.6MB in the end (delta: 234.9MB). Free memory was 118.3MB in the beginning and 319.0MB in the end (delta: -200.7MB). Peak memory consumption was 178.2MB. Max. memory is 16.1GB. [2025-01-09 18:25:25,694 INFO L158 Benchmark]: Witness Printer took 212.58ms. Allocated memory is still 595.6MB. Free memory was 319.0MB in the beginning and 281.6MB in the end (delta: 37.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 18:25:25,697 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1348.49ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 56.7MB in the end (delta: 42.4MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 153.56ms. Allocated memory is still 142.6MB. Free memory was 56.7MB in the beginning and 39.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 313.57ms. Allocated memory is still 142.6MB. Free memory was 39.9MB in the beginning and 55.0MB in the end (delta: -15.1MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * RCFGBuilder took 11561.83ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 55.0MB in the beginning and 119.2MB in the end (delta: -64.2MB). Peak memory consumption was 162.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14993.34ms. Allocated memory was 360.7MB in the beginning and 595.6MB in the end (delta: 234.9MB). Free memory was 118.3MB in the beginning and 319.0MB in the end (delta: -200.7MB). Peak memory consumption was 178.2MB. Max. memory is 16.1GB. * Witness Printer took 212.58ms. Allocated memory is still 595.6MB. Free memory was 319.0MB in the beginning and 281.6MB 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] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~retval~5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_s_uinput_fops_file_operations~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_s_uinput_fops_file_operations~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_s_uinput_fops_file_operations~0 * 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, 780 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4402 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4317 mSDsluCounter, 51147 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35721 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 15426 mSDtfsCounter, 413 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 328 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1409occurred in iteration=4, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 71 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1447 NumberOfCodeBlocks, 1447 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1519 ConstructedInterpolants, 0 QuantifiedInterpolants, 1991 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2091 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 - InvariantResult [Line: 4052]: Location Invariant Derived location invariant: (((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_mutex_of_uinput_device == 2)) && (ldv_mutex_lock == 1)) - InvariantResult [Line: 3902]: Location Invariant Derived location invariant: (((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_mutex_of_uinput_device == 2)) && (ldv_mutex_lock == 1)) - InvariantResult [Line: 4773]: Location Invariant Derived location invariant: (((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_lock == 1)) && (ldv_mutex_mutex_of_uinput_device == 1)) - InvariantResult [Line: 3855]: Location Invariant Derived location invariant: ((((\old(ldv_mutex_mutex_of_uinput_device) == 1) && (1 == ldv_mutex_mutex_of_device)) && (ldv_mutex_mutex_of_uinput_device == 2)) && (ldv_mutex_lock == 1)) - InvariantResult [Line: 4225]: Location Invariant Derived location invariant: ((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_lock == 1)) && (ldv_mutex_mutex_of_uinput_device == 1)) && (retval == 0)) - InvariantResult [Line: 4201]: Location Invariant Derived location invariant: ((((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_lock == 1)) && (ldv_mutex_mutex_of_uinput_device == 1)) && (retval == 0)) - InvariantResult [Line: 4143]: Location Invariant Derived location invariant: (((1 == ldv_mutex_mutex_of_device) && (ldv_mutex_mutex_of_uinput_device == 2)) && (ldv_mutex_lock == 1)) RESULT: Ultimate proved your program to be correct! [2025-01-09 18:25:25,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE