./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.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 d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:30:41,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:30:41,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 05:30:41,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:30:41,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:30:41,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:30:41,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:30:41,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:30:41,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:30:41,893 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:30:41,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:30:41,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:30:41,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:30:41,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:30:41,895 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:30:41,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:30:41,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:30:41,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:30:41,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:30:41,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:30:41,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:30:41,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:30:41,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:30:41,895 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:30:41,895 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:30:41,895 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:30:41,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:30:41,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:30:41,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:30:41,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:30:41,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:30:41,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:30:41,896 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:30:41,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:30:41,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:30:41,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:30:41,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:30:41,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:30:41,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:30:41,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:30:41,896 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 -> d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 [2025-02-06 05:30:42,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:30:42,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:30:42,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:30:42,193 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:30:42,194 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:30:42,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2025-02-06 05:30:43,566 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be9d207b1/b9642825d1444ab983f9b5e062645b0d/FLAG5471b34f2 [2025-02-06 05:30:44,135 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:30:44,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2025-02-06 05:30:44,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be9d207b1/b9642825d1444ab983f9b5e062645b0d/FLAG5471b34f2 [2025-02-06 05:30:44,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be9d207b1/b9642825d1444ab983f9b5e062645b0d [2025-02-06 05:30:44,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:30:44,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:30:44,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:30:44,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:30:44,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:30:44,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:30:44" (1/1) ... [2025-02-06 05:30:44,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1548bc1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:44, skipping insertion in model container [2025-02-06 05:30:44,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:30:44" (1/1) ... [2025-02-06 05:30:44,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:30:45,088 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-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2025-02-06 05:30:45,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:30:45,183 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:30:45,404 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-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2025-02-06 05:30:45,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:30:45,490 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:30:45,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:45 WrapperNode [2025-02-06 05:30:45,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:30:45,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:30:45,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:30:45,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:30:45,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:45" (1/1) ... [2025-02-06 05:30:45,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:45" (1/1) ... [2025-02-06 05:30:45,648 INFO L138 Inliner]: procedures = 82, calls = 541, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 2109 [2025-02-06 05:30:45,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:30:45,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:30:45,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:30:45,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:30:45,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:45" (1/1) ... [2025-02-06 05:30:45,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:45" (1/1) ... [2025-02-06 05:30:45,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:45" (1/1) ... [2025-02-06 05:30:45,777 INFO L175 MemorySlicer]: Split 361 memory accesses to 21 slices as follows [2, 7, 5, 69, 1, 1, 9, 9, 8, 1, 8, 2, 8, 48, 7, 7, 2, 7, 8, 1, 151]. 42 percent of accesses are in the largest equivalence class. The 110 initializations are split as follows [2, 7, 0, 0, 1, 1, 9, 9, 8, 0, 8, 0, 8, 14, 7, 7, 0, 7, 8, 0, 14]. The 183 writes are split as follows [0, 0, 0, 69, 0, 0, 0, 0, 0, 1, 0, 0, 0, 13, 0, 0, 0, 0, 0, 0, 100]. [2025-02-06 05:30:45,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:45" (1/1) ... [2025-02-06 05:30:45,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:45" (1/1) ... [2025-02-06 05:30:45,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:45" (1/1) ... [2025-02-06 05:30:45,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:45" (1/1) ... [2025-02-06 05:30:45,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:45" (1/1) ... [2025-02-06 05:30:45,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:45" (1/1) ... [2025-02-06 05:30:45,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:30:45,906 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:30:45,907 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:30:45,907 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:30:45,908 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:45" (1/1) ... [2025-02-06 05:30:45,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:30:45,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:30:45,942 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-02-06 05:30:45,947 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-02-06 05:30:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure ir_init [2025-02-06 05:30:45,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_init [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-06 05:30:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-06 05:30:45,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-06 05:30:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-06 05:30:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-06 05:30:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure ir_exit [2025-02-06 05:30:45,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_exit [2025-02-06 05:30:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 05:30:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 05:30:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 05:30:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 05:30:45,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 05:30:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 05:30:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 05:30:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 05:30:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 05:30:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 05:30:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-06 05:30:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-06 05:30:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-06 05:30:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-06 05:30:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-06 05:30:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-06 05:30:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-06 05:30:45,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-06 05:30:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-06 05:30:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-02-06 05:30:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-02-06 05:30:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 05:30:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 05:30:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 05:30:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 05:30:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 05:30:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 05:30:45,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 05:30:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 05:30:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 05:30:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 05:30:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 05:30:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 05:30:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 05:30:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 05:30:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 05:30:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-06 05:30:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-06 05:30:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-06 05:30:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-06 05:30:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-06 05:30:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-06 05:30:45,979 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-02-06 05:30:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-02-06 05:30:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 05:30:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2025-02-06 05:30:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 05:30:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 05:30:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-02-06 05:30:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 05:30:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_deregister [2025-02-06 05:30:45,981 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_deregister [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2025-02-06 05:30:45,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-02-06 05:30:45,981 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure ir_xbof_change [2025-02-06 05:30:45,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_xbof_change [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2025-02-06 05:30:45,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_uint_must_check_helper [2025-02-06 05:30:45,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_uint_must_check_helper [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 05:30:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 05:30:45,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 05:30:45,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 05:30:45,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 05:30:45,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 05:30:45,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-06 05:30:45,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-06 05:30:45,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-06 05:30:45,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-06 05:30:45,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 05:30:45,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:30:45,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:30:46,392 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:30:46,394 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:30:46,503 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5147: havoc usb_serial_register_#t~nondet168#1; [2025-02-06 05:30:46,503 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5136: havoc usb_register_driver_#t~nondet166#1; [2025-02-06 05:30:46,552 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3726: havoc #t~mem11;havoc #t~bitwise12; [2025-02-06 05:30:46,570 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5075: havoc #t~malloc156.base, #t~malloc156.offset; [2025-02-06 05:30:46,578 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2025-02-06 05:30:46,641 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4096: assume false; [2025-02-06 05:30:46,641 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4096: assume !false; [2025-02-06 05:30:46,679 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint usb_free_urbFINAL: assume true; [2025-02-06 05:30:46,688 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5102: havoc #t~nondet161; [2025-02-06 05:30:46,696 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5089: havoc #t~nondet159; [2025-02-06 05:30:46,715 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5078: havoc __kmalloc_#t~ret157#1.base, __kmalloc_#t~ret157#1.offset; [2025-02-06 05:30:46,718 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc #t~ret160.base, #t~ret160.offset; [2025-02-06 05:30:52,543 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4236: assume false; [2025-02-06 05:30:52,543 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4236: assume !false; [2025-02-06 05:30:52,543 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5129: havoc usb_control_msg_#t~nondet165#1; [2025-02-06 05:30:52,543 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5064: havoc __kfifo_out_#t~nondet152#1; [2025-02-06 05:30:52,544 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5068: havoc __kfifo_out_r_#t~nondet153#1; [2025-02-06 05:30:52,544 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4514: assume false; [2025-02-06 05:30:52,544 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4514: assume !false; [2025-02-06 05:30:52,544 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5143: havoc usb_serial_generic_open_#t~nondet167#1; [2025-02-06 05:30:52,544 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5112: havoc tty_get_baud_rate_#t~nondet162#1; [2025-02-06 05:30:52,544 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5082: havoc _raw_spin_lock_irqsave_#t~nondet158#1; [2025-02-06 05:30:52,544 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5116: havoc tty_insert_flip_string_fixed_flag_#t~nondet163#1; [2025-02-06 05:30:52,544 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4853: assume false; [2025-02-06 05:30:52,544 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4853: assume !false; [2025-02-06 05:30:52,544 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5151: havoc usb_submit_urb_#t~nondet169#1; [2025-02-06 05:30:52,544 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5122: havoc tty_port_tty_get_#t~ret164#1.base, tty_port_tty_get_#t~ret164#1.offset; [2025-02-06 05:30:52,647 INFO L? ?]: Removed 481 outVars from TransFormulas that were not future-live. [2025-02-06 05:30:52,647 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:30:52,678 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:30:52,679 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:30:52,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:30:52 BoogieIcfgContainer [2025-02-06 05:30:52,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:30:52,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:30:52,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:30:52,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:30:52,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:30:44" (1/3) ... [2025-02-06 05:30:52,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb62158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:30:52, skipping insertion in model container [2025-02-06 05:30:52,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:45" (2/3) ... [2025-02-06 05:30:52,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb62158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:30:52, skipping insertion in model container [2025-02-06 05:30:52,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:30:52" (3/3) ... [2025-02-06 05:30:52,687 INFO L128 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2025-02-06 05:30:52,699 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:30:52,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i that has 16 procedures, 401 locations, 1 initial locations, 23 loop locations, and 1 error locations. [2025-02-06 05:30:52,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:30:52,784 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;@6d06ace2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:30:52,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:30:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 337 states have (on average 1.403560830860534) internal successors, (473), 347 states have internal predecessors, (473), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-06 05:30:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 05:30:52,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:52,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:30:52,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:52,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2020459055, now seen corresponding path program 1 times [2025-02-06 05:30:52,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:52,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500562548] [2025-02-06 05:30:52,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:52,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:57,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 05:30:57,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 05:30:57,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:57,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:30:58,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:58,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500562548] [2025-02-06 05:30:58,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500562548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:58,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:30:58,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 05:30:58,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869737042] [2025-02-06 05:30:58,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:58,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 05:30:58,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:58,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 05:30:58,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 05:30:58,541 INFO L87 Difference]: Start difference. First operand has 399 states, 337 states have (on average 1.403560830860534) internal successors, (473), 347 states have internal predecessors, (473), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-02-06 05:30:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:59,139 INFO L93 Difference]: Finished difference Result 1143 states and 1620 transitions. [2025-02-06 05:30:59,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 05:30:59,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2025-02-06 05:30:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:59,156 INFO L225 Difference]: With dead ends: 1143 [2025-02-06 05:30:59,156 INFO L226 Difference]: Without dead ends: 753 [2025-02-06 05:30:59,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 05:30:59,164 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 518 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:59,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1032 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 05:30:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-02-06 05:30:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 742. [2025-02-06 05:30:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 636 states have (on average 1.3223270440251573) internal successors, (841), 644 states have internal predecessors, (841), 82 states have call successors, (82), 25 states have call predecessors, (82), 23 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2025-02-06 05:30:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1000 transitions. [2025-02-06 05:30:59,256 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1000 transitions. Word has length 18 [2025-02-06 05:30:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:59,258 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1000 transitions. [2025-02-06 05:30:59,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-02-06 05:30:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1000 transitions. [2025-02-06 05:30:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 05:30:59,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:59,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:30:59,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 05:30:59,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:59,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:59,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1790862783, now seen corresponding path program 1 times [2025-02-06 05:30:59,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:59,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866571992] [2025-02-06 05:30:59,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:59,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:03,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 05:31:03,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 05:31:03,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:03,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:31:03,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:03,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866571992] [2025-02-06 05:31:03,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866571992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:03,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:03,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 05:31:03,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589035727] [2025-02-06 05:31:03,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:03,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 05:31:03,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:03,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 05:31:03,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 05:31:03,723 INFO L87 Difference]: Start difference. First operand 742 states and 1000 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-06 05:31:03,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:03,938 INFO L93 Difference]: Finished difference Result 744 states and 1001 transitions. [2025-02-06 05:31:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 05:31:03,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2025-02-06 05:31:03,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:03,947 INFO L225 Difference]: With dead ends: 744 [2025-02-06 05:31:03,948 INFO L226 Difference]: Without dead ends: 732 [2025-02-06 05:31:03,949 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-02-06 05:31:03,949 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 510 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:03,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 505 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:31:03,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-02-06 05:31:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2025-02-06 05:31:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 630 states have (on average 1.319047619047619) internal successors, (831), 636 states have internal predecessors, (831), 79 states have call successors, (79), 24 states have call predecessors, (79), 22 states have return successors, (75), 73 states have call predecessors, (75), 75 states have call successors, (75) [2025-02-06 05:31:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 985 transitions. [2025-02-06 05:31:04,003 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 985 transitions. Word has length 19 [2025-02-06 05:31:04,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:04,004 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 985 transitions. [2025-02-06 05:31:04,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-02-06 05:31:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 985 transitions. [2025-02-06 05:31:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 05:31:04,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:31:04,009 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 05:31:04,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 05:31:04,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:31:04,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:31:04,010 INFO L85 PathProgramCache]: Analyzing trace with hash -761168523, now seen corresponding path program 1 times [2025-02-06 05:31:04,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:31:04,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2556018] [2025-02-06 05:31:04,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:31:04,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:07,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 05:31:07,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 05:31:07,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:07,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 05:31:08,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:08,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2556018] [2025-02-06 05:31:08,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2556018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:08,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:08,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:31:08,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788892118] [2025-02-06 05:31:08,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:08,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:31:08,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:08,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:31:08,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:31:08,947 INFO L87 Difference]: Start difference. First operand 732 states and 985 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:31:09,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:09,764 INFO L93 Difference]: Finished difference Result 807 states and 1067 transitions. [2025-02-06 05:31:09,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:31:09,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 81 [2025-02-06 05:31:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:09,769 INFO L225 Difference]: With dead ends: 807 [2025-02-06 05:31:09,769 INFO L226 Difference]: Without dead ends: 718 [2025-02-06 05:31:09,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:31:09,772 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 0 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:09,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1495 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 05:31:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-02-06 05:31:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2025-02-06 05:31:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 621 states have (on average 1.315619967793881) internal successors, (817), 625 states have internal predecessors, (817), 74 states have call successors, (74), 24 states have call predecessors, (74), 22 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 05:31:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 961 transitions. [2025-02-06 05:31:09,817 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 961 transitions. Word has length 81 [2025-02-06 05:31:09,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:09,817 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 961 transitions. [2025-02-06 05:31:09,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:31:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 961 transitions. [2025-02-06 05:31:09,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-06 05:31:09,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:31:09,822 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 05:31:09,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 05:31:09,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:31:09,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:31:09,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1375816596, now seen corresponding path program 1 times [2025-02-06 05:31:09,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:31:09,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336474564] [2025-02-06 05:31:09,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:31:09,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:13,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-06 05:31:13,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 05:31:13,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:13,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:31:14,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:14,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336474564] [2025-02-06 05:31:14,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336474564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:14,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:14,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 05:31:14,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631938695] [2025-02-06 05:31:14,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:14,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 05:31:14,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:14,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 05:31:14,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:31:14,659 INFO L87 Difference]: Start difference. First operand 718 states and 961 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:31:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:15,692 INFO L93 Difference]: Finished difference Result 1100 states and 1474 transitions. [2025-02-06 05:31:15,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 05:31:15,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 79 [2025-02-06 05:31:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:15,700 INFO L225 Difference]: With dead ends: 1100 [2025-02-06 05:31:15,700 INFO L226 Difference]: Without dead ends: 732 [2025-02-06 05:31:15,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:31:15,706 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 0 mSDsluCounter, 2493 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2993 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:15,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2993 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 05:31:15,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-02-06 05:31:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2025-02-06 05:31:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 631 states have (on average 1.3106180665610143) internal successors, (827), 635 states have internal predecessors, (827), 74 states have call successors, (74), 24 states have call predecessors, (74), 26 states have return successors, (78), 74 states have call predecessors, (78), 70 states have call successors, (78) [2025-02-06 05:31:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 979 transitions. [2025-02-06 05:31:15,749 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 979 transitions. Word has length 79 [2025-02-06 05:31:15,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:15,754 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 979 transitions. [2025-02-06 05:31:15,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:31:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 979 transitions. [2025-02-06 05:31:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-06 05:31:15,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:31:15,757 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 05:31:15,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 05:31:15,757 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:31:15,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:31:15,758 INFO L85 PathProgramCache]: Analyzing trace with hash 675167402, now seen corresponding path program 1 times [2025-02-06 05:31:15,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:31:15,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431751889] [2025-02-06 05:31:15,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:31:15,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:19,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-06 05:31:19,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 05:31:19,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:19,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:31:20,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:20,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431751889] [2025-02-06 05:31:20,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431751889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:20,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:20,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 05:31:20,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902572167] [2025-02-06 05:31:20,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:20,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 05:31:20,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:20,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 05:31:20,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:31:20,772 INFO L87 Difference]: Start difference. First operand 732 states and 979 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:31:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:22,503 INFO L93 Difference]: Finished difference Result 786 states and 1041 transitions. [2025-02-06 05:31:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 05:31:22,503 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 79 [2025-02-06 05:31:22,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:22,506 INFO L225 Difference]: With dead ends: 786 [2025-02-06 05:31:22,506 INFO L226 Difference]: Without dead ends: 411 [2025-02-06 05:31:22,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:31:22,508 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 17 mSDsluCounter, 3354 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3838 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:22,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3838 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 05:31:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-06 05:31:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2025-02-06 05:31:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 348 states have (on average 1.2959770114942528) internal successors, (451), 351 states have internal predecessors, (451), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (43), 41 states have call predecessors, (43), 39 states have call successors, (43) [2025-02-06 05:31:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 536 transitions. [2025-02-06 05:31:22,532 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 536 transitions. Word has length 79 [2025-02-06 05:31:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:22,534 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 536 transitions. [2025-02-06 05:31:22,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 05:31:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 536 transitions. [2025-02-06 05:31:22,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 05:31:22,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:31:22,536 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 05:31:22,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 05:31:22,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:31:22,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:31:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash 230668085, now seen corresponding path program 1 times [2025-02-06 05:31:22,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:31:22,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528644116] [2025-02-06 05:31:22,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:31:22,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:26,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 05:31:26,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 05:31:26,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:26,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 05:31:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:27,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528644116] [2025-02-06 05:31:27,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528644116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:27,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:27,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:31:27,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295019868] [2025-02-06 05:31:27,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:27,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:31:27,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:27,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:31:27,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:31:27,131 INFO L87 Difference]: Start difference. First operand 409 states and 536 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 05:31:31,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:31:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:32,962 INFO L93 Difference]: Finished difference Result 409 states and 536 transitions. [2025-02-06 05:31:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:31:32,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 81 [2025-02-06 05:31:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:32,964 INFO L225 Difference]: With dead ends: 409 [2025-02-06 05:31:32,964 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 05:31:32,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:31:32,965 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 481 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:32,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 937 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-02-06 05:31:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 05:31:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 05:31:32,966 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-02-06 05:31:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 05:31:32,967 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2025-02-06 05:31:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:32,967 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 05:31:32,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 05:31:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 05:31:32,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 05:31:32,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 05:31:32,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 05:31:32,973 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 05:31:32,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 05:31:44,014 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 05:31:44,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 05:31:44 BoogieIcfgContainer [2025-02-06 05:31:44,030 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 05:31:44,031 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 05:31:44,031 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 05:31:44,031 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 05:31:44,032 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:30:52" (3/4) ... [2025-02-06 05:31:44,034 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 05:31:44,040 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ir_xbof_change [2025-02-06 05:31:44,041 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ir_init [2025-02-06 05:31:44,041 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kfree [2025-02-06 05:31:44,041 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2025-02-06 05:31:44,041 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __kfifo_uint_must_check_helper [2025-02-06 05:31:44,041 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-02-06 05:31:44,041 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2025-02-06 05:31:44,042 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2025-02-06 05:31:44,042 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure dev_err [2025-02-06 05:31:44,042 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-02-06 05:31:44,042 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ir_exit [2025-02-06 05:31:44,042 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_serial_deregister [2025-02-06 05:31:44,042 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2025-02-06 05:31:44,043 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kmalloc [2025-02-06 05:31:44,043 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2025-02-06 05:31:44,069 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 160 nodes and edges [2025-02-06 05:31:44,074 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2025-02-06 05:31:44,077 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2025-02-06 05:31:44,080 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-06 05:31:44,082 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 05:31:44,084 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 05:31:44,086 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 05:31:44,087 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 05:31:44,134 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_coherent_state == 0) && (1 <= ldv_urb_state)) && (1 <= \old(ldv_urb_state))) [2025-02-06 05:31:44,353 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_coherent_state == 0) && (1 <= ldv_urb_state)) && (1 <= \old(ldv_urb_state))) [2025-02-06 05:31:44,428 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 05:31:44,429 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 05:31:44,429 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 05:31:44,430 INFO L158 Benchmark]: Toolchain (without parser) took 60235.98ms. Allocated memory was 201.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 148.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 366.9MB. Max. memory is 16.1GB. [2025-02-06 05:31:44,430 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 05:31:44,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1296.83ms. Allocated memory is still 201.3MB. Free memory was 148.0MB in the beginning and 55.8MB in the end (delta: 92.2MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2025-02-06 05:31:44,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 158.73ms. Allocated memory is still 201.3MB. Free memory was 55.8MB in the beginning and 137.8MB in the end (delta: -82.0MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2025-02-06 05:31:44,431 INFO L158 Benchmark]: Boogie Preprocessor took 253.65ms. Allocated memory is still 201.3MB. Free memory was 137.8MB in the beginning and 114.7MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 05:31:44,431 INFO L158 Benchmark]: IcfgBuilder took 6772.64ms. Allocated memory is still 201.3MB. Free memory was 114.7MB in the beginning and 58.5MB in the end (delta: 56.3MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. [2025-02-06 05:31:44,432 INFO L158 Benchmark]: TraceAbstraction took 51348.99ms. Allocated memory was 201.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 58.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 220.3MB. Max. memory is 16.1GB. [2025-02-06 05:31:44,432 INFO L158 Benchmark]: Witness Printer took 398.18ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.6GB in the end (delta: 50.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-06 05:31:44,433 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.98ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1296.83ms. Allocated memory is still 201.3MB. Free memory was 148.0MB in the beginning and 55.8MB in the end (delta: 92.2MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 158.73ms. Allocated memory is still 201.3MB. Free memory was 55.8MB in the beginning and 137.8MB in the end (delta: -82.0MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 253.65ms. Allocated memory is still 201.3MB. Free memory was 137.8MB in the beginning and 114.7MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 6772.64ms. Allocated memory is still 201.3MB. Free memory was 114.7MB in the beginning and 58.5MB in the end (delta: 56.3MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. * TraceAbstraction took 51348.99ms. Allocated memory was 201.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 58.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 220.3MB. Max. memory is 16.1GB. * Witness Printer took 398.18ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.6GB in the end (delta: 50.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * 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: 4912]: 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 16 procedures, 401 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.2s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1531 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1526 mSDsluCounter, 10800 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7748 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 482 IncrementalHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 3052 mSDtfsCounter, 482 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=742occurred in iteration=1, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 351 ConstructedInterpolants, 0 QuantifiedInterpolants, 541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 14/14 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: 4823]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 4037]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 5017]: Location Invariant Derived location invariant: (((ldv_coherent_state == 0) && (1 <= ldv_urb_state)) && (1 <= \old(ldv_urb_state))) - InvariantResult [Line: 3897]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 3957]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 4013]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 3942]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 3927]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 4992]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 4336]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 4151]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 3867]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 3852]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 3912]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 3629]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 4294]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 4278]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 3822]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 3837]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 4333]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 3997]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 3882]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 4469]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) RESULT: Ultimate proved your program to be correct! [2025-02-06 05:31:44,547 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