./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_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-net-can-usb-ems_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 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:30:35,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:30:35,552 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:35,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:30:35,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:30:35,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:30:35,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:30:35,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:30:35,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:30:35,582 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:30:35,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:30:35,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:30:35,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:30:35,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:30:35,583 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:30:35,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:30:35,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:30:35,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:30:35,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:30:35,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:30:35,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:30:35,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:30:35,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:30:35,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:30:35,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:30:35,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:30:35,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:30:35,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:30:35,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:30:35,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:30:35,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:30:35,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:30:35,585 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:30:35,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:30:35,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:30:35,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:30:35,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:30:35,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:30:35,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:30:35,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:30:35,586 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 -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2025-02-06 05:30:35,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:30:35,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:30:35,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:30:35,886 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:30:35,886 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:30:35,887 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-net-can-usb-ems_usb.ko.cil.out.i [2025-02-06 05:30:37,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89b512e60/a00773793c8b46d4a656aeeefe9600ef/FLAGb9e9809bc [2025-02-06 05:30:37,567 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:30:37,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2025-02-06 05:30:37,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89b512e60/a00773793c8b46d4a656aeeefe9600ef/FLAGb9e9809bc [2025-02-06 05:30:37,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89b512e60/a00773793c8b46d4a656aeeefe9600ef [2025-02-06 05:30:37,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:30:37,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:30:37,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:30:37,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:30:37,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:30:37,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:30:37" (1/1) ... [2025-02-06 05:30:37,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311b1625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:37, skipping insertion in model container [2025-02-06 05:30:37,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:30:37" (1/1) ... [2025-02-06 05:30:37,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:30:38,607 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-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2025-02-06 05:30:38,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:30:38,682 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:30:38,799 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4831-4837] [2025-02-06 05:30:38,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4844-4850] [2025-02-06 05:30:38,803 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "btr %2,%1\n\t" "sbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4857-4864] [2025-02-06 05:30:38,804 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "incl %0": "+m" (v->counter)); [4894-4900] [2025-02-06 05:30:38,804 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "decl %0": "+m" (v->counter)); [4907-4913] [2025-02-06 05:30:38,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n" ".pushsection __bug_table,\"a\"\n" "2:\t.long 1b - 2b, %c0 - 2b\n" "\t.word %c1, 0\n" "\t.org 2b+%c2\n" ".popsection": : "i" ("/anthill/stuff/tacas-comp/work/current--X--drivers/net/can/usb/ems_usb.ko--X--bulklinux-3.0.1--X--68_1/linux-3.0.1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/68_1/drivers/net/can/usb/ems_usb.c.common.c"), "i" (510), "i" (sizeof(struct bug_entry ))); [5717-5723] [2025-02-06 05:30:38,928 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-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2025-02-06 05:30:38,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:30:39,117 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:30:39,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:39 WrapperNode [2025-02-06 05:30:39,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:30:39,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:30:39,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:30:39,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:30:39,123 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:39" (1/1) ... [2025-02-06 05:30:39,166 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:39" (1/1) ... [2025-02-06 05:30:39,233 INFO L138 Inliner]: procedures = 132, calls = 778, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1635 [2025-02-06 05:30:39,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:30:39,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:30:39,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:30:39,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:30:39,242 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:39" (1/1) ... [2025-02-06 05:30:39,243 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:39" (1/1) ... [2025-02-06 05:30:39,264 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:39" (1/1) ... [2025-02-06 05:30:39,378 INFO L175 MemorySlicer]: Split 342 memory accesses to 8 slices as follows [2, 3, 8, 8, 8, 10, 261, 42]. 76 percent of accesses are in the largest equivalence class. The 34 initializations are split as follows [2, 0, 8, 8, 8, 0, 8, 0]. The 214 writes are split as follows [0, 0, 0, 0, 0, 0, 172, 42]. [2025-02-06 05:30:39,378 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:39" (1/1) ... [2025-02-06 05:30:39,378 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:39" (1/1) ... [2025-02-06 05:30:39,433 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:39" (1/1) ... [2025-02-06 05:30:39,437 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:39" (1/1) ... [2025-02-06 05:30:39,444 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:39" (1/1) ... [2025-02-06 05:30:39,453 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:39" (1/1) ... [2025-02-06 05:30:39,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:30:39,474 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:30:39,474 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:30:39,474 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:30:39,475 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:39" (1/1) ... [2025-02-06 05:30:39,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:30:39,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:30:39,512 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:39,521 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:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-02-06 05:30:39,545 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-02-06 05:30:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2025-02-06 05:30:39,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2025-02-06 05:30:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 05:30:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 05:30:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 05:30:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 05:30:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 05:30:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 05:30:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 05:30:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 05:30:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2025-02-06 05:30:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2025-02-06 05:30:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-06 05:30:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-06 05:30:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-06 05:30:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-06 05:30:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-06 05:30:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-06 05:30:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-06 05:30:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-06 05:30:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 05:30:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 05:30:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 05:30:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 05:30:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-02-06 05:30:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2025-02-06 05:30:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-02-06 05:30:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 05:30:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2025-02-06 05:30:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2025-02-06 05:30:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 05:30:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2025-02-06 05:30:39,547 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 05:30:39,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2025-02-06 05:30:39,548 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2025-02-06 05:30:39,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2025-02-06 05:30:39,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-02-06 05:30:39,548 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2025-02-06 05:30:39,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2025-02-06 05:30:39,548 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-02-06 05:30:39,548 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2025-02-06 05:30:39,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-02-06 05:30:39,548 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-02-06 05:30:39,548 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2025-02-06 05:30:39,549 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2025-02-06 05:30:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 05:30:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 05:30:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 05:30:39,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 05:30:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 05:30:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 05:30:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 05:30:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 05:30:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2025-02-06 05:30:39,551 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2025-02-06 05:30:39,551 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-02-06 05:30:39,551 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-02-06 05:30:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2025-02-06 05:30:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 05:30:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-02-06 05:30:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-02-06 05:30:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2025-02-06 05:30:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-02-06 05:30:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-02-06 05:30:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-02-06 05:30:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-02-06 05:30:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2025-02-06 05:30:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2025-02-06 05:30:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2025-02-06 05:30:39,552 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 05:30:39,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 05:30:39,553 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2025-02-06 05:30:39,553 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2025-02-06 05:30:39,553 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2025-02-06 05:30:39,553 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2025-02-06 05:30:39,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-06 05:30:39,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-06 05:30:39,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-06 05:30:39,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-06 05:30:39,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-06 05:30:39,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-06 05:30:39,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-06 05:30:39,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-06 05:30:39,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:30:39,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:30:39,854 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:30:39,859 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:30:39,898 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7025: havoc usb_register_driver_#t~nondet398#1; [2025-02-06 05:30:39,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7029: havoc #t~nondet399; [2025-02-06 05:30:39,918 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5809: call ULTIMATE.dealloc(~#cmd~0.base, ~#cmd~0.offset);havoc ~#cmd~0.base, ~#cmd~0.offset; [2025-02-06 05:30:39,958 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5248: havoc #t~mem35;havoc #t~bitwise36; [2025-02-06 05:30:39,970 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6912: havoc #t~malloc381.base, #t~malloc381.offset; [2025-02-06 05:30:40,014 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint init_usb_anchorFINAL: assume true; [2025-02-06 05:30:40,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2025-02-06 05:30:40,156 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5780: call ULTIMATE.dealloc(~#actual_length~0#1.base, ~#actual_length~0#1.offset);havoc ~#actual_length~0#1.base, ~#actual_length~0#1.offset; [2025-02-06 05:30:40,156 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7015: havoc usb_bulk_msg_#t~nondet397#1; [2025-02-06 05:30:40,173 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint unlink_all_urbsFINAL: assume true; [2025-02-06 05:30:40,173 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7036: havoc usb_unlink_urb_#t~nondet400#1; [2025-02-06 05:30:40,191 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint usb_free_coherentFINAL: assume true; [2025-02-06 05:30:40,220 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint usb_free_urbFINAL: assume true; [2025-02-06 05:30:40,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7001: havoc #t~nondet395; [2025-02-06 05:30:40,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6956: havoc #t~nondet387; [2025-02-06 05:30:40,249 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6915: havoc __kmalloc_#t~ret382#1.base, __kmalloc_#t~ret382#1.offset; [2025-02-06 05:30:40,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6963: havoc dev_set_drvdata_#t~nondet389#1; [2025-02-06 05:30:40,265 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4970: havoc #t~mem10.base, #t~mem10.offset; [2025-02-06 05:30:40,268 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6982: havoc #t~ret391.base, #t~ret391.offset; [2025-02-06 05:30:40,273 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6967: havoc #t~nondet390; [2025-02-06 05:30:45,538 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7005: havoc register_candev_#t~nondet396#1; [2025-02-06 05:30:45,539 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6959: havoc dev_get_drvdata_#t~ret388#1.base, dev_get_drvdata_#t~ret388#1.offset; [2025-02-06 05:30:45,539 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4881: havoc atomic_read_#t~mem4#1; [2025-02-06 05:30:45,539 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6997: havoc open_candev_#t~nondet394#1; [2025-02-06 05:30:45,539 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6934: havoc alloc_candev_#t~ret386#1.base, alloc_candev_#t~ret386#1.offset; [2025-02-06 05:30:45,539 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6673: assume false; [2025-02-06 05:30:45,539 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6673: assume !false; [2025-02-06 05:30:45,665 INFO L? ?]: Removed 597 outVars from TransFormulas that were not future-live. [2025-02-06 05:30:45,665 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:30:45,689 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:30:45,690 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:30:45,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:30:45 BoogieIcfgContainer [2025-02-06 05:30:45,690 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:30:45,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:30:45,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:30:45,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:30:45,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:30:37" (1/3) ... [2025-02-06 05:30:45,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4f50b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:30:45, skipping insertion in model container [2025-02-06 05:30:45,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:30:39" (2/3) ... [2025-02-06 05:30:45,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4f50b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:30:45, skipping insertion in model container [2025-02-06 05:30:45,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:30:45" (3/3) ... [2025-02-06 05:30:45,698 INFO L128 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2025-02-06 05:30:45,709 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:30:45,710 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i that has 39 procedures, 519 locations, 1 initial locations, 16 loop locations, and 1 error locations. [2025-02-06 05:30:45,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:30:45,805 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;@659aaae8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:30:45,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:30:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 514 states, 363 states have (on average 1.3140495867768596) internal successors, (477), 375 states have internal predecessors, (477), 112 states have call successors, (112), 38 states have call predecessors, (112), 33 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-06 05:30:45,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 05:30:45,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:45,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:30:45,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:45,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:45,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1344637608, now seen corresponding path program 1 times [2025-02-06 05:30:45,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:45,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042843896] [2025-02-06 05:30:45,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:45,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:48,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 05:30:48,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 05:30:48,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:48,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:49,248 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:49,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:49,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042843896] [2025-02-06 05:30:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042843896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:49,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:30:49,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:30:49,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915683932] [2025-02-06 05:30:49,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:49,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:30:49,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:49,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:30:49,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:30:49,274 INFO L87 Difference]: Start difference. First operand has 514 states, 363 states have (on average 1.3140495867768596) internal successors, (477), 375 states have internal predecessors, (477), 112 states have call successors, (112), 38 states have call predecessors, (112), 33 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 05:30:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:49,672 INFO L93 Difference]: Finished difference Result 832 states and 1108 transitions. [2025-02-06 05:30:49,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:30:49,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-02-06 05:30:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:49,685 INFO L225 Difference]: With dead ends: 832 [2025-02-06 05:30:49,685 INFO L226 Difference]: Without dead ends: 367 [2025-02-06 05:30:49,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:30:49,692 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 0 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:49,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2085 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:30:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-02-06 05:30:49,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2025-02-06 05:30:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 267 states have (on average 1.2659176029962547) internal successors, (338), 278 states have internal predecessors, (338), 72 states have call successors, (72), 29 states have call predecessors, (72), 27 states have return successors, (62), 61 states have call predecessors, (62), 61 states have call successors, (62) [2025-02-06 05:30:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 472 transitions. [2025-02-06 05:30:49,742 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 472 transitions. Word has length 21 [2025-02-06 05:30:49,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:49,743 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 472 transitions. [2025-02-06 05:30:49,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 05:30:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 472 transitions. [2025-02-06 05:30:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 05:30:49,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:49,744 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] [2025-02-06 05:30:49,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 05:30:49,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:49,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:49,745 INFO L85 PathProgramCache]: Analyzing trace with hash 131661629, now seen corresponding path program 1 times [2025-02-06 05:30:49,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:49,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598427829] [2025-02-06 05:30:49,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:49,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:51,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 05:30:51,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 05:30:51,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:51,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 05:30:51,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:51,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598427829] [2025-02-06 05:30:51,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598427829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:51,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:30:51,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 05:30:51,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821954839] [2025-02-06 05:30:51,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:51,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 05:30:51,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:51,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 05:30:51,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 05:30:51,821 INFO L87 Difference]: Start difference. First operand 367 states and 472 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 05:30:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:51,997 INFO L93 Difference]: Finished difference Result 714 states and 921 transitions. [2025-02-06 05:30:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 05:30:51,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-02-06 05:30:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:52,004 INFO L225 Difference]: With dead ends: 714 [2025-02-06 05:30:52,004 INFO L226 Difference]: Without dead ends: 711 [2025-02-06 05:30:52,004 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:30:52,005 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 458 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:52,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1064 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:30:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-02-06 05:30:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 677. [2025-02-06 05:30:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 498 states have (on average 1.2791164658634537) internal successors, (637), 514 states have internal predecessors, (637), 127 states have call successors, (127), 53 states have call predecessors, (127), 51 states have return successors, (119), 111 states have call predecessors, (119), 116 states have call successors, (119) [2025-02-06 05:30:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 883 transitions. [2025-02-06 05:30:52,052 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 883 transitions. Word has length 26 [2025-02-06 05:30:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:52,053 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 883 transitions. [2025-02-06 05:30:52,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 05:30:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 883 transitions. [2025-02-06 05:30:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 05:30:52,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:52,054 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] [2025-02-06 05:30:52,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 05:30:52,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:52,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:52,054 INFO L85 PathProgramCache]: Analyzing trace with hash -214008906, now seen corresponding path program 1 times [2025-02-06 05:30:52,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:52,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394375566] [2025-02-06 05:30:52,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:52,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:53,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 05:30:53,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 05:30:53,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:53,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 05:30:53,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:53,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394375566] [2025-02-06 05:30:53,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394375566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:53,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:30:53,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 05:30:53,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922031607] [2025-02-06 05:30:53,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:53,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 05:30:53,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:53,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 05:30:53,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 05:30:53,819 INFO L87 Difference]: Start difference. First operand 677 states and 883 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 05:30:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:53,958 INFO L93 Difference]: Finished difference Result 919 states and 1183 transitions. [2025-02-06 05:30:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 05:30:53,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-02-06 05:30:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:53,963 INFO L225 Difference]: With dead ends: 919 [2025-02-06 05:30:53,963 INFO L226 Difference]: Without dead ends: 908 [2025-02-06 05:30:53,963 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:30:53,964 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 457 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:53,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 763 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:30:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-02-06 05:30:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 769. [2025-02-06 05:30:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 568 states have (on average 1.2746478873239437) internal successors, (724), 587 states have internal predecessors, (724), 140 states have call successors, (140), 61 states have call predecessors, (140), 60 states have return successors, (136), 121 states have call predecessors, (136), 130 states have call successors, (136) [2025-02-06 05:30:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1000 transitions. [2025-02-06 05:30:53,991 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1000 transitions. Word has length 27 [2025-02-06 05:30:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:53,991 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1000 transitions. [2025-02-06 05:30:53,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 05:30:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1000 transitions. [2025-02-06 05:30:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-06 05:30:53,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:53,995 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:30:53,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 05:30:53,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:53,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:53,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2124010396, now seen corresponding path program 1 times [2025-02-06 05:30:53,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:53,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870948705] [2025-02-06 05:30:53,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:53,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:55,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-06 05:30:55,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-06 05:30:55,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:55,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:56,068 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:30:56,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:56,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870948705] [2025-02-06 05:30:56,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870948705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:56,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:30:56,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:30:56,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748492076] [2025-02-06 05:30:56,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:56,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:30:56,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:56,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:30:56,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:30:56,069 INFO L87 Difference]: Start difference. First operand 769 states and 1000 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:30:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:56,221 INFO L93 Difference]: Finished difference Result 1526 states and 1987 transitions. [2025-02-06 05:30:56,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:30:56,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-02-06 05:30:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:56,225 INFO L225 Difference]: With dead ends: 1526 [2025-02-06 05:30:56,225 INFO L226 Difference]: Without dead ends: 773 [2025-02-06 05:30:56,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:30:56,227 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 0 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:56,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1351 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 05:30:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-02-06 05:30:56,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2025-02-06 05:30:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 572 states have (on average 1.2727272727272727) internal successors, (728), 591 states have internal predecessors, (728), 140 states have call successors, (140), 61 states have call predecessors, (140), 60 states have return successors, (136), 121 states have call predecessors, (136), 130 states have call successors, (136) [2025-02-06 05:30:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1004 transitions. [2025-02-06 05:30:56,273 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1004 transitions. Word has length 79 [2025-02-06 05:30:56,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:56,273 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1004 transitions. [2025-02-06 05:30:56,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:30:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1004 transitions. [2025-02-06 05:30:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 05:30:56,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:56,278 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] [2025-02-06 05:30:56,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 05:30:56,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:56,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash -427638302, now seen corresponding path program 1 times [2025-02-06 05:30:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:56,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894274559] [2025-02-06 05:30:56,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:56,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:30:58,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 05:30:58,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 05:30:58,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:30:58,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:30:58,597 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:30:58,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:30:58,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894274559] [2025-02-06 05:30:58,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894274559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:30:58,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:30:58,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 05:30:58,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994703378] [2025-02-06 05:30:58,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:30:58,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 05:30:58,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:30:58,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 05:30:58,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 05:30:58,599 INFO L87 Difference]: Start difference. First operand 773 states and 1004 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:30:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:30:59,053 INFO L93 Difference]: Finished difference Result 1534 states and 1995 transitions. [2025-02-06 05:30:59,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 05:30:59,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2025-02-06 05:30:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:30:59,059 INFO L225 Difference]: With dead ends: 1534 [2025-02-06 05:30:59,059 INFO L226 Difference]: Without dead ends: 777 [2025-02-06 05:30:59,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 05:30:59,062 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 0 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 05:30:59,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2243 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 05:30:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-02-06 05:30:59,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 777. [2025-02-06 05:30:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 576 states have (on average 1.2708333333333333) internal successors, (732), 595 states have internal predecessors, (732), 140 states have call successors, (140), 61 states have call predecessors, (140), 60 states have return successors, (136), 121 states have call predecessors, (136), 130 states have call successors, (136) [2025-02-06 05:30:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1008 transitions. [2025-02-06 05:30:59,095 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1008 transitions. Word has length 80 [2025-02-06 05:30:59,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:30:59,096 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1008 transitions. [2025-02-06 05:30:59,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:30:59,096 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1008 transitions. [2025-02-06 05:30:59,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 05:30:59,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:30:59,098 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] [2025-02-06 05:30:59,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 05:30:59,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:30:59,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:30:59,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1030029539, now seen corresponding path program 1 times [2025-02-06 05:30:59,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:30:59,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514796663] [2025-02-06 05:30:59,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:30:59,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:00,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 05:31:00,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 05:31:00,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:00,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:01,251 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:01,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:01,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514796663] [2025-02-06 05:31:01,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514796663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:01,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:01,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 05:31:01,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274338618] [2025-02-06 05:31:01,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:01,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 05:31:01,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:01,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 05:31:01,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:31:01,253 INFO L87 Difference]: Start difference. First operand 777 states and 1008 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:31:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:01,516 INFO L93 Difference]: Finished difference Result 1243 states and 1615 transitions. [2025-02-06 05:31:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 05:31:01,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2025-02-06 05:31:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:01,520 INFO L225 Difference]: With dead ends: 1243 [2025-02-06 05:31:01,520 INFO L226 Difference]: Without dead ends: 791 [2025-02-06 05:31:01,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:31:01,521 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 0 mSDsluCounter, 2261 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:01,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2714 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:31:01,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-02-06 05:31:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2025-02-06 05:31:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 586 states have (on average 1.266211604095563) internal successors, (742), 605 states have internal predecessors, (742), 140 states have call successors, (140), 61 states have call predecessors, (140), 64 states have return successors, (146), 125 states have call predecessors, (146), 130 states have call successors, (146) [2025-02-06 05:31:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1028 transitions. [2025-02-06 05:31:01,544 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1028 transitions. Word has length 80 [2025-02-06 05:31:01,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:01,545 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1028 transitions. [2025-02-06 05:31:01,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:31:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1028 transitions. [2025-02-06 05:31:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 05:31:01,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:31:01,546 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:31:01,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 05:31:01,547 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:31:01,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:31:01,547 INFO L85 PathProgramCache]: Analyzing trace with hash 842311879, now seen corresponding path program 1 times [2025-02-06 05:31:01,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:31:01,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965422628] [2025-02-06 05:31:01,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:31:01,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:03,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 05:31:03,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 05:31:03,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:03,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 05:31:03,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:03,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965422628] [2025-02-06 05:31:03,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965422628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:03,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:03,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:31:03,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072230608] [2025-02-06 05:31:03,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:03,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:31:03,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:03,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:31:03,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:31:03,488 INFO L87 Difference]: Start difference. First operand 791 states and 1028 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:31:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:03,723 INFO L93 Difference]: Finished difference Result 1048 states and 1322 transitions. [2025-02-06 05:31:03,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:31:03,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2025-02-06 05:31:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:03,727 INFO L225 Difference]: With dead ends: 1048 [2025-02-06 05:31:03,727 INFO L226 Difference]: Without dead ends: 741 [2025-02-06 05:31:03,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:31:03,729 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 0 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:03,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1801 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:31:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-02-06 05:31:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2025-02-06 05:31:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 546 states have (on average 1.2545787545787546) internal successors, (685), 562 states have internal predecessors, (685), 130 states have call successors, (130), 60 states have call predecessors, (130), 64 states have return successors, (137), 119 states have call predecessors, (137), 120 states have call successors, (137) [2025-02-06 05:31:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 952 transitions. [2025-02-06 05:31:03,752 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 952 transitions. Word has length 85 [2025-02-06 05:31:03,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:03,752 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 952 transitions. [2025-02-06 05:31:03,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:31:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 952 transitions. [2025-02-06 05:31:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 05:31:03,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:31:03,754 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] [2025-02-06 05:31:03,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 05:31:03,754 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:31:03,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:31:03,754 INFO L85 PathProgramCache]: Analyzing trace with hash 670241, now seen corresponding path program 1 times [2025-02-06 05:31:03,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:31:03,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779705218] [2025-02-06 05:31:03,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:31:03,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:05,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 05:31:05,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 05:31:05,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:05,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:06,076 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:06,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:06,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779705218] [2025-02-06 05:31:06,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779705218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:06,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:06,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 05:31:06,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879847805] [2025-02-06 05:31:06,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:06,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 05:31:06,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:06,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 05:31:06,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 05:31:06,078 INFO L87 Difference]: Start difference. First operand 741 states and 952 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:31:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:06,913 INFO L93 Difference]: Finished difference Result 1463 states and 1887 transitions. [2025-02-06 05:31:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 05:31:06,913 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2025-02-06 05:31:06,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:06,919 INFO L225 Difference]: With dead ends: 1463 [2025-02-06 05:31:06,919 INFO L226 Difference]: Without dead ends: 741 [2025-02-06 05:31:06,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 05:31:06,921 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 51 mSDsluCounter, 3587 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:06,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 4045 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 05:31:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-02-06 05:31:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 739. [2025-02-06 05:31:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 544 states have (on average 1.25) internal successors, (680), 561 states have internal predecessors, (680), 130 states have call successors, (130), 60 states have call predecessors, (130), 64 states have return successors, (137), 118 states have call predecessors, (137), 120 states have call successors, (137) [2025-02-06 05:31:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 947 transitions. [2025-02-06 05:31:06,946 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 947 transitions. Word has length 80 [2025-02-06 05:31:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:06,946 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 947 transitions. [2025-02-06 05:31:06,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:31:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 947 transitions. [2025-02-06 05:31:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 05:31:06,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:31:06,948 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:31:06,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 05:31:06,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:31:06,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:31:06,949 INFO L85 PathProgramCache]: Analyzing trace with hash -589996795, now seen corresponding path program 1 times [2025-02-06 05:31:06,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:31:06,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449021072] [2025-02-06 05:31:06,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:31:06,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:08,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 05:31:08,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 05:31:08,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:08,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 05:31:09,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:09,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449021072] [2025-02-06 05:31:09,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449021072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:09,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:09,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 05:31:09,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545309517] [2025-02-06 05:31:09,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:09,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 05:31:09,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:09,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 05:31:09,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:31:09,388 INFO L87 Difference]: Start difference. First operand 739 states and 947 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 05:31:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:09,669 INFO L93 Difference]: Finished difference Result 882 states and 1122 transitions. [2025-02-06 05:31:09,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 05:31:09,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 85 [2025-02-06 05:31:09,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:09,673 INFO L225 Difference]: With dead ends: 882 [2025-02-06 05:31:09,673 INFO L226 Difference]: Without dead ends: 743 [2025-02-06 05:31:09,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:31:09,675 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 0 mSDsluCounter, 2267 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:09,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2722 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:31:09,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-02-06 05:31:09,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2025-02-06 05:31:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 548 states have (on average 1.2481751824817517) internal successors, (684), 563 states have internal predecessors, (684), 130 states have call successors, (130), 60 states have call predecessors, (130), 64 states have return successors, (137), 120 states have call predecessors, (137), 120 states have call successors, (137) [2025-02-06 05:31:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 951 transitions. [2025-02-06 05:31:09,697 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 951 transitions. Word has length 85 [2025-02-06 05:31:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:09,698 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 951 transitions. [2025-02-06 05:31:09,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 05:31:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 951 transitions. [2025-02-06 05:31:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 05:31:09,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:31:09,700 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:31:09,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 05:31:09,700 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:31:09,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:31:09,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1404147911, now seen corresponding path program 1 times [2025-02-06 05:31:09,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:31:09,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872957014] [2025-02-06 05:31:09,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:31:09,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:11,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 05:31:11,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 05:31:11,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:11,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 05:31:11,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:11,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872957014] [2025-02-06 05:31:11,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872957014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:11,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:11,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 05:31:11,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012904154] [2025-02-06 05:31:11,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:11,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 05:31:11,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:11,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 05:31:11,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 05:31:11,819 INFO L87 Difference]: Start difference. First operand 743 states and 951 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-06 05:31:15,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:31:19,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:31:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:25,026 INFO L93 Difference]: Finished difference Result 813 states and 1025 transitions. [2025-02-06 05:31:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:31:25,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 85 [2025-02-06 05:31:25,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:25,038 INFO L225 Difference]: With dead ends: 813 [2025-02-06 05:31:25,038 INFO L226 Difference]: Without dead ends: 747 [2025-02-06 05:31:25,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:31:25,039 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 803 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 94 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:25,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1476 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 771 Invalid, 2 Unknown, 0 Unchecked, 13.0s Time] [2025-02-06 05:31:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-02-06 05:31:25,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 733. [2025-02-06 05:31:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 544 states have (on average 1.2316176470588236) internal successors, (670), 552 states have internal predecessors, (670), 123 states have call successors, (123), 61 states have call predecessors, (123), 65 states have return successors, (132), 119 states have call predecessors, (132), 115 states have call successors, (132) [2025-02-06 05:31:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 925 transitions. [2025-02-06 05:31:25,083 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 925 transitions. Word has length 85 [2025-02-06 05:31:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:25,083 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 925 transitions. [2025-02-06 05:31:25,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-06 05:31:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 925 transitions. [2025-02-06 05:31:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 05:31:25,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:31:25,086 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:31:25,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 05:31:25,086 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:31:25,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:31:25,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1096215845, now seen corresponding path program 1 times [2025-02-06 05:31:25,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:31:25,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197968714] [2025-02-06 05:31:25,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:31:25,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:26,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 05:31:26,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 05:31:26,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:26,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 05:31:27,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:27,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197968714] [2025-02-06 05:31:27,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197968714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:27,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:27,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:31:27,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481163477] [2025-02-06 05:31:27,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:27,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:31:27,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:27,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:31:27,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:31:27,265 INFO L87 Difference]: Start difference. First operand 733 states and 925 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 05:31:27,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:27,562 INFO L93 Difference]: Finished difference Result 880 states and 1079 transitions. [2025-02-06 05:31:27,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:31:27,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-02-06 05:31:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:27,566 INFO L225 Difference]: With dead ends: 880 [2025-02-06 05:31:27,566 INFO L226 Difference]: Without dead ends: 641 [2025-02-06 05:31:27,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:31:27,568 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 0 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:27,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1622 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:31:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-02-06 05:31:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2025-02-06 05:31:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 481 states have (on average 1.237006237006237) internal successors, (595), 484 states have internal predecessors, (595), 105 states have call successors, (105), 50 states have call predecessors, (105), 54 states have return successors, (115), 106 states have call predecessors, (115), 100 states have call successors, (115) [2025-02-06 05:31:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 815 transitions. [2025-02-06 05:31:27,587 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 815 transitions. Word has length 105 [2025-02-06 05:31:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:27,587 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 815 transitions. [2025-02-06 05:31:27,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 05:31:27,587 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 815 transitions. [2025-02-06 05:31:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-06 05:31:27,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:31:27,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:31:27,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 05:31:27,590 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:31:27,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:31:27,590 INFO L85 PathProgramCache]: Analyzing trace with hash 276048867, now seen corresponding path program 1 times [2025-02-06 05:31:27,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:31:27,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480182490] [2025-02-06 05:31:27,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:31:27,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:29,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 05:31:29,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 05:31:29,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:29,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 05:31:29,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:29,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480182490] [2025-02-06 05:31:29,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480182490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:29,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:29,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:31:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426434632] [2025-02-06 05:31:29,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:29,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:31:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:29,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:31:29,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:31:29,601 INFO L87 Difference]: Start difference. First operand 641 states and 815 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:31:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:29,855 INFO L93 Difference]: Finished difference Result 677 states and 849 transitions. [2025-02-06 05:31:29,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:31:29,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2025-02-06 05:31:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:29,859 INFO L225 Difference]: With dead ends: 677 [2025-02-06 05:31:29,859 INFO L226 Difference]: Without dead ends: 609 [2025-02-06 05:31:29,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:31:29,860 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 0 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:29,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1634 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:31:29,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-02-06 05:31:29,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2025-02-06 05:31:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 453 states have (on average 1.229580573951435) internal successors, (557), 456 states have internal predecessors, (557), 101 states have call successors, (101), 50 states have call predecessors, (101), 54 states have return successors, (110), 102 states have call predecessors, (110), 96 states have call successors, (110) [2025-02-06 05:31:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 768 transitions. [2025-02-06 05:31:29,878 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 768 transitions. Word has length 93 [2025-02-06 05:31:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:29,878 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 768 transitions. [2025-02-06 05:31:29,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:31:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 768 transitions. [2025-02-06 05:31:29,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-06 05:31:29,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:31:29,881 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:31:29,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 05:31:29,881 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:31:29,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:31:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash 265701923, now seen corresponding path program 1 times [2025-02-06 05:31:29,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:31:29,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329041254] [2025-02-06 05:31:29,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:31:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:31,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 05:31:31,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 05:31:31,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:31,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 05:31:31,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:31,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329041254] [2025-02-06 05:31:31,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329041254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:31,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:31,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 05:31:31,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208827634] [2025-02-06 05:31:31,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:31,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 05:31:31,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:31,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 05:31:31,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 05:31:31,894 INFO L87 Difference]: Start difference. First operand 609 states and 768 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:31:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:32,090 INFO L93 Difference]: Finished difference Result 669 states and 837 transitions. [2025-02-06 05:31:32,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 05:31:32,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2025-02-06 05:31:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:32,093 INFO L225 Difference]: With dead ends: 669 [2025-02-06 05:31:32,093 INFO L226 Difference]: Without dead ends: 619 [2025-02-06 05:31:32,093 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:32,095 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 6 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:32,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 807 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:31:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-02-06 05:31:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 611. [2025-02-06 05:31:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 455 states have (on average 1.2285714285714286) internal successors, (559), 458 states have internal predecessors, (559), 101 states have call successors, (101), 50 states have call predecessors, (101), 54 states have return successors, (110), 102 states have call predecessors, (110), 96 states have call successors, (110) [2025-02-06 05:31:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 770 transitions. [2025-02-06 05:31:32,111 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 770 transitions. Word has length 93 [2025-02-06 05:31:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:32,111 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 770 transitions. [2025-02-06 05:31:32,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:31:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 770 transitions. [2025-02-06 05:31:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 05:31:32,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:31:32,113 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:31:32,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 05:31:32,113 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:31:32,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:31:32,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1106755504, now seen corresponding path program 1 times [2025-02-06 05:31:32,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:31:32,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027159079] [2025-02-06 05:31:32,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:31:32,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:33,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 05:31:33,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 05:31:33,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:33,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 05:31:34,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:34,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027159079] [2025-02-06 05:31:34,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027159079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:34,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:34,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 05:31:34,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972310697] [2025-02-06 05:31:34,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:34,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 05:31:34,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:34,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 05:31:34,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 05:31:34,181 INFO L87 Difference]: Start difference. First operand 611 states and 770 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-06 05:31:38,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:31:42,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 05:31:44,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:44,775 INFO L93 Difference]: Finished difference Result 626 states and 784 transitions. [2025-02-06 05:31:44,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:31:44,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 94 [2025-02-06 05:31:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:44,778 INFO L225 Difference]: With dead ends: 626 [2025-02-06 05:31:44,778 INFO L226 Difference]: Without dead ends: 525 [2025-02-06 05:31:44,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:31:44,780 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 675 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 111 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:44,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 914 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2025-02-06 05:31:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-02-06 05:31:44,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 523. [2025-02-06 05:31:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 387 states have (on average 1.2299741602067182) internal successors, (476), 389 states have internal predecessors, (476), 87 states have call successors, (87), 45 states have call predecessors, (87), 48 states have return successors, (95), 88 states have call predecessors, (95), 84 states have call successors, (95) [2025-02-06 05:31:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 658 transitions. [2025-02-06 05:31:44,802 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 658 transitions. Word has length 94 [2025-02-06 05:31:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:44,802 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 658 transitions. [2025-02-06 05:31:44,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-06 05:31:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 658 transitions. [2025-02-06 05:31:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 05:31:44,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:31:44,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 05:31:44,803 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:31:44,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:31:44,804 INFO L85 PathProgramCache]: Analyzing trace with hash -562294359, now seen corresponding path program 1 times [2025-02-06 05:31:44,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:31:44,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068437205] [2025-02-06 05:31:44,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:31:44,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:46,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 05:31:46,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 05:31:46,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:46,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:47,304 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:47,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:47,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068437205] [2025-02-06 05:31:47,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068437205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:47,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:47,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 05:31:47,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572149184] [2025-02-06 05:31:47,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:47,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 05:31:47,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:47,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 05:31:47,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 05:31:47,305 INFO L87 Difference]: Start difference. First operand 523 states and 658 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 05:31:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:48,212 INFO L93 Difference]: Finished difference Result 603 states and 742 transitions. [2025-02-06 05:31:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 05:31:48,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 2 states have call successors, (14) Word has length 107 [2025-02-06 05:31:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:48,215 INFO L225 Difference]: With dead ends: 603 [2025-02-06 05:31:48,215 INFO L226 Difference]: Without dead ends: 320 [2025-02-06 05:31:48,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 05:31:48,216 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 18 mSDsluCounter, 2710 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3054 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:48,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3054 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 05:31:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-02-06 05:31:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 315. [2025-02-06 05:31:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 232 states have (on average 1.2025862068965518) internal successors, (279), 232 states have internal predecessors, (279), 50 states have call successors, (50), 31 states have call predecessors, (50), 32 states have return successors, (53), 51 states have call predecessors, (53), 48 states have call successors, (53) [2025-02-06 05:31:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 382 transitions. [2025-02-06 05:31:48,230 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 382 transitions. Word has length 107 [2025-02-06 05:31:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:48,232 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 382 transitions. [2025-02-06 05:31:48,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 05:31:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 382 transitions. [2025-02-06 05:31:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 05:31:48,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:31:48,259 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:31:48,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 05:31:48,260 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:31:48,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:31:48,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2085501599, now seen corresponding path program 1 times [2025-02-06 05:31:48,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:31:48,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182022201] [2025-02-06 05:31:48,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:31:48,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:31:50,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 05:31:50,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 05:31:50,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:31:50,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:31:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 05:31:50,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:31:50,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182022201] [2025-02-06 05:31:50,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182022201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:31:50,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:31:50,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 05:31:50,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593061757] [2025-02-06 05:31:50,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:31:50,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 05:31:50,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:31:50,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 05:31:50,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:31:50,682 INFO L87 Difference]: Start difference. First operand 315 states and 382 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 05:31:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:31:50,885 INFO L93 Difference]: Finished difference Result 315 states and 382 transitions. [2025-02-06 05:31:50,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 05:31:50,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2025-02-06 05:31:50,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:31:50,886 INFO L225 Difference]: With dead ends: 315 [2025-02-06 05:31:50,886 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 05:31:50,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 05:31:50,892 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 0 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:31:50,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1185 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:31:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 05:31:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 05:31:50,893 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:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 05:31:50,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2025-02-06 05:31:50,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:31:50,894 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 05:31:50,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 05:31:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 05:31:50,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 05:31:50,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 05:31:50,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 05:31:50,901 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:31:50,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 05:32:02,481 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 05:32:02,505 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~urb~1!base [2025-02-06 05:32:02,508 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~urb~1!base [2025-02-06 05:32:02,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 05:32:02 BoogieIcfgContainer [2025-02-06 05:32:02,511 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 05:32:02,512 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 05:32:02,512 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 05:32:02,512 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 05:32:02,513 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:45" (3/4) ... [2025-02-06 05:32:02,514 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure atomic_set [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_kill_anchored_urbs [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kfree [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure init_usb_anchor [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ems_usb_init [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure consume_skb [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_submit_urb [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure dev_err [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_fill_bulk_urb [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ems_usb_write_mode [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kzalloc [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure netif_device_detach [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_alloc_coherent [2025-02-06 05:32:02,519 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure netif_tx_start_queue [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_check_return_value [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure netdev_priv [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure atomic_dec [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_unanchor_urb [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure netdev_get_tx_queue [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ems_usb_control_cmd [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure close_candev [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure dev_warn [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure free_candev [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure netif_stop_queue [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ems_usb_command_msg [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_alloc_urb [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure usb_anchor_urb [2025-02-06 05:32:02,520 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ems_usb_exit [2025-02-06 05:32:02,521 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure unlink_all_urbs [2025-02-06 05:32:02,521 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2025-02-06 05:32:02,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 152 nodes and edges [2025-02-06 05:32:02,538 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2025-02-06 05:32:02,539 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-02-06 05:32:02,541 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 05:32:02,543 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 05:32:02,544 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 05:32:02,583 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_urb_state == \old(ldv_urb_state)) && (1 <= \old(ldv_urb_state))) [2025-02-06 05:32:02,585 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(ldv_coherent_state) == ldv_coherent_state) && (1 <= \old(ldv_coherent_state))) && ((1 <= ldv_urb_state) || (ldv_urb_state == 0))) [2025-02-06 05:32:02,590 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_coherent_state == 0) && (0 == \old(ldv_urb_state))) && (ldv_urb_state == 0)) [2025-02-06 05:32:02,590 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_coherent_state == 0) && (1 <= ldv_urb_state)) && (\old(ldv_coherent_state) == 0)) [2025-02-06 05:32:02,780 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(ldv_coherent_state) == ldv_coherent_state) && (1 <= \old(ldv_coherent_state))) && ((1 <= ldv_urb_state) || (ldv_urb_state == 0))) [2025-02-06 05:32:02,781 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_coherent_state == 0) && (1 <= ldv_urb_state)) && (\old(ldv_coherent_state) == 0)) [2025-02-06 05:32:02,781 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_urb_state == \old(ldv_urb_state)) && (1 <= \old(ldv_urb_state))) [2025-02-06 05:32:02,781 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_coherent_state == 0) && (0 == \old(ldv_urb_state))) && (ldv_urb_state == 0)) [2025-02-06 05:32:02,822 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 05:32:02,822 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 05:32:02,822 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 05:32:02,824 INFO L158 Benchmark]: Toolchain (without parser) took 85160.59ms. Allocated memory was 167.8MB in the beginning and 696.3MB in the end (delta: 528.5MB). Free memory was 114.3MB in the beginning and 424.9MB in the end (delta: -310.6MB). Peak memory consumption was 216.3MB. Max. memory is 16.1GB. [2025-02-06 05:32:02,824 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 05:32:02,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1454.36ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 108.9MB in the end (delta: 5.4MB). Peak memory consumption was 106.7MB. Max. memory is 16.1GB. [2025-02-06 05:32:02,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.41ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 98.2MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 05:32:02,824 INFO L158 Benchmark]: Boogie Preprocessor took 237.58ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 60.4MB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 05:32:02,824 INFO L158 Benchmark]: IcfgBuilder took 6216.50ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 59.3MB in the beginning and 94.9MB in the end (delta: -35.6MB). Peak memory consumption was 143.5MB. Max. memory is 16.1GB. [2025-02-06 05:32:02,824 INFO L158 Benchmark]: TraceAbstraction took 76819.24ms. Allocated memory was 335.5MB in the beginning and 696.3MB in the end (delta: 360.7MB). Free memory was 94.9MB in the beginning and 466.4MB in the end (delta: -371.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 05:32:02,824 INFO L158 Benchmark]: Witness Printer took 310.31ms. Allocated memory is still 696.3MB. Free memory was 466.4MB in the beginning and 424.9MB in the end (delta: 41.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 05:32:02,825 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.65ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1454.36ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 108.9MB in the end (delta: 5.4MB). Peak memory consumption was 106.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.41ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 98.2MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 237.58ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 60.4MB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * IcfgBuilder took 6216.50ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 59.3MB in the beginning and 94.9MB in the end (delta: -35.6MB). Peak memory consumption was 143.5MB. Max. memory is 16.1GB. * TraceAbstraction took 76819.24ms. Allocated memory was 335.5MB in the beginning and 696.3MB in the end (delta: 360.7MB). Free memory was 94.9MB in the beginning and 466.4MB in the end (delta: -371.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 310.31ms. Allocated memory is still 696.3MB. Free memory was 466.4MB in the beginning and 424.9MB in the end (delta: 41.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 4831]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4831-4837] - GenericResultAtLocation [Line: 4844]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4844-4850] - GenericResultAtLocation [Line: 4857]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "btr %2,%1\n\t" "sbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4857-4864] - GenericResultAtLocation [Line: 4894]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "incl %0": "+m" (v->counter)); [4894-4900] - GenericResultAtLocation [Line: 4907]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "decl %0": "+m" (v->counter)); [4907-4913] - GenericResultAtLocation [Line: 5717]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n" ".pushsection __bug_table,\"a\"\n" "2:\t.long 1b - 2b, %c0 - 2b\n" "\t.word %c1, 0\n" "\t.org 2b+%c2\n" ".popsection": : "i" ("/anthill/stuff/tacas-comp/work/current--X--drivers/net/can/usb/ems_usb.ko--X--bulklinux-3.0.1--X--68_1/linux-3.0.1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/68_1/drivers/net/can/usb/ems_usb.c.common.c"), "i" (510), "i" (sizeof(struct bug_entry ))); [5717-5723] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~urb~1!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~urb~1!base * 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: 6754]: 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 39 procedures, 519 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.2s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 2543 SdHoareTripleChecker+Valid, 27.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2468 mSDsluCounter, 29480 SdHoareTripleChecker+Invalid, 27.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22070 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2054 IncrementalHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 7410 mSDtfsCounter, 2054 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=791occurred in iteration=6, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 204 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1273 NumberOfCodeBlocks, 1273 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1257 ConstructedInterpolants, 0 QuantifiedInterpolants, 1805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 87/87 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: 5837]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 6135]: Location Invariant Derived location invariant: ((1 <= ldv_urb_state) && (1 <= ldv_coherent_state)) - InvariantResult [Line: 6777]: Location Invariant Derived location invariant: (((ldv_coherent_state == 0) && (1 <= ldv_urb_state)) && (\old(ldv_coherent_state) == 0)) - InvariantResult [Line: 6834]: Location Invariant Derived location invariant: (((ldv_coherent_state == 0) && (0 == \old(ldv_urb_state))) && (ldv_urb_state == 0)) - InvariantResult [Line: 6118]: Location Invariant Derived location invariant: ((1 <= ldv_urb_state) && (1 <= ldv_coherent_state)) - InvariantResult [Line: 6802]: Location Invariant Derived location invariant: (((\old(ldv_coherent_state) == ldv_coherent_state) && (1 <= \old(ldv_coherent_state))) && ((1 <= ldv_urb_state) || (ldv_urb_state == 0))) - InvariantResult [Line: 6641]: Location Invariant Derived location invariant: ((ldv_coherent_state == 0) && (ldv_urb_state == 0)) - InvariantResult [Line: 6859]: Location Invariant Derived location invariant: ((ldv_urb_state == \old(ldv_urb_state)) && (1 <= \old(ldv_urb_state))) RESULT: Ultimate proved your program to be correct! [2025-02-06 05:32:02,910 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