./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.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-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.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 8946ad2f029076f7c4f90de60a8c48e069f80fec06a0c6d7a5dc3a1fc4182879 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:33:00,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:33:00,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:33:00,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:33:00,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:33:00,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:33:00,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:33:00,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:33:00,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:33:00,639 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:33:00,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:33:00,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:33:00,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:33:00,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:33:00,640 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:33:00,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:33:00,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:33:00,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:33:00,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:33:00,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:33:00,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:33:00,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:33:00,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:33:00,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:33:00,641 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:33:00,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:33:00,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:33:00,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:33:00,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:33:00,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:33:00,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:33:00,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:33:00,641 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:33:00,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:33:00,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:33:00,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:33:00,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:33:00,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:33:00,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:33:00,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:33:00,642 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 -> 8946ad2f029076f7c4f90de60a8c48e069f80fec06a0c6d7a5dc3a1fc4182879 [2025-02-06 06:33:00,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:33:00,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:33:00,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:33:00,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:33:00,878 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:33:00,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-02-06 06:33:02,106 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b40af61d/dc093f23db0440df88accafad9b4b841/FLAG2d9906259 [2025-02-06 06:33:02,562 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:33:02,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-02-06 06:33:02,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b40af61d/dc093f23db0440df88accafad9b4b841/FLAG2d9906259 [2025-02-06 06:33:02,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b40af61d/dc093f23db0440df88accafad9b4b841 [2025-02-06 06:33:02,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:33:02,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:33:02,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:33:02,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:33:02,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:33:02,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:33:02" (1/1) ... [2025-02-06 06:33:02,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6896696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:02, skipping insertion in model container [2025-02-06 06:33:02,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:33:02" (1/1) ... [2025-02-06 06:33:02,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:33:03,323 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-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2025-02-06 06:33:03,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:33:03,368 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:33:03,436 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3095-3096] [2025-02-06 06:33:03,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (63), "i" (12UL)); [3374-3375] [2025-02-06 06:33:03,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (65), "i" (12UL)); [3382-3383] [2025-02-06 06:33:03,453 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (66), "i" (12UL)); [3390-3391] [2025-02-06 06:33:03,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (123), "i" (12UL)); [3605-3606] [2025-02-06 06:33:03,485 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (177), "i" (12UL)); [3680-3681] [2025-02-06 06:33:03,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (467), "i" (12UL)); [4002-4003] [2025-02-06 06:33:03,562 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-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2025-02-06 06:33:03,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:33:03,611 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:33:03,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:03 WrapperNode [2025-02-06 06:33:03,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:33:03,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:33:03,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:33:03,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:33:03,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:03" (1/1) ... [2025-02-06 06:33:03,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:03" (1/1) ... [2025-02-06 06:33:03,766 INFO L138 Inliner]: procedures = 143, calls = 525, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1744 [2025-02-06 06:33:03,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:33:03,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:33:03,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:33:03,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:33:03,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:03" (1/1) ... [2025-02-06 06:33:03,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:03" (1/1) ... [2025-02-06 06:33:03,790 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:03" (1/1) ... [2025-02-06 06:33:03,948 INFO L175 MemorySlicer]: Split 263 memory accesses to 10 slices as follows [2, 4, 1, 8, 8, 1, 192, 1, 25, 21]. 73 percent of accesses are in the largest equivalence class. The 31 initializations are split as follows [2, 0, 0, 8, 8, 0, 13, 0, 0, 0]. The 91 writes are split as follows [0, 2, 1, 0, 0, 0, 63, 1, 3, 21]. [2025-02-06 06:33:03,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:03" (1/1) ... [2025-02-06 06:33:03,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:03" (1/1) ... [2025-02-06 06:33:04,001 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:03" (1/1) ... [2025-02-06 06:33:04,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:03" (1/1) ... [2025-02-06 06:33:04,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:03" (1/1) ... [2025-02-06 06:33:04,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:03" (1/1) ... [2025-02-06 06:33:04,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:33:04,051 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:33:04,051 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:33:04,051 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:33:04,053 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:03" (1/1) ... [2025-02-06 06:33:04,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:33:04,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:33:04,076 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 06:33:04,081 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 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segment_size [2025-02-06 06:33:04,096 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segment_size [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_config_buf [2025-02-06 06:33:04,096 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_config_buf [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 06:33:04,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 06:33:04,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-02-06 06:33:04,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure req_get_ioprio [2025-02-06 06:33:04,097 INFO L138 BoogieDeclarations]: Found implementation of procedure req_get_ioprio [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2025-02-06 06:33:04,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:33:04,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_free [2025-02-06 06:33:04,097 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_free [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_buf [2025-02-06 06:33:04,097 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_buf [2025-02-06 06:33:04,097 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 06:33:04,097 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 06:33:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:33:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:33:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:33:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:33:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:33:04,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:33:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 06:33:04,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 06:33:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 06:33:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 06:33:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 06:33:04,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 06:33:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 06:33:04,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 06:33:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure index_to_minor [2025-02-06 06:33:04,101 INFO L138 BoogieDeclarations]: Found implementation of procedure index_to_minor [2025-02-06 06:33:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-02-06 06:33:04,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-02-06 06:33:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 06:33:04,102 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 06:33:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:33:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-02-06 06:33:04,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-02-06 06:33:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-02-06 06:33:04,102 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-02-06 06:33:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:33:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_has_feature [2025-02-06 06:33:04,102 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_has_feature [2025-02-06 06:33:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:33:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:33:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:33:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:33:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:33:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:33:04,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:33:04,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 06:33:04,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 06:33:04,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 06:33:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_remove [2025-02-06 06:33:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_remove [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2025-02-06 06:33:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-02-06 06:33:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-02-06 06:33:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2025-02-06 06:33:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2025-02-06 06:33:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_ordered [2025-02-06 06:33:04,105 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_ordered [2025-02-06 06:33:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:33:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:33:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:33:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:33:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:33:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:33:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 06:33:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 06:33:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 06:33:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 06:33:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:33:04,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:33:04,105 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-02-06 06:33:04,105 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-02-06 06:33:04,390 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:33:04,391 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:33:04,439 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 06:33:04,449 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: havoc #t~mem53; [2025-02-06 06:33:04,567 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4358: havoc __phys_addr_#t~nondet404#1; [2025-02-06 06:33:04,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4397: havoc blk_peek_request_#t~ret411#1.base, blk_peek_request_#t~ret411#1.offset; [2025-02-06 06:33:04,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3498: call ULTIMATE.dealloc(blk_done_~#len~0#1.base, blk_done_~#len~0#1.offset);havoc blk_done_~#len~0#1.base, blk_done_~#len~0#1.offset; [2025-02-06 06:33:04,907 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4432: havoc blk_rq_map_sg_#t~nondet413#1; [2025-02-06 06:33:04,908 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4499: havoc virtqueue_add_buf_gfp_#t~nondet419#1; [2025-02-06 06:33:04,908 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3211: havoc blk_rq_pos_#t~mem65#1; [2025-02-06 06:33:04,908 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4369: havoc _raw_spin_lock_irqsave_#t~nondet406#1; [2025-02-06 06:33:04,908 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4502: havoc virtqueue_get_buf_#t~ret420#1.base, virtqueue_get_buf_#t~ret420#1.offset; [2025-02-06 06:33:04,908 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4453: havoc mempool_alloc_#t~ret414#1.base, mempool_alloc_#t~ret414#1.offset; [2025-02-06 06:33:04,926 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3127: havoc list_empty_#t~mem12#1.base, list_empty_#t~mem12#1.offset; [2025-02-06 06:33:04,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4425: havoc #t~nondet412; [2025-02-06 06:33:09,360 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3489: havoc virtio_find_single_vq_#t~mem162#1.base, virtio_find_single_vq_#t~mem162#1.offset;call ULTIMATE.dealloc(virtio_find_single_vq_~#callbacks~0#1.base, virtio_find_single_vq_~#callbacks~0#1.offset);havoc virtio_find_single_vq_~#callbacks~0#1.base, virtio_find_single_vq_~#callbacks~0#1.offset;call ULTIMATE.dealloc(virtio_find_single_vq_~#names~0#1.base, virtio_find_single_vq_~#names~0#1.offset);havoc virtio_find_single_vq_~#names~0#1.base, virtio_find_single_vq_~#names~0#1.offset;call ULTIMATE.dealloc(virtio_find_single_vq_~#vq~0#1.base, virtio_find_single_vq_~#vq~0#1.offset);havoc virtio_find_single_vq_~#vq~0#1.base, virtio_find_single_vq_~#vq~0#1.offset; [2025-02-06 06:33:09,361 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4480: havoc scsi_cmd_ioctl_#t~nondet418#1; [2025-02-06 06:33:09,361 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4381: havoc bio_map_kern_#t~ret408#1.base, bio_map_kern_#t~ret408#1.offset; [2025-02-06 06:33:09,361 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4365: havoc _copy_to_user_#t~nondet405#1; [2025-02-06 06:33:09,361 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3344: havoc __kmalloc_#t~ret115#1.base, __kmalloc_#t~ret115#1.offset; [2025-02-06 06:33:09,361 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4072: call ULTIMATE.dealloc(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset);havoc main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset; [2025-02-06 06:33:09,361 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3759: call ULTIMATE.dealloc(virtblk_ioctl_~#id_str~0#1.base, virtblk_ioctl_~#id_str~0#1.offset);havoc virtblk_ioctl_~#id_str~0#1.base, virtblk_ioctl_~#id_str~0#1.offset; [2025-02-06 06:33:09,361 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4472: havoc register_blkdev_#t~nondet416#1; [2025-02-06 06:33:09,361 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4456: havoc mempool_create_#t~ret415#1.base, mempool_create_#t~ret415#1.offset; [2025-02-06 06:33:09,361 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4391: havoc blk_execute_rq_#t~nondet409#1; [2025-02-06 06:33:09,362 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3831: call ULTIMATE.dealloc(virtblk_probe_~#cap~0#1.base, virtblk_probe_~#cap~0#1.offset);havoc virtblk_probe_~#cap~0#1.base, virtblk_probe_~#cap~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#v~0#1.base, virtblk_probe_~#v~0#1.offset);havoc virtblk_probe_~#v~0#1.base, virtblk_probe_~#v~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#blk_size~0#1.base, virtblk_probe_~#blk_size~0#1.offset);havoc virtblk_probe_~#blk_size~0#1.base, virtblk_probe_~#blk_size~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#sg_elems~0#1.base, virtblk_probe_~#sg_elems~0#1.offset);havoc virtblk_probe_~#sg_elems~0#1.base, virtblk_probe_~#sg_elems~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#opt_io_size~0#1.base, virtblk_probe_~#opt_io_size~0#1.offset);havoc virtblk_probe_~#opt_io_size~0#1.base, virtblk_probe_~#opt_io_size~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#min_io_size~0#1.base, virtblk_probe_~#min_io_size~0#1.offset);havoc virtblk_probe_~#min_io_size~0#1.base, virtblk_probe_~#min_io_size~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#physical_block_exp~0#1.base, virtblk_probe_~#physical_block_exp~0#1.offset);havoc virtblk_probe_~#physical_block_exp~0#1.base, virtblk_probe_~#physical_block_exp~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#alignment_offset~0#1.base, virtblk_probe_~#alignment_offset~0#1.offset);havoc virtblk_probe_~#alignment_offset~0#1.base, virtblk_probe_~#alignment_offset~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#__key~0#1.base, virtblk_probe_~#__key~0#1.offset);havoc virtblk_probe_~#__key~0#1.base, virtblk_probe_~#__key~0#1.offset; [2025-02-06 06:33:09,362 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476: havoc register_virtio_driver_#t~nondet417#1; [2025-02-06 06:33:09,362 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3799: call ULTIMATE.dealloc(virtblk_getgeo_~#vgeo~0#1.base, virtblk_getgeo_~#vgeo~0#1.offset);havoc virtblk_getgeo_~#vgeo~0#1.base, virtblk_getgeo_~#vgeo~0#1.offset; [2025-02-06 06:33:09,362 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3155: havoc get_capacity_#t~mem27#1; [2025-02-06 06:33:09,362 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4394: havoc blk_init_queue_#t~ret410#1.base, blk_init_queue_#t~ret410#1.offset; [2025-02-06 06:33:09,362 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378: havoc alloc_disk_#t~ret407#1.base, alloc_disk_#t~ret407#1.offset; [2025-02-06 06:33:09,556 INFO L? ?]: Removed 975 outVars from TransFormulas that were not future-live. [2025-02-06 06:33:09,557 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:33:09,574 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:33:09,574 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 06:33:09,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:33:09 BoogieIcfgContainer [2025-02-06 06:33:09,575 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:33:09,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:33:09,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:33:09,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:33:09,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:33:02" (1/3) ... [2025-02-06 06:33:09,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cb8c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:33:09, skipping insertion in model container [2025-02-06 06:33:09,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:33:03" (2/3) ... [2025-02-06 06:33:09,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cb8c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:33:09, skipping insertion in model container [2025-02-06 06:33:09,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:33:09" (3/3) ... [2025-02-06 06:33:09,581 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-02-06 06:33:09,591 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:33:09,592 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i that has 27 procedures, 469 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-06 06:33:09,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:33:09,648 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;@391d5ec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:33:09,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:33:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 471 states, 357 states have (on average 1.3053221288515406) internal successors, (466), 375 states have internal predecessors, (466), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-02-06 06:33:09,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 06:33:09,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:09,658 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 06:33:09,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:09,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:09,663 INFO L85 PathProgramCache]: Analyzing trace with hash 897461776, now seen corresponding path program 1 times [2025-02-06 06:33:09,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:09,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204328056] [2025-02-06 06:33:09,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:09,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:09,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 06:33:09,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 06:33:09,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:09,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 06:33:10,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:10,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204328056] [2025-02-06 06:33:10,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204328056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:10,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:10,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 06:33:10,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277403324] [2025-02-06 06:33:10,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:10,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 06:33:10,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:10,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 06:33:10,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 06:33:10,117 INFO L87 Difference]: Start difference. First operand has 471 states, 357 states have (on average 1.3053221288515406) internal successors, (466), 375 states have internal predecessors, (466), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 06:33:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:10,170 INFO L93 Difference]: Finished difference Result 937 states and 1273 transitions. [2025-02-06 06:33:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 06:33:10,172 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2025-02-06 06:33:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:10,181 INFO L225 Difference]: With dead ends: 937 [2025-02-06 06:33:10,181 INFO L226 Difference]: Without dead ends: 450 [2025-02-06 06:33:10,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 06:33:10,189 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:10,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 621 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:33:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-02-06 06:33:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2025-02-06 06:33:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 346 states have (on average 1.2658959537572254) internal successors, (438), 354 states have internal predecessors, (438), 79 states have call successors, (79), 25 states have call predecessors, (79), 24 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-02-06 06:33:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 594 transitions. [2025-02-06 06:33:10,238 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 594 transitions. Word has length 46 [2025-02-06 06:33:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:10,239 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 594 transitions. [2025-02-06 06:33:10,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 06:33:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 594 transitions. [2025-02-06 06:33:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 06:33:10,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:10,240 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 06:33:10,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 06:33:10,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:10,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1672024623, now seen corresponding path program 1 times [2025-02-06 06:33:10,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:10,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029302849] [2025-02-06 06:33:10,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:10,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:10,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 06:33:10,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 06:33:10,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:10,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 06:33:10,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:10,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029302849] [2025-02-06 06:33:10,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029302849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:10,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:10,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:33:10,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104148298] [2025-02-06 06:33:10,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:10,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:33:10,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:10,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:33:10,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:33:10,504 INFO L87 Difference]: Start difference. First operand 450 states and 594 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 06:33:14,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:33:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:14,625 INFO L93 Difference]: Finished difference Result 1295 states and 1717 transitions. [2025-02-06 06:33:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:33:14,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2025-02-06 06:33:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:14,644 INFO L225 Difference]: With dead ends: 1295 [2025-02-06 06:33:14,647 INFO L226 Difference]: Without dead ends: 859 [2025-02-06 06:33:14,652 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 06:33:14,654 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 544 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:14,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1167 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 06:33:14,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-02-06 06:33:14,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 856. [2025-02-06 06:33:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 661 states have (on average 1.2708018154311649) internal successors, (840), 676 states have internal predecessors, (840), 149 states have call successors, (149), 46 states have call predecessors, (149), 45 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2025-02-06 06:33:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1136 transitions. [2025-02-06 06:33:14,712 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1136 transitions. Word has length 46 [2025-02-06 06:33:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:14,716 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1136 transitions. [2025-02-06 06:33:14,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 06:33:14,717 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1136 transitions. [2025-02-06 06:33:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 06:33:14,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:14,720 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 06:33:14,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:33:14,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:14,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1347412783, now seen corresponding path program 1 times [2025-02-06 06:33:14,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:14,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038840264] [2025-02-06 06:33:14,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:14,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:14,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 06:33:14,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 06:33:14,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:14,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 06:33:14,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:14,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038840264] [2025-02-06 06:33:14,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038840264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:14,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:14,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:33:14,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732421944] [2025-02-06 06:33:14,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:14,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:33:14,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:14,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:33:14,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:33:14,977 INFO L87 Difference]: Start difference. First operand 856 states and 1136 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 06:33:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:15,060 INFO L93 Difference]: Finished difference Result 1682 states and 2233 transitions. [2025-02-06 06:33:15,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:33:15,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-02-06 06:33:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:15,076 INFO L225 Difference]: With dead ends: 1682 [2025-02-06 06:33:15,076 INFO L226 Difference]: Without dead ends: 1673 [2025-02-06 06:33:15,077 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 06:33:15,078 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 566 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:15,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1159 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:33:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2025-02-06 06:33:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2025-02-06 06:33:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1294 states have (on average 1.2704791344667696) internal successors, (1644), 1323 states have internal predecessors, (1644), 289 states have call successors, (289), 90 states have call predecessors, (289), 89 states have return successors, (287), 287 states have call predecessors, (287), 287 states have call successors, (287) [2025-02-06 06:33:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2220 transitions. [2025-02-06 06:33:15,170 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2220 transitions. Word has length 49 [2025-02-06 06:33:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:15,171 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2220 transitions. [2025-02-06 06:33:15,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 06:33:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2220 transitions. [2025-02-06 06:33:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 06:33:15,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:15,176 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:33:15,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:33:15,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:15,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash 383295849, now seen corresponding path program 1 times [2025-02-06 06:33:15,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:15,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756742810] [2025-02-06 06:33:15,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:15,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:15,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 06:33:15,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 06:33:15,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:15,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 06:33:15,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:15,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756742810] [2025-02-06 06:33:15,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756742810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:15,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:15,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:33:15,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465884730] [2025-02-06 06:33:15,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:15,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:33:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:15,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:33:15,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:33:15,401 INFO L87 Difference]: Start difference. First operand 1673 states and 2220 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 06:33:15,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:15,515 INFO L93 Difference]: Finished difference Result 3704 states and 4908 transitions. [2025-02-06 06:33:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:33:15,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-02-06 06:33:15,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:15,528 INFO L225 Difference]: With dead ends: 3704 [2025-02-06 06:33:15,528 INFO L226 Difference]: Without dead ends: 2044 [2025-02-06 06:33:15,534 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 06:33:15,535 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 491 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:15,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1160 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:33:15,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2025-02-06 06:33:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2025-02-06 06:33:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1578 states have (on average 1.268060836501901) internal successors, (2001), 1614 states have internal predecessors, (2001), 352 states have call successors, (352), 114 states have call predecessors, (352), 113 states have return successors, (350), 350 states have call predecessors, (350), 350 states have call successors, (350) [2025-02-06 06:33:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2703 transitions. [2025-02-06 06:33:15,667 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2703 transitions. Word has length 110 [2025-02-06 06:33:15,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:15,668 INFO L471 AbstractCegarLoop]: Abstraction has 2044 states and 2703 transitions. [2025-02-06 06:33:15,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 06:33:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2703 transitions. [2025-02-06 06:33:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 06:33:15,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:15,675 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:33:15,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:33:15,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:15,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2082416553, now seen corresponding path program 1 times [2025-02-06 06:33:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:15,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651645593] [2025-02-06 06:33:15,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:15,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 06:33:15,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 06:33:15,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:15,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-06 06:33:16,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:16,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651645593] [2025-02-06 06:33:16,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651645593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:16,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:16,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:33:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907963750] [2025-02-06 06:33:16,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:16,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:33:16,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:16,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:33:16,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:33:16,009 INFO L87 Difference]: Start difference. First operand 2044 states and 2703 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 06:33:20,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:33:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:20,148 INFO L93 Difference]: Finished difference Result 4074 states and 5393 transitions. [2025-02-06 06:33:20,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:33:20,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 153 [2025-02-06 06:33:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:20,162 INFO L225 Difference]: With dead ends: 4074 [2025-02-06 06:33:20,162 INFO L226 Difference]: Without dead ends: 2052 [2025-02-06 06:33:20,169 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 06:33:20,170 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 6 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:20,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1766 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-02-06 06:33:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2025-02-06 06:33:20,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 2047. [2025-02-06 06:33:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2047 states, 1581 states have (on average 1.2662871600253005) internal successors, (2002), 1617 states have internal predecessors, (2002), 352 states have call successors, (352), 114 states have call predecessors, (352), 113 states have return successors, (350), 350 states have call predecessors, (350), 350 states have call successors, (350) [2025-02-06 06:33:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2704 transitions. [2025-02-06 06:33:20,253 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2704 transitions. Word has length 153 [2025-02-06 06:33:20,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:20,253 INFO L471 AbstractCegarLoop]: Abstraction has 2047 states and 2704 transitions. [2025-02-06 06:33:20,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 06:33:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2704 transitions. [2025-02-06 06:33:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-06 06:33:20,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:20,265 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:33:20,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:33:20,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:20,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:20,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1863243341, now seen corresponding path program 1 times [2025-02-06 06:33:20,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:20,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761466194] [2025-02-06 06:33:20,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:20,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:20,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-06 06:33:20,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-06 06:33:20,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:20,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-06 06:33:20,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:20,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761466194] [2025-02-06 06:33:20,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761466194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:20,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:33:20,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:33:20,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870876778] [2025-02-06 06:33:20,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:20,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:33:20,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:20,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:33:20,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:33:20,818 INFO L87 Difference]: Start difference. First operand 2047 states and 2704 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 06:33:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:20,941 INFO L93 Difference]: Finished difference Result 3723 states and 4959 transitions. [2025-02-06 06:33:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:33:20,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 154 [2025-02-06 06:33:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:20,954 INFO L225 Difference]: With dead ends: 3723 [2025-02-06 06:33:20,954 INFO L226 Difference]: Without dead ends: 2057 [2025-02-06 06:33:20,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:33:20,959 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 0 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:20,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2351 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:33:20,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2025-02-06 06:33:21,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2051. [2025-02-06 06:33:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2051 states, 1583 states have (on average 1.2659507264687302) internal successors, (2004), 1621 states have internal predecessors, (2004), 352 states have call successors, (352), 114 states have call predecessors, (352), 115 states have return successors, (366), 350 states have call predecessors, (366), 350 states have call successors, (366) [2025-02-06 06:33:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2722 transitions. [2025-02-06 06:33:21,024 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2722 transitions. Word has length 154 [2025-02-06 06:33:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:21,024 INFO L471 AbstractCegarLoop]: Abstraction has 2051 states and 2722 transitions. [2025-02-06 06:33:21,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-06 06:33:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2722 transitions. [2025-02-06 06:33:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 06:33:21,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:21,028 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 06:33:21,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:33:21,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:21,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1226223635, now seen corresponding path program 1 times [2025-02-06 06:33:21,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:21,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210485964] [2025-02-06 06:33:21,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:21,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 06:33:21,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 06:33:21,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:21,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-06 06:33:21,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:21,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210485964] [2025-02-06 06:33:21,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210485964] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:33:21,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60566235] [2025-02-06 06:33:21,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:21,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:21,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:33:21,589 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:33:21,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 06:33:22,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 06:33:22,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 06:33:22,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:22,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:22,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 06:33:22,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:33:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-06 06:33:22,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:33:22,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60566235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:33:22,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:33:22,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 06:33:22,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042792143] [2025-02-06 06:33:22,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:33:22,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:33:22,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:22,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:33:22,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:33:22,650 INFO L87 Difference]: Start difference. First operand 2051 states and 2722 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:33:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:22,721 INFO L93 Difference]: Finished difference Result 4086 states and 5429 transitions. [2025-02-06 06:33:22,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:33:22,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 175 [2025-02-06 06:33:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:22,731 INFO L225 Difference]: With dead ends: 4086 [2025-02-06 06:33:22,732 INFO L226 Difference]: Without dead ends: 2052 [2025-02-06 06:33:22,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:33:22,738 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 0 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:22,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1761 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:33:22,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2025-02-06 06:33:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 2052. [2025-02-06 06:33:22,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2052 states, 1584 states have (on average 1.2657828282828283) internal successors, (2005), 1622 states have internal predecessors, (2005), 352 states have call successors, (352), 114 states have call predecessors, (352), 115 states have return successors, (366), 350 states have call predecessors, (366), 350 states have call successors, (366) [2025-02-06 06:33:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2723 transitions. [2025-02-06 06:33:22,821 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2723 transitions. Word has length 175 [2025-02-06 06:33:22,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:22,821 INFO L471 AbstractCegarLoop]: Abstraction has 2052 states and 2723 transitions. [2025-02-06 06:33:22,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:33:22,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2723 transitions. [2025-02-06 06:33:22,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-06 06:33:22,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:22,825 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 06:33:22,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 06:33:23,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:23,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:23,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:23,031 INFO L85 PathProgramCache]: Analyzing trace with hash 855797195, now seen corresponding path program 1 times [2025-02-06 06:33:23,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:23,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927179384] [2025-02-06 06:33:23,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:23,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:23,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 06:33:23,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 06:33:23,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:23,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-06 06:33:23,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:23,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927179384] [2025-02-06 06:33:23,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927179384] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:33:23,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800764779] [2025-02-06 06:33:23,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:33:23,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:23,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:33:23,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:33:23,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 06:33:23,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 06:33:24,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 06:33:24,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:33:24,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:24,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 06:33:24,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:33:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-06 06:33:24,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 06:33:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-06 06:33:24,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800764779] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 06:33:24,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 06:33:24,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 06:33:24,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144223320] [2025-02-06 06:33:24,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 06:33:24,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 06:33:24,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:33:24,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 06:33:24,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-06 06:33:24,688 INFO L87 Difference]: Start difference. First operand 2052 states and 2723 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-06 06:33:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:33:24,916 INFO L93 Difference]: Finished difference Result 4099 states and 5448 transitions. [2025-02-06 06:33:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 06:33:24,916 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 177 [2025-02-06 06:33:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:33:24,927 INFO L225 Difference]: With dead ends: 4099 [2025-02-06 06:33:24,928 INFO L226 Difference]: Without dead ends: 2064 [2025-02-06 06:33:24,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2025-02-06 06:33:24,935 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 7 mSDsluCounter, 1755 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:33:24,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2343 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:33:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2025-02-06 06:33:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 2062. [2025-02-06 06:33:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2062 states, 1593 states have (on average 1.2661644695543) internal successors, (2017), 1631 states have internal predecessors, (2017), 352 states have call successors, (352), 115 states have call predecessors, (352), 116 states have return successors, (366), 350 states have call predecessors, (366), 350 states have call successors, (366) [2025-02-06 06:33:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 2735 transitions. [2025-02-06 06:33:25,002 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 2735 transitions. Word has length 177 [2025-02-06 06:33:25,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:33:25,003 INFO L471 AbstractCegarLoop]: Abstraction has 2062 states and 2735 transitions. [2025-02-06 06:33:25,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-06 06:33:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2735 transitions. [2025-02-06 06:33:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-06 06:33:25,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:33:25,008 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 06:33:25,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 06:33:25,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:25,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:33:25,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:33:25,211 INFO L85 PathProgramCache]: Analyzing trace with hash 310444531, now seen corresponding path program 2 times [2025-02-06 06:33:25,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:33:25,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89479409] [2025-02-06 06:33:25,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 06:33:25,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:33:25,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 181 statements into 2 equivalence classes. [2025-02-06 06:33:25,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 06:33:25,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 06:33:25,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:33:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-06 06:33:25,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:33:25,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89479409] [2025-02-06 06:33:25,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89479409] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:33:25,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862122943] [2025-02-06 06:33:25,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 06:33:25,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:33:25,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:33:25,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:33:25,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 06:33:26,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 181 statements into 2 equivalence classes.