./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e3b9005361fd0095f8dbb62f5fee3acdc88198cbc01de43b11979176397f6891 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:40:00,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:40:00,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 02:40:00,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:40:00,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:40:00,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:40:00,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:40:00,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:40:00,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:40:00,635 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:40:00,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:40:00,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:40:00,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:40:00,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:40:00,635 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:40:00,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:40:00,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:40:00,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:40:00,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:40:00,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:40:00,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:40:00,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:40:00,636 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:40:00,636 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:40:00,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:40:00,636 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:40:00,636 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:40:00,636 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:40:00,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:40:00,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:40:00,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:40:00,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:40:00,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:40:00,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:40:00,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:40:00,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:40:00,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:40:00,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:40:00,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:40:00,637 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:40:00,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:40:00,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:40:00,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:40:00,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:40:00,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:40:00,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:40:00,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:40:00,640 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 ! overflow) ) 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 -> e3b9005361fd0095f8dbb62f5fee3acdc88198cbc01de43b11979176397f6891 [2025-01-10 02:40:00,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:40:00,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:40:00,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:40:00,917 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:40:00,918 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:40:00,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i [2025-01-10 02:40:02,186 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df163d6d5/3a984b844e324a2abb9f376f4a8d7b62/FLAG8b8a210d1 [2025-01-10 02:40:02,848 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:40:02,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i [2025-01-10 02:40:02,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df163d6d5/3a984b844e324a2abb9f376f4a8d7b62/FLAG8b8a210d1 [2025-01-10 02:40:03,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df163d6d5/3a984b844e324a2abb9f376f4a8d7b62 [2025-01-10 02:40:03,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:40:03,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:40:03,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:40:03,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:40:03,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:40:03,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:03" (1/1) ... [2025-01-10 02:40:03,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a2629a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:03, skipping insertion in model container [2025-01-10 02:40:03,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:03" (1/1) ... [2025-01-10 02:40:03,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:40:04,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:40:04,837 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:40:05,056 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [7332] [2025-01-10 02:40:05,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:40:05,148 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:40:05,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05 WrapperNode [2025-01-10 02:40:05,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:40:05,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:40:05,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:40:05,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:40:05,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,304 INFO L138 Inliner]: procedures = 188, calls = 660, calls flagged for inlining = 75, calls inlined = 50, statements flattened = 1355 [2025-01-10 02:40:05,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:40:05,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:40:05,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:40:05,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:40:05,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,413 INFO L175 MemorySlicer]: Split 204 memory accesses to 8 slices as follows [2, 32, 9, 12, 8, 21, 5, 115]. 56 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 9, 12, 0, 0, 0, 54]. The 38 writes are split as follows [0, 28, 0, 0, 0, 1, 0, 9]. [2025-01-10 02:40:05,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,438 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:40:05,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:40:05,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:40:05,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:40:05,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (1/1) ... [2025-01-10 02:40:05,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:40:05,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:05,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 02:40:05,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 02:40:05,548 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-01-10 02:40:05,548 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-01-10 02:40:05,548 INFO L130 BoogieDeclarations]: Found specification of procedure uspace_ring_map [2025-01-10 02:40:05,548 INFO L138 BoogieDeclarations]: Found implementation of procedure uspace_ring_map [2025-01-10 02:40:05,548 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_unmap_user_pages [2025-01-10 02:40:05,548 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_unmap_user_pages [2025-01-10 02:40:05,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-10 02:40:05,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-10 02:40:05,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-10 02:40:05,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-10 02:40:05,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-10 02:40:05,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-10 02:40:05,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-10 02:40:05,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-10 02:40:05,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 02:40:05,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 02:40:05,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 02:40:05,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 02:40:05,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 02:40:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 02:40:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-10 02:40:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-10 02:40:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure hash_64 [2025-01-10 02:40:05,551 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_64 [2025-01-10 02:40:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_release_buffers [2025-01-10 02:40:05,551 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_release_buffers [2025-01-10 02:40:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-10 02:40:05,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-10 02:40:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2025-01-10 02:40:05,551 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2025-01-10 02:40:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_write [2025-01-10 02:40:05,552 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_write [2025-01-10 02:40:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 02:40:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 02:40:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 02:40:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 02:40:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 02:40:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 02:40:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-10 02:40:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-10 02:40:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-10 02:40:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-10 02:40:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-10 02:40:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-10 02:40:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_open [2025-01-10 02:40:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_open [2025-01-10 02:40:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_destroy [2025-01-10 02:40:05,553 INFO L138 BoogieDeclarations]: Found implementation of procedure kmem_cache_destroy [2025-01-10 02:40:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 02:40:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_tgt_cmd_to_host [2025-01-10 02:40:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_tgt_cmd_to_host [2025-01-10 02:40:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-01-10 02:40:05,555 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-01-10 02:40:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:40:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_ring_idx_inc [2025-01-10 02:40:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_ring_idx_inc [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_head_event [2025-01-10 02:40:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_head_event [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_host_put [2025-01-10 02:40:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_host_put [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-01-10 02:40:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-01-10 02:40:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-01-10 02:40:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 02:40:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_ring_exit [2025-01-10 02:40:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_ring_exit [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-10 02:40:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_tgt_cmd_destroy [2025-01-10 02:40:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_tgt_cmd_destroy [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_ring_init [2025-01-10 02:40:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_ring_init [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-01-10 02:40:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_free [2025-01-10 02:40:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure kmem_cache_free [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_poll [2025-01-10 02:40:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_poll [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-01-10 02:40:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_host_lookup [2025-01-10 02:40:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_host_lookup [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_mmap [2025-01-10 02:40:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_mmap [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 02:40:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 02:40:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 02:40:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 02:40:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 02:40:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-10 02:40:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-01-10 02:40:05,558 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-01-10 02:40:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:40:05,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:40:05,888 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:40:05,891 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:40:08,716 INFO L? ?]: Removed 647 outVars from TransFormulas that were not future-live. [2025-01-10 02:40:08,716 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:40:08,730 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:40:08,731 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:40:08,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:08 BoogieIcfgContainer [2025-01-10 02:40:08,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:40:08,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:40:08,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:40:08,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:40:08,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:40:03" (1/3) ... [2025-01-10 02:40:08,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c15d603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:08, skipping insertion in model container [2025-01-10 02:40:08,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:05" (2/3) ... [2025-01-10 02:40:08,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c15d603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:08, skipping insertion in model container [2025-01-10 02:40:08,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:08" (3/3) ... [2025-01-10 02:40:08,739 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i [2025-01-10 02:40:08,749 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:40:08,752 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i that has 32 procedures, 434 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-01-10 02:40:08,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:40:08,809 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;@4464b52c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:40:08,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 02:40:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 434 states, 309 states have (on average 1.313915857605178) internal successors, (406), 326 states have internal predecessors, (406), 83 states have call successors, (83), 31 states have call predecessors, (83), 31 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-10 02:40:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 02:40:08,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:08,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:08,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:08,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:08,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2035114833, now seen corresponding path program 1 times [2025-01-10 02:40:08,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:08,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196995168] [2025-01-10 02:40:08,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:08,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:09,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:40:09,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:40:09,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:09,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:09,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:09,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196995168] [2025-01-10 02:40:09,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196995168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:09,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:09,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:40:09,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960991441] [2025-01-10 02:40:09,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:09,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:09,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:09,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:09,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:09,339 INFO L87 Difference]: Start difference. First operand has 434 states, 309 states have (on average 1.313915857605178) internal successors, (406), 326 states have internal predecessors, (406), 83 states have call successors, (83), 31 states have call predecessors, (83), 31 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:40:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:09,484 INFO L93 Difference]: Finished difference Result 969 states and 1292 transitions. [2025-01-10 02:40:09,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:09,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 02:40:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:09,500 INFO L225 Difference]: With dead ends: 969 [2025-01-10 02:40:09,500 INFO L226 Difference]: Without dead ends: 504 [2025-01-10 02:40:09,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:09,511 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 135 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:09,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1086 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:40:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-10 02:40:09,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 499. [2025-01-10 02:40:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 359 states have (on average 1.3147632311977715) internal successors, (472), 375 states have internal predecessors, (472), 92 states have call successors, (92), 38 states have call predecessors, (92), 38 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-10 02:40:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 654 transitions. [2025-01-10 02:40:09,590 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 654 transitions. Word has length 15 [2025-01-10 02:40:09,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:09,594 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 654 transitions. [2025-01-10 02:40:09,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:40:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 654 transitions. [2025-01-10 02:40:09,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 02:40:09,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:09,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:09,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:40:09,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:09,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:09,596 INFO L85 PathProgramCache]: Analyzing trace with hash -748633520, now seen corresponding path program 1 times [2025-01-10 02:40:09,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:09,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157834872] [2025-01-10 02:40:09,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:09,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:09,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 02:40:09,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 02:40:09,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:09,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:10,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:10,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157834872] [2025-01-10 02:40:10,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157834872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:10,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:10,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:40:10,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744290161] [2025-01-10 02:40:10,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:10,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:10,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:10,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:10,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:10,027 INFO L87 Difference]: Start difference. First operand 499 states and 654 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:10,819 INFO L93 Difference]: Finished difference Result 1374 states and 1803 transitions. [2025-01-10 02:40:10,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:10,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-01-10 02:40:10,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:10,824 INFO L225 Difference]: With dead ends: 1374 [2025-01-10 02:40:10,824 INFO L226 Difference]: Without dead ends: 878 [2025-01-10 02:40:10,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:10,826 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 522 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:10,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1397 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 02:40:10,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-01-10 02:40:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 855. [2025-01-10 02:40:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 626 states have (on average 1.3115015974440896) internal successors, (821), 643 states have internal predecessors, (821), 154 states have call successors, (154), 65 states have call predecessors, (154), 65 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-01-10 02:40:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1128 transitions. [2025-01-10 02:40:10,867 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1128 transitions. Word has length 20 [2025-01-10 02:40:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:10,867 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1128 transitions. [2025-01-10 02:40:10,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:40:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1128 transitions. [2025-01-10 02:40:10,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-10 02:40:10,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:10,868 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] [2025-01-10 02:40:10,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:40:10,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:10,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:10,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1122377281, now seen corresponding path program 1 times [2025-01-10 02:40:10,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:10,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658391143] [2025-01-10 02:40:10,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:10,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 02:40:11,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 02:40:11,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:11,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:40:11,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:11,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658391143] [2025-01-10 02:40:11,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658391143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:11,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:11,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:40:11,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157356503] [2025-01-10 02:40:11,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:11,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:40:11,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:11,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:40:11,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:40:11,152 INFO L87 Difference]: Start difference. First operand 855 states and 1128 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:40:12,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 02:40:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:12,542 INFO L93 Difference]: Finished difference Result 1713 states and 2261 transitions. [2025-01-10 02:40:12,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:40:12,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-01-10 02:40:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:12,554 INFO L225 Difference]: With dead ends: 1713 [2025-01-10 02:40:12,555 INFO L226 Difference]: Without dead ends: 855 [2025-01-10 02:40:12,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:40:12,560 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 1 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:12,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1607 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 02:40:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-01-10 02:40:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2025-01-10 02:40:12,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 626 states have (on average 1.3083067092651757) internal successors, (819), 643 states have internal predecessors, (819), 154 states have call successors, (154), 65 states have call predecessors, (154), 65 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-01-10 02:40:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1126 transitions. [2025-01-10 02:40:12,621 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1126 transitions. Word has length 38 [2025-01-10 02:40:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:12,621 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1126 transitions. [2025-01-10 02:40:12,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:40:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1126 transitions. [2025-01-10 02:40:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 02:40:12,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:12,622 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:12,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:40:12,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting tgt_ring_initErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:12,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:12,623 INFO L85 PathProgramCache]: Analyzing trace with hash -267193710, now seen corresponding path program 1 times [2025-01-10 02:40:12,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:12,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720137728] [2025-01-10 02:40:12,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:12,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:12,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 02:40:12,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:40:12,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:12,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:40:12,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:12,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720137728] [2025-01-10 02:40:12,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720137728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:12,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:12,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:40:12,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408454545] [2025-01-10 02:40:12,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:12,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:12,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:12,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:12,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:12,858 INFO L87 Difference]: Start difference. First operand 855 states and 1126 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:40:12,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:12,916 INFO L93 Difference]: Finished difference Result 1727 states and 2285 transitions. [2025-01-10 02:40:12,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:12,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2025-01-10 02:40:12,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:12,923 INFO L225 Difference]: With dead ends: 1727 [2025-01-10 02:40:12,923 INFO L226 Difference]: Without dead ends: 875 [2025-01-10 02:40:12,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:12,928 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 4 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:12,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1068 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-01-10 02:40:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 867. [2025-01-10 02:40:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 638 states have (on average 1.3056426332288402) internal successors, (833), 655 states have internal predecessors, (833), 154 states have call successors, (154), 65 states have call predecessors, (154), 65 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-01-10 02:40:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1140 transitions. [2025-01-10 02:40:12,981 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1140 transitions. Word has length 43 [2025-01-10 02:40:12,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:12,981 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1140 transitions. [2025-01-10 02:40:12,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:40:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1140 transitions. [2025-01-10 02:40:12,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 02:40:12,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:12,983 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:12,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:40:12,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting tgt_ring_initErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:12,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:12,983 INFO L85 PathProgramCache]: Analyzing trace with hash 710832538, now seen corresponding path program 1 times [2025-01-10 02:40:12,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:12,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898481170] [2025-01-10 02:40:12,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:12,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:13,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 02:40:13,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 02:40:13,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:13,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:40:13,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:13,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898481170] [2025-01-10 02:40:13,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898481170] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:13,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563475993] [2025-01-10 02:40:13,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:13,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:13,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:13,250 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:13,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 02:40:13,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 02:40:13,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 02:40:13,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:13,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:13,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:13,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:40:13,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:13,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563475993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:13,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:13,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:40:13,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999116843] [2025-01-10 02:40:13,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:13,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:40:13,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:13,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:40:13,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:13,751 INFO L87 Difference]: Start difference. First operand 867 states and 1140 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:40:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:13,793 INFO L93 Difference]: Finished difference Result 879 states and 1158 transitions. [2025-01-10 02:40:13,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:40:13,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2025-01-10 02:40:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:13,798 INFO L225 Difference]: With dead ends: 879 [2025-01-10 02:40:13,798 INFO L226 Difference]: Without dead ends: 878 [2025-01-10 02:40:13,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:13,799 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 7 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:13,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1077 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-01-10 02:40:13,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 866. [2025-01-10 02:40:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 638 states have (on average 1.3025078369905956) internal successors, (831), 654 states have internal predecessors, (831), 154 states have call successors, (154), 65 states have call predecessors, (154), 65 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-01-10 02:40:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1138 transitions. [2025-01-10 02:40:13,872 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1138 transitions. Word has length 49 [2025-01-10 02:40:13,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:13,872 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1138 transitions. [2025-01-10 02:40:13,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:40:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1138 transitions. [2025-01-10 02:40:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 02:40:13,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:13,875 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:40:13,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 02:40:14,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:14,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting tgt_ring_initErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:14,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:14,082 INFO L85 PathProgramCache]: Analyzing trace with hash 560972670, now seen corresponding path program 1 times [2025-01-10 02:40:14,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:14,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961510125] [2025-01-10 02:40:14,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:14,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:14,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 02:40:14,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 02:40:14,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:14,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:40:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961510125] [2025-01-10 02:40:14,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961510125] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308918304] [2025-01-10 02:40:14,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:14,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:14,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:14,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:14,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 02:40:14,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 02:40:14,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 02:40:14,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:14,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:14,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:14,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:14,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:40:14,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:40:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:40:15,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308918304] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:40:15,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:40:15,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:40:15,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082511597] [2025-01-10 02:40:15,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:40:15,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:40:15,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:15,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:40:15,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:15,011 INFO L87 Difference]: Start difference. First operand 866 states and 1138 transitions. Second operand has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:40:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:15,074 INFO L93 Difference]: Finished difference Result 900 states and 1190 transitions. [2025-01-10 02:40:15,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:40:15,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2025-01-10 02:40:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:15,082 INFO L225 Difference]: With dead ends: 900 [2025-01-10 02:40:15,083 INFO L226 Difference]: Without dead ends: 899 [2025-01-10 02:40:15,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:15,084 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 12 mSDsluCounter, 2116 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2650 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:15,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2650 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-01-10 02:40:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 855. [2025-01-10 02:40:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 628 states have (on average 1.3009554140127388) internal successors, (817), 643 states have internal predecessors, (817), 154 states have call successors, (154), 65 states have call predecessors, (154), 65 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-01-10 02:40:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1124 transitions. [2025-01-10 02:40:15,124 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1124 transitions. Word has length 50 [2025-01-10 02:40:15,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:15,125 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1124 transitions. [2025-01-10 02:40:15,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:40:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1124 transitions. [2025-01-10 02:40:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 02:40:15,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:15,128 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:15,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 02:40:15,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:15,329 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:15,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:15,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1026886907, now seen corresponding path program 1 times [2025-01-10 02:40:15,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:15,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675097326] [2025-01-10 02:40:15,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:15,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:15,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:40:15,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:40:15,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:15,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 02:40:15,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:15,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675097326] [2025-01-10 02:40:15,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675097326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:15,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:15,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:40:15,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366347542] [2025-01-10 02:40:15,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:15,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:15,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:15,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:15,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:15,518 INFO L87 Difference]: Start difference. First operand 855 states and 1124 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:40:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:15,553 INFO L93 Difference]: Finished difference Result 1722 states and 2273 transitions. [2025-01-10 02:40:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:15,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2025-01-10 02:40:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:15,560 INFO L225 Difference]: With dead ends: 1722 [2025-01-10 02:40:15,560 INFO L226 Difference]: Without dead ends: 870 [2025-01-10 02:40:15,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:15,562 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 1 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:15,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1062 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:15,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-01-10 02:40:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2025-01-10 02:40:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 643 states have (on average 1.2939346811819596) internal successors, (832), 658 states have internal predecessors, (832), 154 states have call successors, (154), 65 states have call predecessors, (154), 65 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-01-10 02:40:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1139 transitions. [2025-01-10 02:40:15,593 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1139 transitions. Word has length 51 [2025-01-10 02:40:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:15,593 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1139 transitions. [2025-01-10 02:40:15,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:40:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1139 transitions. [2025-01-10 02:40:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 02:40:15,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:15,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:15,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:40:15,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:15,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:15,596 INFO L85 PathProgramCache]: Analyzing trace with hash -383163116, now seen corresponding path program 1 times [2025-01-10 02:40:15,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:15,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959485428] [2025-01-10 02:40:15,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:15,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:15,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 02:40:15,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 02:40:15,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:15,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 02:40:15,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:15,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959485428] [2025-01-10 02:40:15,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959485428] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:15,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291591868] [2025-01-10 02:40:15,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:15,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:15,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:15,827 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-01-10 02:40:15,828 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-01-10 02:40:16,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 02:40:16,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 02:40:16,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:16,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:16,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:40:16,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:40:16,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:16,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291591868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:16,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:16,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-01-10 02:40:16,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682125321] [2025-01-10 02:40:16,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:16,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:40:16,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:16,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:40:16,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:16,249 INFO L87 Difference]: Start difference. First operand 870 states and 1139 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:40:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:16,949 INFO L93 Difference]: Finished difference Result 1747 states and 2289 transitions. [2025-01-10 02:40:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:40:16,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 56 [2025-01-10 02:40:16,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:16,954 INFO L225 Difference]: With dead ends: 1747 [2025-01-10 02:40:16,954 INFO L226 Difference]: Without dead ends: 870 [2025-01-10 02:40:16,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:16,958 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 1 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:16,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2126 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 02:40:16,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-01-10 02:40:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2025-01-10 02:40:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 643 states have (on average 1.290824261275272) internal successors, (830), 656 states have internal predecessors, (830), 154 states have call successors, (154), 65 states have call predecessors, (154), 65 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-01-10 02:40:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1137 transitions. [2025-01-10 02:40:16,988 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1137 transitions. Word has length 56 [2025-01-10 02:40:16,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:16,988 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1137 transitions. [2025-01-10 02:40:16,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:40:16,988 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1137 transitions. [2025-01-10 02:40:16,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-10 02:40:16,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:16,989 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:16,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 02:40:17,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:17,193 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:17,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:17,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1636769325, now seen corresponding path program 1 times [2025-01-10 02:40:17,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:17,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733063609] [2025-01-10 02:40:17,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:17,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:17,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-10 02:40:17,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 02:40:17,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:17,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 02:40:17,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:17,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733063609] [2025-01-10 02:40:17,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733063609] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:17,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500699750] [2025-01-10 02:40:17,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:17,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:17,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:17,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:17,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 02:40:17,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-10 02:40:17,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 02:40:17,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:17,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:17,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:40:17,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:40:17,875 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:17,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500699750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:17,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:17,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3] total 9 [2025-01-10 02:40:17,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797929238] [2025-01-10 02:40:17,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:17,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:40:17,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:17,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:40:17,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:40:17,876 INFO L87 Difference]: Start difference. First operand 870 states and 1137 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-10 02:40:17,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:17,938 INFO L93 Difference]: Finished difference Result 1755 states and 2299 transitions. [2025-01-10 02:40:17,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:40:17,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2025-01-10 02:40:17,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:17,945 INFO L225 Difference]: With dead ends: 1755 [2025-01-10 02:40:17,945 INFO L226 Difference]: Without dead ends: 888 [2025-01-10 02:40:17,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:40:17,949 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 1 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3220 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:17,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3220 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:17,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-01-10 02:40:17,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 882. [2025-01-10 02:40:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 653 states have (on average 1.2863705972434916) internal successors, (840), 666 states have internal predecessors, (840), 154 states have call successors, (154), 65 states have call predecessors, (154), 67 states have return successors, (157), 155 states have call predecessors, (157), 153 states have call successors, (157) [2025-01-10 02:40:17,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1151 transitions. [2025-01-10 02:40:17,982 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1151 transitions. Word has length 78 [2025-01-10 02:40:17,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:17,983 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1151 transitions. [2025-01-10 02:40:17,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-10 02:40:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1151 transitions. [2025-01-10 02:40:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-10 02:40:17,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:17,984 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:17,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:40:18,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-10 02:40:18,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:18,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1097303593, now seen corresponding path program 1 times [2025-01-10 02:40:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171405104] [2025-01-10 02:40:18,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:18,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:18,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-10 02:40:18,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 02:40:18,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:18,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 02:40:18,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:18,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171405104] [2025-01-10 02:40:18,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171405104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:18,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:18,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:40:18,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375814416] [2025-01-10 02:40:18,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:18,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:40:18,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:18,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:40:18,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:18,450 INFO L87 Difference]: Start difference. First operand 882 states and 1151 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 02:40:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:18,488 INFO L93 Difference]: Finished difference Result 1761 states and 2299 transitions. [2025-01-10 02:40:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:40:18,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 77 [2025-01-10 02:40:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:18,493 INFO L225 Difference]: With dead ends: 1761 [2025-01-10 02:40:18,493 INFO L226 Difference]: Without dead ends: 882 [2025-01-10 02:40:18,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-10 02:40:18,496 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 0 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:18,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2126 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-01-10 02:40:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2025-01-10 02:40:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 653 states have (on average 1.2833078101071975) internal successors, (838), 666 states have internal predecessors, (838), 154 states have call successors, (154), 65 states have call predecessors, (154), 67 states have return successors, (157), 155 states have call predecessors, (157), 153 states have call successors, (157) [2025-01-10 02:40:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1149 transitions. [2025-01-10 02:40:18,520 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1149 transitions. Word has length 77 [2025-01-10 02:40:18,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:18,520 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1149 transitions. [2025-01-10 02:40:18,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 02:40:18,520 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1149 transitions. [2025-01-10 02:40:18,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-10 02:40:18,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:18,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-01-10 02:40:18,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:40:18,521 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:18,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:18,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1932911068, now seen corresponding path program 1 times [2025-01-10 02:40:18,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:18,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551387863] [2025-01-10 02:40:18,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:18,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:18,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-10 02:40:18,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 02:40:18,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:18,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 02:40:18,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:18,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551387863] [2025-01-10 02:40:18,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551387863] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:18,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049670978] [2025-01-10 02:40:18,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:18,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:18,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:18,708 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:18,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 02:40:19,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-10 02:40:19,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 02:40:19,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:19,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:19,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:19,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 02:40:19,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:19,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049670978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:19,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:19,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:40:19,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028945613] [2025-01-10 02:40:19,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:19,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:40:19,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:19,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:40:19,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:19,209 INFO L87 Difference]: Start difference. First operand 882 states and 1149 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:40:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:19,244 INFO L93 Difference]: Finished difference Result 882 states and 1149 transitions. [2025-01-10 02:40:19,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:40:19,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 86 [2025-01-10 02:40:19,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:19,251 INFO L225 Difference]: With dead ends: 882 [2025-01-10 02:40:19,251 INFO L226 Difference]: Without dead ends: 881 [2025-01-10 02:40:19,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:19,252 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 1 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:19,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1585 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-10 02:40:19,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-01-10 02:40:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 653 states have (on average 1.2787136294027566) internal successors, (835), 665 states have internal predecessors, (835), 154 states have call successors, (154), 65 states have call predecessors, (154), 67 states have return successors, (157), 155 states have call predecessors, (157), 153 states have call successors, (157) [2025-01-10 02:40:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1146 transitions. [2025-01-10 02:40:19,284 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1146 transitions. Word has length 86 [2025-01-10 02:40:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:19,284 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1146 transitions. [2025-01-10 02:40:19,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:40:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1146 transitions. [2025-01-10 02:40:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 02:40:19,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:19,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2025-01-10 02:40:19,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:40:19,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 02:40:19,488 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting tgt_ring_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:19,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash -209298917, now seen corresponding path program 1 times [2025-01-10 02:40:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:19,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349329745] [2025-01-10 02:40:19,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:19,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 02:40:19,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 02:40:19,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:19,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 02:40:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:19,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349329745] [2025-01-10 02:40:19,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349329745] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:19,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941184925] [2025-01-10 02:40:19,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:19,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:19,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:19,759 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:19,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 02:40:20,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 02:40:20,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 02:40:20,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:20,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:20,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:20,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 02:40:20,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:40:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 02:40:20,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941184925] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:40:20,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:40:20,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:40:20,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145191879] [2025-01-10 02:40:20,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:40:20,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:40:20,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:20,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:40:20,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:20,501 INFO L87 Difference]: Start difference. First operand 881 states and 1146 transitions. Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:40:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:20,544 INFO L93 Difference]: Finished difference Result 899 states and 1173 transitions. [2025-01-10 02:40:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:40:20,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 87 [2025-01-10 02:40:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:20,550 INFO L225 Difference]: With dead ends: 899 [2025-01-10 02:40:20,550 INFO L226 Difference]: Without dead ends: 872 [2025-01-10 02:40:20,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:20,551 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 0 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:20,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2640 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-01-10 02:40:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 852. [2025-01-10 02:40:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 630 states have (on average 1.2793650793650793) internal successors, (806), 640 states have internal predecessors, (806), 151 states have call successors, (151), 63 states have call predecessors, (151), 65 states have return successors, (155), 153 states have call predecessors, (155), 151 states have call successors, (155) [2025-01-10 02:40:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1112 transitions. [2025-01-10 02:40:20,586 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1112 transitions. Word has length 87 [2025-01-10 02:40:20,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:20,586 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1112 transitions. [2025-01-10 02:40:20,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:40:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1112 transitions. [2025-01-10 02:40:20,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 02:40:20,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:20,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-01-10 02:40:20,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 02:40:20,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 02:40:20,789 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:20,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:20,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1424176286, now seen corresponding path program 1 times [2025-01-10 02:40:20,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:20,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999775271] [2025-01-10 02:40:20,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:20,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:20,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 02:40:20,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 02:40:20,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:20,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 02:40:20,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:20,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999775271] [2025-01-10 02:40:20,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999775271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:20,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:20,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:40:20,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522429001] [2025-01-10 02:40:20,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:20,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:20,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:20,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:20,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:20,962 INFO L87 Difference]: Start difference. First operand 852 states and 1112 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:40:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:21,547 INFO L93 Difference]: Finished difference Result 2396 states and 3130 transitions. [2025-01-10 02:40:21,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:21,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 95 [2025-01-10 02:40:21,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:21,554 INFO L225 Difference]: With dead ends: 2396 [2025-01-10 02:40:21,554 INFO L226 Difference]: Without dead ends: 1547 [2025-01-10 02:40:21,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:21,557 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 478 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:21,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1105 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 02:40:21,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-01-10 02:40:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1544. [2025-01-10 02:40:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1140 states have (on average 1.263157894736842) internal successors, (1440), 1154 states have internal predecessors, (1440), 277 states have call successors, (277), 118 states have call predecessors, (277), 121 states have return successors, (283), 280 states have call predecessors, (283), 277 states have call successors, (283) [2025-01-10 02:40:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2000 transitions. [2025-01-10 02:40:21,592 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2000 transitions. Word has length 95 [2025-01-10 02:40:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:21,593 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2000 transitions. [2025-01-10 02:40:21,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:40:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2000 transitions. [2025-01-10 02:40:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-10 02:40:21,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:21,594 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-01-10 02:40:21,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 02:40:21,594 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:21,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1270452131, now seen corresponding path program 1 times [2025-01-10 02:40:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:21,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487366939] [2025-01-10 02:40:21,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:21,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:21,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-10 02:40:21,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 02:40:21,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:21,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 02:40:21,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:21,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487366939] [2025-01-10 02:40:21,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487366939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:21,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:21,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:40:21,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235609938] [2025-01-10 02:40:21,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:21,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:21,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:21,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:21,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:21,917 INFO L87 Difference]: Start difference. First operand 1544 states and 2000 transitions. Second operand has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:40:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:21,954 INFO L93 Difference]: Finished difference Result 3121 states and 4073 transitions. [2025-01-10 02:40:21,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:21,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 100 [2025-01-10 02:40:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:21,962 INFO L225 Difference]: With dead ends: 3121 [2025-01-10 02:40:21,962 INFO L226 Difference]: Without dead ends: 1580 [2025-01-10 02:40:21,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:21,967 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 3 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:21,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1042 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:21,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-01-10 02:40:22,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1572. [2025-01-10 02:40:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1168 states have (on average 1.2602739726027397) internal successors, (1472), 1182 states have internal predecessors, (1472), 277 states have call successors, (277), 118 states have call predecessors, (277), 121 states have return successors, (283), 280 states have call predecessors, (283), 277 states have call successors, (283) [2025-01-10 02:40:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2032 transitions. [2025-01-10 02:40:22,014 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2032 transitions. Word has length 100 [2025-01-10 02:40:22,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:22,015 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2032 transitions. [2025-01-10 02:40:22,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:40:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2032 transitions. [2025-01-10 02:40:22,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-10 02:40:22,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:22,018 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-01-10 02:40:22,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 02:40:22,018 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:22,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1799654899, now seen corresponding path program 1 times [2025-01-10 02:40:22,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:22,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554446432] [2025-01-10 02:40:22,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:22,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:22,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-10 02:40:22,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-10 02:40:22,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:22,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 02:40:22,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:22,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554446432] [2025-01-10 02:40:22,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554446432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:22,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:22,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:40:22,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167201523] [2025-01-10 02:40:22,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:22,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:22,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:22,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:22,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:22,202 INFO L87 Difference]: Start difference. First operand 1572 states and 2032 transitions. Second operand has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 02:40:22,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:22,256 INFO L93 Difference]: Finished difference Result 2413 states and 3107 transitions. [2025-01-10 02:40:22,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:22,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2025-01-10 02:40:22,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:22,269 INFO L225 Difference]: With dead ends: 2413 [2025-01-10 02:40:22,269 INFO L226 Difference]: Without dead ends: 2411 [2025-01-10 02:40:22,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:22,272 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 458 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:22,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1051 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:22,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2025-01-10 02:40:22,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2409. [2025-01-10 02:40:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2409 states, 1795 states have (on average 1.252924791086351) internal successors, (2249), 1814 states have internal predecessors, (2249), 422 states have call successors, (422), 181 states have call predecessors, (422), 186 states have return successors, (432), 427 states have call predecessors, (432), 422 states have call successors, (432) [2025-01-10 02:40:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 3103 transitions. [2025-01-10 02:40:22,382 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 3103 transitions. Word has length 99 [2025-01-10 02:40:22,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:22,382 INFO L471 AbstractCegarLoop]: Abstraction has 2409 states and 3103 transitions. [2025-01-10 02:40:22,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 02:40:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 3103 transitions. [2025-01-10 02:40:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-10 02:40:22,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:22,384 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-10 02:40:22,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 02:40:22,385 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:22,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:22,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1015366951, now seen corresponding path program 1 times [2025-01-10 02:40:22,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:22,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630088635] [2025-01-10 02:40:22,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:22,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:22,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 02:40:22,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 02:40:22,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:22,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 02:40:22,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630088635] [2025-01-10 02:40:22,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630088635] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016469026] [2025-01-10 02:40:22,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:22,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:22,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:22,671 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:22,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 02:40:23,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 02:40:23,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 02:40:23,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:23,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:23,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 1362 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:40:23,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 02:40:23,271 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:23,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016469026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:23,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:23,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-01-10 02:40:23,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17239096] [2025-01-10 02:40:23,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:23,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:40:23,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:23,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:40:23,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:23,272 INFO L87 Difference]: Start difference. First operand 2409 states and 3103 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:40:23,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:23,346 INFO L93 Difference]: Finished difference Result 4730 states and 6104 transitions. [2025-01-10 02:40:23,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:40:23,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 107 [2025-01-10 02:40:23,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:23,361 INFO L225 Difference]: With dead ends: 4730 [2025-01-10 02:40:23,361 INFO L226 Difference]: Without dead ends: 2429 [2025-01-10 02:40:23,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:23,370 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 1 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:23,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2090 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:23,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2025-01-10 02:40:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2419. [2025-01-10 02:40:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 1805 states have (on average 1.2515235457063711) internal successors, (2259), 1819 states have internal predecessors, (2259), 422 states have call successors, (422), 181 states have call predecessors, (422), 186 states have return successors, (432), 432 states have call predecessors, (432), 422 states have call successors, (432) [2025-01-10 02:40:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 3113 transitions. [2025-01-10 02:40:23,525 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 3113 transitions. Word has length 107 [2025-01-10 02:40:23,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:23,525 INFO L471 AbstractCegarLoop]: Abstraction has 2419 states and 3113 transitions. [2025-01-10 02:40:23,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:40:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 3113 transitions. [2025-01-10 02:40:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-10 02:40:23,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:23,528 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-10 02:40:23,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 02:40:23,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:23,730 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:23,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:23,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1399731865, now seen corresponding path program 1 times [2025-01-10 02:40:23,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:23,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603483121] [2025-01-10 02:40:23,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:23,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:23,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-10 02:40:23,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 02:40:23,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:23,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 02:40:23,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:23,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603483121] [2025-01-10 02:40:23,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603483121] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:23,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767235601] [2025-01-10 02:40:23,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:23,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:23,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:24,006 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:24,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 02:40:24,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-10 02:40:24,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 02:40:24,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:24,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:24,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:24,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 02:40:24,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:24,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767235601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:24,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:24,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:40:24,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218458850] [2025-01-10 02:40:24,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:24,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:40:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:24,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:40:24,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:24,745 INFO L87 Difference]: Start difference. First operand 2419 states and 3113 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 02:40:24,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:24,807 INFO L93 Difference]: Finished difference Result 2443 states and 3149 transitions. [2025-01-10 02:40:24,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:40:24,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 106 [2025-01-10 02:40:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:24,822 INFO L225 Difference]: With dead ends: 2443 [2025-01-10 02:40:24,823 INFO L226 Difference]: Without dead ends: 2442 [2025-01-10 02:40:24,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:24,825 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 5 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:24,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1565 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-01-10 02:40:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2418. [2025-01-10 02:40:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 1805 states have (on average 1.2481994459833794) internal successors, (2253), 1818 states have internal predecessors, (2253), 422 states have call successors, (422), 181 states have call predecessors, (422), 186 states have return successors, (432), 432 states have call predecessors, (432), 422 states have call successors, (432) [2025-01-10 02:40:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3107 transitions. [2025-01-10 02:40:25,000 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3107 transitions. Word has length 106 [2025-01-10 02:40:25,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:25,001 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3107 transitions. [2025-01-10 02:40:25,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 02:40:25,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3107 transitions. [2025-01-10 02:40:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-10 02:40:25,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:25,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-10 02:40:25,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 02:40:25,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 02:40:25,208 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:25,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:25,208 INFO L85 PathProgramCache]: Analyzing trace with hash -442014801, now seen corresponding path program 1 times [2025-01-10 02:40:25,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:25,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651546621] [2025-01-10 02:40:25,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:25,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:25,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 02:40:25,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 02:40:25,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:25,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 02:40:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:25,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651546621] [2025-01-10 02:40:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651546621] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:25,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714653673] [2025-01-10 02:40:25,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:25,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:25,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:25,464 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:25,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 02:40:25,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 02:40:26,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 02:40:26,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:26,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:26,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:26,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 02:40:26,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:40:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 02:40:26,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714653673] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:40:26,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:40:26,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:40:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828081380] [2025-01-10 02:40:26,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:40:26,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:40:26,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:26,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:40:26,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:26,188 INFO L87 Difference]: Start difference. First operand 2418 states and 3107 transitions. Second operand has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 02:40:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:26,247 INFO L93 Difference]: Finished difference Result 2502 states and 3233 transitions. [2025-01-10 02:40:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:40:26,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 107 [2025-01-10 02:40:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:26,257 INFO L225 Difference]: With dead ends: 2502 [2025-01-10 02:40:26,258 INFO L226 Difference]: Without dead ends: 2501 [2025-01-10 02:40:26,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:26,259 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 8 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:26,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2080 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2025-01-10 02:40:26,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2381. [2025-01-10 02:40:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 1769 states have (on average 1.2464669304691915) internal successors, (2205), 1781 states have internal predecessors, (2205), 422 states have call successors, (422), 181 states have call predecessors, (422), 186 states have return successors, (432), 432 states have call predecessors, (432), 422 states have call successors, (432) [2025-01-10 02:40:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3059 transitions. [2025-01-10 02:40:26,331 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3059 transitions. Word has length 107 [2025-01-10 02:40:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:26,331 INFO L471 AbstractCegarLoop]: Abstraction has 2381 states and 3059 transitions. [2025-01-10 02:40:26,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-10 02:40:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3059 transitions. [2025-01-10 02:40:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-10 02:40:26,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:26,334 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-10 02:40:26,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 02:40:26,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:40:26,535 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:26,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:26,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2067496903, now seen corresponding path program 1 times [2025-01-10 02:40:26,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:26,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210483698] [2025-01-10 02:40:26,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:26,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:26,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-10 02:40:26,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-10 02:40:26,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:26,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 02:40:26,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:26,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210483698] [2025-01-10 02:40:26,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210483698] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:26,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629768487] [2025-01-10 02:40:26,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:26,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:26,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:26,776 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:26,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 02:40:27,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-10 02:40:27,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-10 02:40:27,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:27,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:27,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:27,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 02:40:27,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:40:27,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629768487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:27,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:40:27,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:40:27,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490360112] [2025-01-10 02:40:27,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:27,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:40:27,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:27,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:40:27,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:27,448 INFO L87 Difference]: Start difference. First operand 2381 states and 3059 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:40:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:28,230 INFO L93 Difference]: Finished difference Result 3103 states and 3989 transitions. [2025-01-10 02:40:28,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:40:28,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 112 [2025-01-10 02:40:28,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:28,241 INFO L225 Difference]: With dead ends: 3103 [2025-01-10 02:40:28,242 INFO L226 Difference]: Without dead ends: 3101 [2025-01-10 02:40:28,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:28,243 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 958 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:28,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 1345 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 02:40:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2025-01-10 02:40:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 2379. [2025-01-10 02:40:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 1769 states have (on average 1.2442057659694743) internal successors, (2201), 1779 states have internal predecessors, (2201), 422 states have call successors, (422), 181 states have call predecessors, (422), 186 states have return successors, (432), 432 states have call predecessors, (432), 422 states have call successors, (432) [2025-01-10 02:40:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3055 transitions. [2025-01-10 02:40:28,324 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3055 transitions. Word has length 112 [2025-01-10 02:40:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:28,324 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 3055 transitions. [2025-01-10 02:40:28,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:40:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3055 transitions. [2025-01-10 02:40:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-10 02:40:28,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:28,327 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-10 02:40:28,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 02:40:28,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:28,528 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:28,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:28,529 INFO L85 PathProgramCache]: Analyzing trace with hash 332106150, now seen corresponding path program 1 times [2025-01-10 02:40:28,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:28,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484601606] [2025-01-10 02:40:28,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:28,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:28,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-10 02:40:28,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 02:40:28,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:28,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 02:40:28,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:28,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484601606] [2025-01-10 02:40:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484601606] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:40:28,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900988718] [2025-01-10 02:40:28,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:28,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:28,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:40:28,695 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:40:28,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 02:40:29,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-10 02:40:29,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 02:40:29,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:29,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:29,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:40:29,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:40:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 02:40:29,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:40:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 02:40:29,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900988718] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:40:29,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:40:29,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:40:29,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408444477] [2025-01-10 02:40:29,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:40:29,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:40:29,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:29,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:40:29,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:29,516 INFO L87 Difference]: Start difference. First operand 2379 states and 3055 transitions. Second operand has 7 states, 6 states have (on average 31.0) internal successors, (186), 7 states have internal predecessors, (186), 4 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-10 02:40:30,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:30,481 INFO L93 Difference]: Finished difference Result 4647 states and 5978 transitions. [2025-01-10 02:40:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:40:30,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 31.0) internal successors, (186), 7 states have internal predecessors, (186), 4 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 113 [2025-01-10 02:40:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:30,507 INFO L225 Difference]: With dead ends: 4647 [2025-01-10 02:40:30,507 INFO L226 Difference]: Without dead ends: 4645 [2025-01-10 02:40:30,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:40:30,510 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 2737 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2737 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:30,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2737 Valid, 1957 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 02:40:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2025-01-10 02:40:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 3923. [2025-01-10 02:40:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3923 states, 2916 states have (on average 1.2448559670781894) internal successors, (3630), 2931 states have internal predecessors, (3630), 699 states have call successors, (699), 299 states have call predecessors, (699), 307 states have return successors, (715), 715 states have call predecessors, (715), 699 states have call successors, (715) [2025-01-10 02:40:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 5044 transitions. [2025-01-10 02:40:30,621 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 5044 transitions. Word has length 113 [2025-01-10 02:40:30,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:30,621 INFO L471 AbstractCegarLoop]: Abstraction has 3923 states and 5044 transitions. [2025-01-10 02:40:30,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 31.0) internal successors, (186), 7 states have internal predecessors, (186), 4 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-10 02:40:30,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 5044 transitions. [2025-01-10 02:40:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-10 02:40:30,625 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:30,625 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 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] [2025-01-10 02:40:30,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 02:40:30,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:40:30,826 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:30,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:30,826 INFO L85 PathProgramCache]: Analyzing trace with hash -759692976, now seen corresponding path program 1 times [2025-01-10 02:40:30,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:30,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45872175] [2025-01-10 02:40:30,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:30,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:30,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-10 02:40:30,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-10 02:40:30,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:30,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-10 02:40:30,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:30,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45872175] [2025-01-10 02:40:30,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45872175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:30,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:30,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:40:30,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430398763] [2025-01-10 02:40:30,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:30,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:30,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:30,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:30,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:30,997 INFO L87 Difference]: Start difference. First operand 3923 states and 5044 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 02:40:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:31,900 INFO L93 Difference]: Finished difference Result 7524 states and 9694 transitions. [2025-01-10 02:40:31,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:31,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2025-01-10 02:40:31,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:31,913 INFO L225 Difference]: With dead ends: 7524 [2025-01-10 02:40:31,913 INFO L226 Difference]: Without dead ends: 3711 [2025-01-10 02:40:31,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:31,921 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 471 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:31,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1447 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 02:40:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2025-01-10 02:40:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3709. [2025-01-10 02:40:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3709 states, 2740 states have (on average 1.2306569343065694) internal successors, (3372), 2757 states have internal predecessors, (3372), 679 states have call successors, (679), 283 states have call predecessors, (679), 289 states have return successors, (691), 691 states have call predecessors, (691), 679 states have call successors, (691) [2025-01-10 02:40:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 4742 transitions. [2025-01-10 02:40:32,060 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 4742 transitions. Word has length 135 [2025-01-10 02:40:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:32,062 INFO L471 AbstractCegarLoop]: Abstraction has 3709 states and 4742 transitions. [2025-01-10 02:40:32,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 02:40:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 4742 transitions. [2025-01-10 02:40:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-10 02:40:32,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:32,070 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 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] [2025-01-10 02:40:32,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 02:40:32,070 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:32,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:32,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1293113351, now seen corresponding path program 1 times [2025-01-10 02:40:32,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:32,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171540862] [2025-01-10 02:40:32,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:32,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:32,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-10 02:40:32,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-10 02:40:32,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:32,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-01-10 02:40:32,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171540862] [2025-01-10 02:40:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171540862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:32,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:32,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:40:32,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126793379] [2025-01-10 02:40:32,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:32,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:32,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:32,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:32,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:32,506 INFO L87 Difference]: Start difference. First operand 3709 states and 4742 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 02:40:33,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:33,289 INFO L93 Difference]: Finished difference Result 7416 states and 9481 transitions. [2025-01-10 02:40:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:33,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 228 [2025-01-10 02:40:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:33,306 INFO L225 Difference]: With dead ends: 7416 [2025-01-10 02:40:33,307 INFO L226 Difference]: Without dead ends: 3045 [2025-01-10 02:40:33,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:33,320 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 422 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:33,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1095 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 02:40:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2025-01-10 02:40:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 3044. [2025-01-10 02:40:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 2248 states have (on average 1.2215302491103204) internal successors, (2746), 2261 states have internal predecessors, (2746), 556 states have call successors, (556), 233 states have call predecessors, (556), 239 states have return successors, (568), 568 states have call predecessors, (568), 556 states have call successors, (568) [2025-01-10 02:40:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 3870 transitions. [2025-01-10 02:40:33,503 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 3870 transitions. Word has length 228 [2025-01-10 02:40:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:33,506 INFO L471 AbstractCegarLoop]: Abstraction has 3044 states and 3870 transitions. [2025-01-10 02:40:33,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 02:40:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 3870 transitions. [2025-01-10 02:40:33,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-10 02:40:33,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:33,514 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-10 02:40:33,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 02:40:33,514 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:33,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1557760841, now seen corresponding path program 1 times [2025-01-10 02:40:33,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:33,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851381485] [2025-01-10 02:40:33,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:33,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-10 02:40:33,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-10 02:40:33,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:33,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-10 02:40:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851381485] [2025-01-10 02:40:33,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851381485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:33,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:33,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:40:33,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041934630] [2025-01-10 02:40:33,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:33,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:40:33,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:33,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:40:33,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:40:33,817 INFO L87 Difference]: Start difference. First operand 3044 states and 3870 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-10 02:40:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:33,971 INFO L93 Difference]: Finished difference Result 6097 states and 7752 transitions. [2025-01-10 02:40:33,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:40:33,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 228 [2025-01-10 02:40:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:33,989 INFO L225 Difference]: With dead ends: 6097 [2025-01-10 02:40:33,990 INFO L226 Difference]: Without dead ends: 3050 [2025-01-10 02:40:33,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:40:33,998 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 517 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:33,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1036 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3050 states. [2025-01-10 02:40:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3050 to 3044. [2025-01-10 02:40:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 2248 states have (on average 1.2201957295373667) internal successors, (2743), 2261 states have internal predecessors, (2743), 556 states have call successors, (556), 233 states have call predecessors, (556), 239 states have return successors, (568), 568 states have call predecessors, (568), 556 states have call successors, (568) [2025-01-10 02:40:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 3867 transitions. [2025-01-10 02:40:34,147 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 3867 transitions. Word has length 228 [2025-01-10 02:40:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:34,148 INFO L471 AbstractCegarLoop]: Abstraction has 3044 states and 3867 transitions. [2025-01-10 02:40:34,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-10 02:40:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 3867 transitions. [2025-01-10 02:40:34,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-01-10 02:40:34,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:34,155 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-10 02:40:34,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 02:40:34,156 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:34,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:34,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1080042104, now seen corresponding path program 1 times [2025-01-10 02:40:34,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:34,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660269676] [2025-01-10 02:40:34,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:34,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:34,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-10 02:40:34,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-10 02:40:34,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:34,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-01-10 02:40:34,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:34,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660269676] [2025-01-10 02:40:34,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660269676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:34,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:34,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:40:34,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270256251] [2025-01-10 02:40:34,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:34,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:40:34,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:34,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:40:34,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:40:34,410 INFO L87 Difference]: Start difference. First operand 3044 states and 3867 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-10 02:40:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:34,493 INFO L93 Difference]: Finished difference Result 6000 states and 7634 transitions. [2025-01-10 02:40:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:40:34,493 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 237 [2025-01-10 02:40:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:34,505 INFO L225 Difference]: With dead ends: 6000 [2025-01-10 02:40:34,505 INFO L226 Difference]: Without dead ends: 3048 [2025-01-10 02:40:34,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:40:34,513 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 0 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:34,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1550 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:40:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states. [2025-01-10 02:40:34,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 3048. [2025-01-10 02:40:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 2252 states have (on average 1.219360568383659) internal successors, (2746), 2265 states have internal predecessors, (2746), 556 states have call successors, (556), 233 states have call predecessors, (556), 239 states have return successors, (568), 568 states have call predecessors, (568), 556 states have call successors, (568) [2025-01-10 02:40:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 3870 transitions. [2025-01-10 02:40:34,599 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 3870 transitions. Word has length 237 [2025-01-10 02:40:34,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:34,599 INFO L471 AbstractCegarLoop]: Abstraction has 3048 states and 3870 transitions. [2025-01-10 02:40:34,600 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-10 02:40:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 3870 transitions. [2025-01-10 02:40:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-01-10 02:40:34,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:40:34,605 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 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] [2025-01-10 02:40:34,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 02:40:34,605 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:40:34,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:40:34,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1854049015, now seen corresponding path program 1 times [2025-01-10 02:40:34,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:40:34,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228413759] [2025-01-10 02:40:34,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:40:34,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:40:34,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-01-10 02:40:34,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-01-10 02:40:34,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:40:34,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:40:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-01-10 02:40:34,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:40:34,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228413759] [2025-01-10 02:40:34,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228413759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:40:34,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:40:34,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:40:34,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506994688] [2025-01-10 02:40:34,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:40:34,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:40:34,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:40:34,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:40:34,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:34,814 INFO L87 Difference]: Start difference. First operand 3048 states and 3870 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-10 02:40:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:40:35,470 INFO L93 Difference]: Finished difference Result 3168 states and 4006 transitions. [2025-01-10 02:40:35,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:40:35,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 258 [2025-01-10 02:40:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:40:35,475 INFO L225 Difference]: With dead ends: 3168 [2025-01-10 02:40:35,475 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:40:35,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:40:35,480 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 02:40:35,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 02:40:35,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:40:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:40:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:40:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:40:35,483 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 258 [2025-01-10 02:40:35,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:40:35,484 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:40:35,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-10 02:40:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:40:35,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:40:35,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-01-10 02:40:35,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-01-10 02:40:35,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-01-10 02:40:35,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-01-10 02:40:35,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_initErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-01-10 02:40:35,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_initErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-01-10 02:40:35,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-01-10 02:40:35,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-01-10 02:40:35,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-01-10 02:40:35,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-01-10 02:40:35,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 02:40:35,489 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:40:35,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:40:40,373 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:40:40,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:40:40 BoogieIcfgContainer [2025-01-10 02:40:40,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:40:40,387 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:40:40,387 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:40:40,387 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:40:40,389 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:08" (3/4) ... [2025-01-10 02:40:40,391 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_ring_idx_inc [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __raw_spin_lock_init [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_ring_exit [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure uspace_ring_map [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printk [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure scsi_tgt_cmd_destroy [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_write [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_ring_init [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure list_del [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kmem_cache_free [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_head_event [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_poll [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure scsi_unmap_user_pages [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure _raw_spin_lock_irqsave [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure scsi_host_put [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_64 [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~int [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_open [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure scsi_host_lookup [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_mmap [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure scsi_release_buffers [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure kmem_cache_destroy [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure spin_unlock_irqrestore [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure destroy_workqueue [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure _copy_from_user [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure list_add [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure scsi_tgt_cmd_to_host [2025-01-10 02:40:40,400 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure spinlock_check [2025-01-10 02:40:40,426 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 159 nodes and edges [2025-01-10 02:40:40,427 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2025-01-10 02:40:40,429 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-01-10 02:40:40,430 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-10 02:40:40,431 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 02:40:40,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:40:40,567 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:40:40,567 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:40:40,567 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:40:40,568 INFO L158 Benchmark]: Toolchain (without parser) took 37277.57ms. Allocated memory was 167.8MB in the beginning and 780.1MB in the end (delta: 612.4MB). Free memory was 114.4MB in the beginning and 439.5MB in the end (delta: -325.1MB). Peak memory consumption was 282.7MB. Max. memory is 16.1GB. [2025-01-10 02:40:40,568 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 209.7MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:40:40,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1859.67ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 50.8MB in the end (delta: 63.6MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. [2025-01-10 02:40:40,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 152.90ms. Allocated memory is still 167.8MB. Free memory was 50.8MB in the beginning and 100.7MB in the end (delta: -49.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2025-01-10 02:40:40,569 INFO L158 Benchmark]: Boogie Preprocessor took 177.19ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 76.2MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 02:40:40,570 INFO L158 Benchmark]: RCFGBuilder took 3248.34ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 76.2MB in the beginning and 266.2MB in the end (delta: -190.0MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2025-01-10 02:40:40,570 INFO L158 Benchmark]: TraceAbstraction took 31653.39ms. Allocated memory was 385.9MB in the beginning and 780.1MB in the end (delta: 394.3MB). Free memory was 265.2MB in the beginning and 464.6MB in the end (delta: -199.4MB). Peak memory consumption was 417.8MB. Max. memory is 16.1GB. [2025-01-10 02:40:40,570 INFO L158 Benchmark]: Witness Printer took 180.30ms. Allocated memory is still 780.1MB. Free memory was 464.6MB in the beginning and 439.5MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 02:40:40,571 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 209.7MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1859.67ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 50.8MB in the end (delta: 63.6MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 152.90ms. Allocated memory is still 167.8MB. Free memory was 50.8MB in the beginning and 100.7MB in the end (delta: -49.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 177.19ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 76.2MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 3248.34ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 76.2MB in the beginning and 266.2MB in the end (delta: -190.0MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * TraceAbstraction took 31653.39ms. Allocated memory was 385.9MB in the beginning and 780.1MB in the end (delta: 394.3MB). Free memory was 265.2MB in the beginning and 464.6MB in the end (delta: -199.4MB). Peak memory consumption was 417.8MB. Max. memory is 16.1GB. * Witness Printer took 180.30ms. Allocated memory is still 780.1MB. Free memory was 464.6MB in the beginning and 439.5MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 7332]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [7332] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7545]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7545]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7600]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7600]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7740]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7740]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7750]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7750]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 32 procedures, 434 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 26.7s, OverallIterations: 25, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6752 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6743 mSDsluCounter, 39212 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24885 mSDsCounter, 490 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1222 IncrementalHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 490 mSolverCounterUnsat, 14327 mSDtfsCounter, 1222 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1370 GetRequests, 1301 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3923occurred in iteration=20, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 1738 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 3526 NumberOfCodeBlocks, 3526 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3843 ConstructedInterpolants, 0 QuantifiedInterpolants, 5350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 13185 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 40 InterpolantComputations, 21 PerfectInterpolantSequences, 1933/2056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 6932]: Location Invariant Derived location invariant: (((((ref_cnt <= 0) && (0 <= ref_cnt)) && (ldv_state_variable_1 == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_1 == 2) && (1 <= ref_cnt)) && (ldv_state_variable_0 == 3)) && (ref_cnt <= 1))) - InvariantResult [Line: 7666]: Location Invariant Derived location invariant: ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 1)) && (ref_cnt == 0)) - InvariantResult [Line: 7065]: Location Invariant Derived location invariant: (((((ref_cnt <= 0) && (0 <= ref_cnt)) && (ldv_state_variable_1 == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_1 == 2) && (1 <= ref_cnt)) && (ldv_state_variable_0 == 3)) && (ref_cnt <= 1))) - InvariantResult [Line: 6818]: Location Invariant Derived location invariant: (((((ref_cnt <= 0) && (0 <= ref_cnt)) && (ldv_state_variable_1 == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_1 == 2) && (1 <= ref_cnt)) && (ldv_state_variable_0 == 3)) && (ref_cnt <= 1))) - InvariantResult [Line: 7649]: Location Invariant Derived location invariant: (((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 1)) && (ref_cnt == 0)) || ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0))) - InvariantResult [Line: 7075]: Location Invariant Derived location invariant: ((((ldv_state_variable_0 == 1) && (((long) err + 12) <= 0)) || ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 1)) && (ref_cnt == 0))) || ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0))) - InvariantResult [Line: 7019]: Location Invariant Derived location invariant: (((((ref_cnt <= 0) && (0 <= ref_cnt)) && (ldv_state_variable_1 == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_1 == 2) && (1 <= ref_cnt)) && (ldv_state_variable_0 == 3)) && (ref_cnt <= 1))) - InvariantResult [Line: 6890]: Location Invariant Derived location invariant: (((((ref_cnt <= 0) && (0 <= ref_cnt)) && (ldv_state_variable_1 == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_1 == 2) && (1 <= ref_cnt)) && (ldv_state_variable_0 == 3)) && (ref_cnt <= 1))) - InvariantResult [Line: 7095]: Location Invariant Derived location invariant: (((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 1)) && (ref_cnt == 0)) || ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0))) RESULT: Ultimate proved your program to be correct! [2025-01-10 02:40:40,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE