./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-798a7b3-m [2025-03-04 11:36:08,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:36:08,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 11:36:08,688 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:36:08,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:36:08,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:36:08,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:36:08,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:36:08,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:36:08,703 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:36:08,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:36:08,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:36:08,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:36:08,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:36:08,704 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:36:08,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:36:08,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:36:08,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:36:08,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:36:08,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:36:08,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:36:08,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:36:08,704 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:36:08,704 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:36:08,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:36:08,705 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:36:08,705 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:36:08,705 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:36:08,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:36:08,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:36:08,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:36:08,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:36:08,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:36:08,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:36:08,705 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:36:08,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:36:08,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:36:08,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:36:08,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:36:08,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:36:08,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:36:08,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:36:08,706 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/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-03-04 11:36:08,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:36:08,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:36:08,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:36:08,943 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:36:08,943 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:36:08,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/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-03-04 11:36:10,069 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92b6d847/220774df5e1d4f2abe4729aa1f8cbe13/FLAGe4dfb177f [2025-03-04 11:36:10,511 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:36:10,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i [2025-03-04 11:36:10,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92b6d847/220774df5e1d4f2abe4729aa1f8cbe13/FLAGe4dfb177f [2025-03-04 11:36:10,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92b6d847/220774df5e1d4f2abe4729aa1f8cbe13 [2025-03-04 11:36:10,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:36:10,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:36:10,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:36:10,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:36:10,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:36:10,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:36:10" (1/1) ... [2025-03-04 11:36:10,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b6c7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:10, skipping insertion in model container [2025-03-04 11:36:10,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:36:10" (1/1) ... [2025-03-04 11:36:10,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:36:11,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:36:11,795 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:36:11,980 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [7332] [2025-03-04 11:36:12,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:36:12,056 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:36:12,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12 WrapperNode [2025-03-04 11:36:12,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:36:12,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:36:12,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:36:12,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:36:12,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12" (1/1) ... [2025-03-04 11:36:12,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12" (1/1) ... [2025-03-04 11:36:12,187 INFO L138 Inliner]: procedures = 188, calls = 660, calls flagged for inlining = 75, calls inlined = 50, statements flattened = 1355 [2025-03-04 11:36:12,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:36:12,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:36:12,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:36:12,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:36:12,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12" (1/1) ... [2025-03-04 11:36:12,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12" (1/1) ... [2025-03-04 11:36:12,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12" (1/1) ... [2025-03-04 11:36:12,278 INFO L175 MemorySlicer]: Split 204 memory accesses to 8 slices as follows [2, 115, 32, 9, 12, 5, 21, 8]. 56 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 54, 4, 9, 12, 0, 0, 0]. The 38 writes are split as follows [0, 9, 28, 0, 0, 0, 1, 0]. [2025-03-04 11:36:12,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12" (1/1) ... [2025-03-04 11:36:12,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12" (1/1) ... [2025-03-04 11:36:12,323 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12" (1/1) ... [2025-03-04 11:36:12,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12" (1/1) ... [2025-03-04 11:36:12,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12" (1/1) ... [2025-03-04 11:36:12,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12" (1/1) ... [2025-03-04 11:36:12,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:36:12,346 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:36:12,346 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:36:12,346 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:36:12,346 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12" (1/1) ... [2025-03-04 11:36:12,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:36:12,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:12,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:36:12,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:36:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-04 11:36:12,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-04 11:36:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure uspace_ring_map [2025-03-04 11:36:12,394 INFO L138 BoogieDeclarations]: Found implementation of procedure uspace_ring_map [2025-03-04 11:36:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_unmap_user_pages [2025-03-04 11:36:12,394 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_unmap_user_pages [2025-03-04 11:36:12,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 11:36:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 11:36:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 11:36:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 11:36:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 11:36:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 11:36:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 11:36:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 11:36:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 11:36:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 11:36:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 11:36:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 11:36:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 11:36:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 11:36:12,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 11:36:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 11:36:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure hash_64 [2025-03-04 11:36:12,396 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_64 [2025-03-04 11:36:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_release_buffers [2025-03-04 11:36:12,396 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_release_buffers [2025-03-04 11:36:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 11:36:12,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 11:36:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2025-03-04 11:36:12,396 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2025-03-04 11:36:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_write [2025-03-04 11:36:12,396 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_write [2025-03-04 11:36:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 11:36:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 11:36:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 11:36:12,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 11:36:12,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_open [2025-03-04 11:36:12,397 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_open [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_destroy [2025-03-04 11:36:12,397 INFO L138 BoogieDeclarations]: Found implementation of procedure kmem_cache_destroy [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_tgt_cmd_to_host [2025-03-04 11:36:12,397 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_tgt_cmd_to_host [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-04 11:36:12,397 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_ring_idx_inc [2025-03-04 11:36:12,397 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_ring_idx_inc [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 11:36:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_head_event [2025-03-04 11:36:12,398 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_head_event [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_host_put [2025-03-04 11:36:12,398 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_host_put [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-04 11:36:12,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 11:36:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 11:36:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 11:36:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 11:36:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 11:36:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-04 11:36:12,399 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-04 11:36:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-03-04 11:36:12,399 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-03-04 11:36:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 11:36:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 11:36:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 11:36:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 11:36:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 11:36:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 11:36:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 11:36:12,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 11:36:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 11:36:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_ring_exit [2025-03-04 11:36:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_ring_exit [2025-03-04 11:36:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 11:36:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 11:36:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_tgt_cmd_destroy [2025-03-04 11:36:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_tgt_cmd_destroy [2025-03-04 11:36:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_ring_init [2025-03-04 11:36:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_ring_init [2025-03-04 11:36:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-03-04 11:36:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-03-04 11:36:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_free [2025-03-04 11:36:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure kmem_cache_free [2025-03-04 11:36:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_poll [2025-03-04 11:36:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_poll [2025-03-04 11:36:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-03-04 11:36:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-03-04 11:36:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_host_lookup [2025-03-04 11:36:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_host_lookup [2025-03-04 11:36:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_mmap [2025-03-04 11:36:12,400 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_mmap [2025-03-04 11:36:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:36:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:36:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 11:36:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 11:36:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 11:36:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 11:36:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 11:36:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 11:36:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-04 11:36:12,401 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-04 11:36:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:36:12,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:36:12,705 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:36:12,707 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:36:12,793 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8347: havoc vm_insert_page_#t~nondet448#1; [2025-03-04 11:36:12,794 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8213: havoc __phys_addr_#t~nondet427#1; [2025-03-04 11:36:12,807 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7298: havoc #t~mem304; [2025-03-04 11:36:12,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8259: havoc blk_rq_unmap_user_#t~nondet434#1; [2025-03-04 11:36:12,849 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6474: havoc #t~bitwise81; [2025-03-04 11:36:12,873 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6379: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-04 11:36:12,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8323: havoc #t~nondet444; [2025-03-04 11:36:13,167 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8255: havoc blk_rq_map_user_#t~nondet433#1; [2025-03-04 11:36:13,167 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8340: havoc scsi_init_io_#t~nondet447#1; [2025-03-04 11:36:13,168 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6451: havoc blk_rq_bytes_#t~mem77#1; [2025-03-04 11:36:13,184 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7613: call ULTIMATE.dealloc(~#__key~3#1.base, ~#__key~3#1.offset);havoc ~#__key~3#1.base, ~#__key~3#1.offset; [2025-03-04 11:36:13,184 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8272: havoc get_zeroed_page_#t~nondet436#1; [2025-03-04 11:36:13,223 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8236: havoc #t~nondet431; [2025-03-04 11:36:13,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8333: havoc #t~ret446.base, #t~ret446.offset; [2025-03-04 11:36:13,250 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8232: havoc #t~nondet430; [2025-03-04 11:36:14,109 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8319: havoc noop_llseek_#t~nondet443#1; [2025-03-04 11:36:14,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7072: call ULTIMATE.dealloc(scsi_tgt_init_~#__key~2#1.base, scsi_tgt_init_~#__key~2#1.offset);havoc scsi_tgt_init_~#__key~2#1.base, scsi_tgt_init_~#__key~2#1.offset; [2025-03-04 11:36:14,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8278: havoc kmem_cache_create_#t~ret438#1.base, kmem_cache_create_#t~ret438#1.offset; [2025-03-04 11:36:14,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8197: havoc __alloc_workqueue_key_#t~ret426#1.base, __alloc_workqueue_key_#t~ret426#1.offset; [2025-03-04 11:36:14,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8288: havoc ldv_tgt_fops_release_1_#t~nondet439#1; [2025-03-04 11:36:14,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8305: havoc misc_register_#t~nondet441#1; [2025-03-04 11:36:14,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8301: havoc misc_deregister_#t~nondet440#1; [2025-03-04 11:36:14,115 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6769: havoc #t~mem152.base, #t~mem152.offset; [2025-03-04 11:36:14,232 INFO L? ?]: Removed 647 outVars from TransFormulas that were not future-live. [2025-03-04 11:36:14,232 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:36:14,255 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:36:14,258 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 11:36:14,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:36:14 BoogieIcfgContainer [2025-03-04 11:36:14,261 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:36:14,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:36:14,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:36:14,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:36:14,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:36:10" (1/3) ... [2025-03-04 11:36:14,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a9d7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:36:14, skipping insertion in model container [2025-03-04 11:36:14,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12" (2/3) ... [2025-03-04 11:36:14,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a9d7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:36:14, skipping insertion in model container [2025-03-04 11:36:14,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:36:14" (3/3) ... [2025-03-04 11:36:14,269 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i [2025-03-04 11:36:14,280 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:36:14,282 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-03-04 11:36:14,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:36:14,344 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;@1f405531, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:36:14,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 11:36:14,350 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-03-04 11:36:14,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 11:36:14,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:14,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:14,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 11:36:14,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:14,363 INFO L85 PathProgramCache]: Analyzing trace with hash -54413280, now seen corresponding path program 1 times [2025-03-04 11:36:14,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:14,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606091798] [2025-03-04 11:36:14,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:14,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:14,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:36:14,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:36:14,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:14,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:14,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606091798] [2025-03-04 11:36:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606091798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:14,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:14,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:36:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098078059] [2025-03-04 11:36:14,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:14,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:14,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:14,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:14,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:14,846 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-03-04 11:36:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:15,000 INFO L93 Difference]: Finished difference Result 969 states and 1292 transitions. [2025-03-04 11:36:15,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:15,005 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-03-04 11:36:15,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:15,014 INFO L225 Difference]: With dead ends: 969 [2025-03-04 11:36:15,014 INFO L226 Difference]: Without dead ends: 504 [2025-03-04 11:36:15,022 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-03-04 11:36:15,023 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 135 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:15,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1082 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:36:15,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-04 11:36:15,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 499. [2025-03-04 11:36:15,089 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-03-04 11:36:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 654 transitions. [2025-03-04 11:36:15,101 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 654 transitions. Word has length 15 [2025-03-04 11:36:15,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:15,102 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 654 transitions. [2025-03-04 11:36:15,102 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-03-04 11:36:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 654 transitions. [2025-03-04 11:36:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 11:36:15,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:15,104 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-03-04 11:36:15,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:36:15,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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-03-04 11:36:15,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:15,106 INFO L85 PathProgramCache]: Analyzing trace with hash -366635269, now seen corresponding path program 1 times [2025-03-04 11:36:15,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:15,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378283594] [2025-03-04 11:36:15,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:15,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:15,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 11:36:15,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 11:36:15,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:15,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:15,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:15,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378283594] [2025-03-04 11:36:15,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378283594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:15,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:15,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:36:15,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454849167] [2025-03-04 11:36:15,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:15,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:15,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:15,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:15,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:15,389 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-03-04 11:36:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:15,956 INFO L93 Difference]: Finished difference Result 1374 states and 1803 transitions. [2025-03-04 11:36:15,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:15,962 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-03-04 11:36:15,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:15,970 INFO L225 Difference]: With dead ends: 1374 [2025-03-04 11:36:15,970 INFO L226 Difference]: Without dead ends: 878 [2025-03-04 11:36:15,971 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-03-04 11:36:15,972 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 522 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:15,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1391 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:36:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-03-04 11:36:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 855. [2025-03-04 11:36:16,022 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-03-04 11:36:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1128 transitions. [2025-03-04 11:36:16,032 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1128 transitions. Word has length 20 [2025-03-04 11:36:16,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:16,032 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1128 transitions. [2025-03-04 11:36:16,032 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-03-04 11:36:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1128 transitions. [2025-03-04 11:36:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 11:36:16,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:16,034 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-03-04 11:36:16,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:36:16,034 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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-03-04 11:36:16,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:16,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1962561092, now seen corresponding path program 1 times [2025-03-04 11:36:16,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:16,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692024227] [2025-03-04 11:36:16,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:16,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:16,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 11:36:16,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 11:36:16,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:16,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:16,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:16,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692024227] [2025-03-04 11:36:16,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692024227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:16,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:16,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:36:16,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530627771] [2025-03-04 11:36:16,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:16,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:36:16,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:16,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:36:16,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:36:16,266 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-03-04 11:36:16,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:16,834 INFO L93 Difference]: Finished difference Result 1713 states and 2261 transitions. [2025-03-04 11:36:16,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:36:16,835 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-03-04 11:36:16,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:16,840 INFO L225 Difference]: With dead ends: 1713 [2025-03-04 11:36:16,840 INFO L226 Difference]: Without dead ends: 855 [2025-03-04 11:36:16,842 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-03-04 11:36:16,844 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 1 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:16,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1601 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:36:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-04 11:36:16,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2025-03-04 11:36:16,874 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-03-04 11:36:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1126 transitions. [2025-03-04 11:36:16,880 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1126 transitions. Word has length 38 [2025-03-04 11:36:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:16,880 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1126 transitions. [2025-03-04 11:36:16,880 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-03-04 11:36:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1126 transitions. [2025-03-04 11:36:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 11:36:16,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:16,881 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-03-04 11:36:16,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:36:16,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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-03-04 11:36:16,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1384866723, now seen corresponding path program 1 times [2025-03-04 11:36:16,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:16,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524161277] [2025-03-04 11:36:16,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:16,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:16,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:36:17,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:36:17,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:17,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:36:17,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:17,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524161277] [2025-03-04 11:36:17,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524161277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:17,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:17,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:36:17,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080263609] [2025-03-04 11:36:17,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:17,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:17,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:17,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:17,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:17,132 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-03-04 11:36:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:17,181 INFO L93 Difference]: Finished difference Result 1727 states and 2285 transitions. [2025-03-04 11:36:17,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:17,182 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-03-04 11:36:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:17,186 INFO L225 Difference]: With dead ends: 1727 [2025-03-04 11:36:17,186 INFO L226 Difference]: Without dead ends: 875 [2025-03-04 11:36:17,188 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-03-04 11:36:17,188 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 4 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:17,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1064 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-03-04 11:36:17,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 867. [2025-03-04 11:36:17,211 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-03-04 11:36:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1140 transitions. [2025-03-04 11:36:17,216 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1140 transitions. Word has length 43 [2025-03-04 11:36:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:17,216 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1140 transitions. [2025-03-04 11:36:17,217 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-03-04 11:36:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1140 transitions. [2025-03-04 11:36:17,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 11:36:17,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:17,218 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-03-04 11:36:17,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:36:17,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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-03-04 11:36:17,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:17,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1819840749, now seen corresponding path program 1 times [2025-03-04 11:36:17,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:17,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054977636] [2025-03-04 11:36:17,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:17,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:17,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 11:36:17,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 11:36:17,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:17,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:36:17,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:17,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054977636] [2025-03-04 11:36:17,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054977636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:17,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11168935] [2025-03-04 11:36:17,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:17,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:17,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:17,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:17,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:36:17,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 11:36:17,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 11:36:17,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:17,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:17,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:17,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:36:17,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:36:17,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11168935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:17,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:36:17,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:36:17,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495109378] [2025-03-04 11:36:17,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:17,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:36:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:17,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:36:17,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:36:17,922 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-03-04 11:36:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:17,961 INFO L93 Difference]: Finished difference Result 879 states and 1158 transitions. [2025-03-04 11:36:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:36:17,961 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-03-04 11:36:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:17,965 INFO L225 Difference]: With dead ends: 879 [2025-03-04 11:36:17,966 INFO L226 Difference]: Without dead ends: 878 [2025-03-04 11:36:17,966 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-03-04 11:36:17,967 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 7 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:17,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1073 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-03-04 11:36:18,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 866. [2025-03-04 11:36:18,003 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-03-04 11:36:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1138 transitions. [2025-03-04 11:36:18,008 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1138 transitions. Word has length 49 [2025-03-04 11:36:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:18,008 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1138 transitions. [2025-03-04 11:36:18,008 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-03-04 11:36:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1138 transitions. [2025-03-04 11:36:18,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 11:36:18,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:18,009 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-03-04 11:36:18,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:18,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:18,210 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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-03-04 11:36:18,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:18,211 INFO L85 PathProgramCache]: Analyzing trace with hash -580488039, now seen corresponding path program 1 times [2025-03-04 11:36:18,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:18,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997416485] [2025-03-04 11:36:18,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:18,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:36:18,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:36:18,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:18,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:36:18,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:18,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997416485] [2025-03-04 11:36:18,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997416485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:18,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196746642] [2025-03-04 11:36:18,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:18,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:18,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:18,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:18,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:36:18,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:36:18,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:36:18,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:18,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:18,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:18,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:36:18,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:36:18,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196746642] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:18,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:18,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:36:18,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687442461] [2025-03-04 11:36:18,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:18,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:36:18,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:18,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:36:18,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:18,914 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-03-04 11:36:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:18,968 INFO L93 Difference]: Finished difference Result 900 states and 1190 transitions. [2025-03-04 11:36:18,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:36:18,969 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-03-04 11:36:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:18,973 INFO L225 Difference]: With dead ends: 900 [2025-03-04 11:36:18,973 INFO L226 Difference]: Without dead ends: 899 [2025-03-04 11:36:18,973 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-03-04 11:36:18,974 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 12 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:18,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2640 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:18,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-03-04 11:36:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 855. [2025-03-04 11:36:18,995 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-03-04 11:36:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1124 transitions. [2025-03-04 11:36:18,999 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1124 transitions. Word has length 50 [2025-03-04 11:36:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:19,000 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1124 transitions. [2025-03-04 11:36:19,000 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-03-04 11:36:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1124 transitions. [2025-03-04 11:36:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 11:36:19,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:19,002 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-03-04 11:36:19,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:36:19,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 11:36:19,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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-03-04 11:36:19,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:19,206 INFO L85 PathProgramCache]: Analyzing trace with hash -442525310, now seen corresponding path program 1 times [2025-03-04 11:36:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:19,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794066542] [2025-03-04 11:36:19,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:19,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:19,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 11:36:19,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:36:19,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:19,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:36:19,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:19,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794066542] [2025-03-04 11:36:19,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794066542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:19,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:19,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:36:19,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572878874] [2025-03-04 11:36:19,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:19,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:19,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:19,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:19,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:19,389 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-03-04 11:36:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:19,433 INFO L93 Difference]: Finished difference Result 1722 states and 2273 transitions. [2025-03-04 11:36:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:19,433 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-03-04 11:36:19,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:19,437 INFO L225 Difference]: With dead ends: 1722 [2025-03-04 11:36:19,437 INFO L226 Difference]: Without dead ends: 870 [2025-03-04 11:36:19,439 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-03-04 11:36:19,440 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 1 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:19,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1058 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:19,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-04 11:36:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2025-03-04 11:36:19,464 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-03-04 11:36:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1139 transitions. [2025-03-04 11:36:19,470 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1139 transitions. Word has length 51 [2025-03-04 11:36:19,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:19,471 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1139 transitions. [2025-03-04 11:36:19,471 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-03-04 11:36:19,471 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1139 transitions. [2025-03-04 11:36:19,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:36:19,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:19,473 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-03-04 11:36:19,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:36:19,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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-03-04 11:36:19,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:19,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1147372815, now seen corresponding path program 1 times [2025-03-04 11:36:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:19,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936053629] [2025-03-04 11:36:19,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:19,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:19,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:36:19,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:36:19,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:19,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:19,677 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:36:19,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:19,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936053629] [2025-03-04 11:36:19,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936053629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:19,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794552410] [2025-03-04 11:36:19,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:19,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:19,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:19,679 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:19,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:36:20,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:36:20,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:36:20,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:20,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:20,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:36:20,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:36:20,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:36:20,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794552410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:20,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:36:20,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-04 11:36:20,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133416697] [2025-03-04 11:36:20,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:20,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:36:20,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:20,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:36:20,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:20,130 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-03-04 11:36:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:20,751 INFO L93 Difference]: Finished difference Result 1747 states and 2289 transitions. [2025-03-04 11:36:20,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:36:20,752 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-03-04 11:36:20,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:20,757 INFO L225 Difference]: With dead ends: 1747 [2025-03-04 11:36:20,757 INFO L226 Difference]: Without dead ends: 870 [2025-03-04 11:36:20,760 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-03-04 11:36:20,761 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 1 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:20,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2118 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:36:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-04 11:36:20,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2025-03-04 11:36:20,784 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-03-04 11:36:20,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1137 transitions. [2025-03-04 11:36:20,789 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1137 transitions. Word has length 56 [2025-03-04 11:36:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:20,789 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1137 transitions. [2025-03-04 11:36:20,789 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-03-04 11:36:20,789 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1137 transitions. [2025-03-04 11:36:20,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 11:36:20,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:20,791 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-03-04 11:36:20,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:20,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:20,991 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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-03-04 11:36:20,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:20,992 INFO L85 PathProgramCache]: Analyzing trace with hash 165195243, now seen corresponding path program 1 times [2025-03-04 11:36:20,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:20,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382698097] [2025-03-04 11:36:20,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:20,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:21,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 11:36:21,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 11:36:21,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:21,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:36:21,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:21,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382698097] [2025-03-04 11:36:21,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382698097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:21,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767302491] [2025-03-04 11:36:21,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:21,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:21,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:21,233 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:21,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:36:21,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 11:36:21,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 11:36:21,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:21,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:21,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:36:21,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:36:21,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:36:21,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767302491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:21,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:36:21,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3] total 9 [2025-03-04 11:36:21,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613596664] [2025-03-04 11:36:21,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:21,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:36:21,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:21,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:36:21,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:36:21,730 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-03-04 11:36:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:21,806 INFO L93 Difference]: Finished difference Result 1755 states and 2299 transitions. [2025-03-04 11:36:21,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:36:21,806 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-03-04 11:36:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:21,810 INFO L225 Difference]: With dead ends: 1755 [2025-03-04 11:36:21,810 INFO L226 Difference]: Without dead ends: 888 [2025-03-04 11:36:21,812 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-03-04 11:36:21,813 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 1 mSDsluCounter, 2668 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3208 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:21,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3208 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-03-04 11:36:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 882. [2025-03-04 11:36:21,832 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-03-04 11:36:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1151 transitions. [2025-03-04 11:36:21,836 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1151 transitions. Word has length 78 [2025-03-04 11:36:21,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:21,836 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1151 transitions. [2025-03-04 11:36:21,837 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-03-04 11:36:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1151 transitions. [2025-03-04 11:36:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 11:36:21,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:21,837 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-03-04 11:36:21,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:36:22,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:22,038 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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-03-04 11:36:22,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1669716032, now seen corresponding path program 1 times [2025-03-04 11:36:22,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:22,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453358146] [2025-03-04 11:36:22,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:22,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:22,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 11:36:22,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 11:36:22,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:22,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 11:36:22,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:22,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453358146] [2025-03-04 11:36:22,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453358146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:22,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:22,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:36:22,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809443742] [2025-03-04 11:36:22,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:22,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:36:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:22,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:36:22,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:36:22,234 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-03-04 11:36:22,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:22,299 INFO L93 Difference]: Finished difference Result 1761 states and 2299 transitions. [2025-03-04 11:36:22,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:36:22,300 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-03-04 11:36:22,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:22,307 INFO L225 Difference]: With dead ends: 1761 [2025-03-04 11:36:22,307 INFO L226 Difference]: Without dead ends: 882 [2025-03-04 11:36:22,310 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-03-04 11:36:22,310 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:22,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2118 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-04 11:36:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2025-03-04 11:36:22,336 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-03-04 11:36:22,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1149 transitions. [2025-03-04 11:36:22,340 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1149 transitions. Word has length 77 [2025-03-04 11:36:22,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:22,340 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1149 transitions. [2025-03-04 11:36:22,340 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-03-04 11:36:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1149 transitions. [2025-03-04 11:36:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:36:22,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:22,341 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-03-04 11:36:22,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 11:36:22,341 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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-03-04 11:36:22,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:22,342 INFO L85 PathProgramCache]: Analyzing trace with hash 248138937, now seen corresponding path program 1 times [2025-03-04 11:36:22,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:22,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498690144] [2025-03-04 11:36:22,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:22,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:22,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:36:22,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:36:22,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:22,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 11:36:22,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:22,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498690144] [2025-03-04 11:36:22,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498690144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:22,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56164178] [2025-03-04 11:36:22,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:22,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:22,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:22,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:22,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:36:22,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:36:23,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:36:23,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:23,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:23,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:23,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 11:36:23,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:36:23,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56164178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:23,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:36:23,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:36:23,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692408485] [2025-03-04 11:36:23,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:23,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:36:23,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:23,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:36:23,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:36:23,031 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-03-04 11:36:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:23,060 INFO L93 Difference]: Finished difference Result 882 states and 1149 transitions. [2025-03-04 11:36:23,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:36:23,060 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-03-04 11:36:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:23,064 INFO L225 Difference]: With dead ends: 882 [2025-03-04 11:36:23,064 INFO L226 Difference]: Without dead ends: 881 [2025-03-04 11:36:23,064 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-03-04 11:36:23,065 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 1 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1579 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-03-04 11:36:23,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1579 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-04 11:36:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-03-04 11:36:23,082 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-03-04 11:36:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1146 transitions. [2025-03-04 11:36:23,086 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1146 transitions. Word has length 86 [2025-03-04 11:36:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:23,086 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1146 transitions. [2025-03-04 11:36:23,086 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-03-04 11:36:23,086 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1146 transitions. [2025-03-04 11:36:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 11:36:23,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:23,087 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-03-04 11:36:23,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:23,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:36:23,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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-03-04 11:36:23,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash -897627500, now seen corresponding path program 1 times [2025-03-04 11:36:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:23,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775319453] [2025-03-04 11:36:23,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:23,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:23,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 11:36:23,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 11:36:23,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:23,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 11:36:23,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775319453] [2025-03-04 11:36:23,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775319453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:23,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200262819] [2025-03-04 11:36:23,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:23,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:23,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:23,504 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:23,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:36:23,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 11:36:23,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 11:36:23,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:23,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:23,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:23,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 11:36:23,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 11:36:24,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200262819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:24,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:24,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:36:24,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909098472] [2025-03-04 11:36:24,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:24,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:36:24,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:24,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:36:24,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:24,039 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-03-04 11:36:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:24,076 INFO L93 Difference]: Finished difference Result 899 states and 1173 transitions. [2025-03-04 11:36:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:36:24,076 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-03-04 11:36:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:24,080 INFO L225 Difference]: With dead ends: 899 [2025-03-04 11:36:24,080 INFO L226 Difference]: Without dead ends: 872 [2025-03-04 11:36:24,080 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-03-04 11:36:24,080 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 0 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2630 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:24,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2630 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-04 11:36:24,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 852. [2025-03-04 11:36:24,096 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-03-04 11:36:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1112 transitions. [2025-03-04 11:36:24,099 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1112 transitions. Word has length 87 [2025-03-04 11:36:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:24,099 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1112 transitions. [2025-03-04 11:36:24,100 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-03-04 11:36:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1112 transitions. [2025-03-04 11:36:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 11:36:24,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:24,101 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-03-04 11:36:24,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:24,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:24,301 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 11:36:24,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:24,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2083642984, now seen corresponding path program 1 times [2025-03-04 11:36:24,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:24,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652062102] [2025-03-04 11:36:24,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:24,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:24,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 11:36:24,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 11:36:24,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:24,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 11:36:24,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:24,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652062102] [2025-03-04 11:36:24,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652062102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:24,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:24,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:36:24,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82879853] [2025-03-04 11:36:24,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:24,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:24,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:24,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:24,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:24,488 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-03-04 11:36:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:24,828 INFO L93 Difference]: Finished difference Result 2396 states and 3130 transitions. [2025-03-04 11:36:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:24,828 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-03-04 11:36:24,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:24,834 INFO L225 Difference]: With dead ends: 2396 [2025-03-04 11:36:24,834 INFO L226 Difference]: Without dead ends: 1547 [2025-03-04 11:36:24,836 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-03-04 11:36:24,837 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 478 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:24,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1101 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:36:24,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-03-04 11:36:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1544. [2025-03-04 11:36:24,867 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-03-04 11:36:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2000 transitions. [2025-03-04 11:36:24,871 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2000 transitions. Word has length 95 [2025-03-04 11:36:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:24,872 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2000 transitions. [2025-03-04 11:36:24,872 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-03-04 11:36:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2000 transitions. [2025-03-04 11:36:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 11:36:24,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:24,873 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-03-04 11:36:24,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 11:36:24,873 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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-03-04 11:36:24,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:24,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1917045367, now seen corresponding path program 1 times [2025-03-04 11:36:24,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:24,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306948425] [2025-03-04 11:36:24,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:24,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:24,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 11:36:24,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 11:36:24,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:24,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 11:36:25,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306948425] [2025-03-04 11:36:25,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306948425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:25,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:25,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:36:25,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470059688] [2025-03-04 11:36:25,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:25,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:25,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:25,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:25,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:25,076 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-03-04 11:36:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:25,117 INFO L93 Difference]: Finished difference Result 3121 states and 4073 transitions. [2025-03-04 11:36:25,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:25,117 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-03-04 11:36:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:25,124 INFO L225 Difference]: With dead ends: 3121 [2025-03-04 11:36:25,124 INFO L226 Difference]: Without dead ends: 1580 [2025-03-04 11:36:25,128 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-03-04 11:36:25,128 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 3 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:25,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1038 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-03-04 11:36:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1572. [2025-03-04 11:36:25,166 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-03-04 11:36:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2032 transitions. [2025-03-04 11:36:25,173 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2032 transitions. Word has length 100 [2025-03-04 11:36:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:25,173 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2032 transitions. [2025-03-04 11:36:25,173 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-03-04 11:36:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2032 transitions. [2025-03-04 11:36:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 11:36:25,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:25,176 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-03-04 11:36:25,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:36:25,177 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 11:36:25,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:25,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1255251146, now seen corresponding path program 1 times [2025-03-04 11:36:25,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:25,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561997872] [2025-03-04 11:36:25,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:25,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:25,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 11:36:25,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 11:36:25,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:25,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 11:36:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:25,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561997872] [2025-03-04 11:36:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561997872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:25,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:25,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:36:25,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392326154] [2025-03-04 11:36:25,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:25,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:25,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:25,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:25,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:25,364 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-03-04 11:36:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:25,454 INFO L93 Difference]: Finished difference Result 2413 states and 3107 transitions. [2025-03-04 11:36:25,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:25,455 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-03-04 11:36:25,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:25,467 INFO L225 Difference]: With dead ends: 2413 [2025-03-04 11:36:25,467 INFO L226 Difference]: Without dead ends: 2411 [2025-03-04 11:36:25,468 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-03-04 11:36:25,469 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 458 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:25,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1047 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2025-03-04 11:36:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2409. [2025-03-04 11:36:25,524 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-03-04 11:36:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 3103 transitions. [2025-03-04 11:36:25,533 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 3103 transitions. Word has length 99 [2025-03-04 11:36:25,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:25,533 INFO L471 AbstractCegarLoop]: Abstraction has 2409 states and 3103 transitions. [2025-03-04 11:36:25,533 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-03-04 11:36:25,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 3103 transitions. [2025-03-04 11:36:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 11:36:25,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:25,534 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-03-04 11:36:25,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:36:25,535 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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-03-04 11:36:25,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:25,535 INFO L85 PathProgramCache]: Analyzing trace with hash -231054466, now seen corresponding path program 1 times [2025-03-04 11:36:25,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:25,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827545558] [2025-03-04 11:36:25,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:25,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:25,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:36:25,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:36:25,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:25,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 11:36:25,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:25,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827545558] [2025-03-04 11:36:25,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827545558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:25,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280080013] [2025-03-04 11:36:25,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:25,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:25,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:25,726 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:25,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:36:26,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:36:26,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:36:26,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:26,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:26,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1362 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:36:26,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 11:36:26,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:36:26,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280080013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:26,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:36:26,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-04 11:36:26,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087278513] [2025-03-04 11:36:26,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:26,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:36:26,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:26,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:36:26,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:26,320 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-03-04 11:36:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:26,407 INFO L93 Difference]: Finished difference Result 4730 states and 6104 transitions. [2025-03-04 11:36:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:36:26,407 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-03-04 11:36:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:26,417 INFO L225 Difference]: With dead ends: 4730 [2025-03-04 11:36:26,418 INFO L226 Difference]: Without dead ends: 2429 [2025-03-04 11:36:26,423 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-03-04 11:36:26,424 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:26,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2082 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2025-03-04 11:36:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2419. [2025-03-04 11:36:26,487 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-03-04 11:36:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 3113 transitions. [2025-03-04 11:36:26,493 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 3113 transitions. Word has length 107 [2025-03-04 11:36:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:26,494 INFO L471 AbstractCegarLoop]: Abstraction has 2419 states and 3113 transitions. [2025-03-04 11:36:26,494 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-03-04 11:36:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 3113 transitions. [2025-03-04 11:36:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 11:36:26,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:26,495 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-03-04 11:36:26,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:36:26,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:26,696 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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-03-04 11:36:26,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:26,696 INFO L85 PathProgramCache]: Analyzing trace with hash 4483571, now seen corresponding path program 1 times [2025-03-04 11:36:26,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:26,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875481839] [2025-03-04 11:36:26,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:26,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:26,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:36:26,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:36:26,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:26,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:26,889 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 11:36:26,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:26,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875481839] [2025-03-04 11:36:26,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875481839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:26,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33492166] [2025-03-04 11:36:26,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:26,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:26,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:26,893 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:26,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:36:27,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:36:27,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:36:27,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:27,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:27,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:27,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 11:36:27,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:36:27,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33492166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:27,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:36:27,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:36:27,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637397145] [2025-03-04 11:36:27,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:27,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:36:27,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:27,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:36:27,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:36:27,509 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-03-04 11:36:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:27,554 INFO L93 Difference]: Finished difference Result 2443 states and 3149 transitions. [2025-03-04 11:36:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:36:27,555 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-03-04 11:36:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:27,566 INFO L225 Difference]: With dead ends: 2443 [2025-03-04 11:36:27,566 INFO L226 Difference]: Without dead ends: 2442 [2025-03-04 11:36:27,567 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-03-04 11:36:27,567 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 5 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1559 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-03-04 11:36:27,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1559 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-03-04 11:36:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2418. [2025-03-04 11:36:27,625 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-03-04 11:36:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3107 transitions. [2025-03-04 11:36:27,631 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3107 transitions. Word has length 106 [2025-03-04 11:36:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:27,632 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3107 transitions. [2025-03-04 11:36:27,632 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-03-04 11:36:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3107 transitions. [2025-03-04 11:36:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 11:36:27,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:27,633 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-03-04 11:36:27,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:27,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:36:27,834 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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-03-04 11:36:27,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:27,835 INFO L85 PathProgramCache]: Analyzing trace with hash 138990682, now seen corresponding path program 1 times [2025-03-04 11:36:27,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:27,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822569254] [2025-03-04 11:36:27,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:27,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:27,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:36:27,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:36:27,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:27,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 11:36:28,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:28,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822569254] [2025-03-04 11:36:28,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822569254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:28,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878397415] [2025-03-04 11:36:28,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:28,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:28,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:28,061 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:28,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:36:28,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:36:28,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:36:28,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:28,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:28,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:28,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 11:36:28,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 11:36:28,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878397415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:28,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:28,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:36:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658149743] [2025-03-04 11:36:28,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:28,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:36:28,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:28,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:36:28,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:28,727 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-03-04 11:36:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:28,779 INFO L93 Difference]: Finished difference Result 2502 states and 3233 transitions. [2025-03-04 11:36:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:36:28,780 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-03-04 11:36:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:28,789 INFO L225 Difference]: With dead ends: 2502 [2025-03-04 11:36:28,789 INFO L226 Difference]: Without dead ends: 2501 [2025-03-04 11:36:28,790 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-03-04 11:36:28,791 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 8 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:28,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2072 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2025-03-04 11:36:28,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2381. [2025-03-04 11:36:28,852 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-03-04 11:36:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3059 transitions. [2025-03-04 11:36:28,862 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3059 transitions. Word has length 107 [2025-03-04 11:36:28,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:28,862 INFO L471 AbstractCegarLoop]: Abstraction has 2381 states and 3059 transitions. [2025-03-04 11:36:28,863 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-03-04 11:36:28,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3059 transitions. [2025-03-04 11:36:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 11:36:28,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:28,865 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-03-04 11:36:28,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:29,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:36:29,065 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 11:36:29,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:29,066 INFO L85 PathProgramCache]: Analyzing trace with hash 922802102, now seen corresponding path program 1 times [2025-03-04 11:36:29,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:29,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613378187] [2025-03-04 11:36:29,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:29,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:29,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 11:36:29,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 11:36:29,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:29,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 11:36:29,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:29,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613378187] [2025-03-04 11:36:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613378187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918252256] [2025-03-04 11:36:29,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:29,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:29,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:29,307 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:29,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:36:29,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 11:36:29,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 11:36:29,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:29,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:29,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:29,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 11:36:29,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:36:29,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918252256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:29,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:36:29,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:36:29,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159036798] [2025-03-04 11:36:29,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:29,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:36:29,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:29,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:36:29,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:36:29,956 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-03-04 11:36:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:30,650 INFO L93 Difference]: Finished difference Result 3103 states and 3989 transitions. [2025-03-04 11:36:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:36:30,651 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-03-04 11:36:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:30,661 INFO L225 Difference]: With dead ends: 3103 [2025-03-04 11:36:30,661 INFO L226 Difference]: Without dead ends: 3101 [2025-03-04 11:36:30,662 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-03-04 11:36:30,662 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 958 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:30,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 1339 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:36:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2025-03-04 11:36:30,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 2379. [2025-03-04 11:36:30,728 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-03-04 11:36:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3055 transitions. [2025-03-04 11:36:30,762 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3055 transitions. Word has length 112 [2025-03-04 11:36:30,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:30,763 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 3055 transitions. [2025-03-04 11:36:30,764 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-03-04 11:36:30,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3055 transitions. [2025-03-04 11:36:30,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 11:36:30,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:30,766 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-03-04 11:36:30,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:30,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:30,967 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 11:36:30,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1457905352, now seen corresponding path program 1 times [2025-03-04 11:36:30,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:30,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463558849] [2025-03-04 11:36:30,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:30,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:31,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 11:36:31,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 11:36:31,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:31,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 11:36:31,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:31,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463558849] [2025-03-04 11:36:31,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463558849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:31,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763797087] [2025-03-04 11:36:31,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:31,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:31,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:31,205 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:31,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:36:31,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 11:36:31,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 11:36:31,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:31,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:31,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:31,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 11:36:31,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 11:36:31,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763797087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:31,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:31,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:36:31,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844257148] [2025-03-04 11:36:31,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:31,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:36:31,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:31,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:36:31,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:31,946 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-03-04 11:36:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:32,982 INFO L93 Difference]: Finished difference Result 4647 states and 5978 transitions. [2025-03-04 11:36:32,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:36:32,983 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-03-04 11:36:32,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:33,005 INFO L225 Difference]: With dead ends: 4647 [2025-03-04 11:36:33,005 INFO L226 Difference]: Without dead ends: 4645 [2025-03-04 11:36:33,007 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-03-04 11:36:33,007 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 2737 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2737 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:33,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2737 Valid, 1947 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:36:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2025-03-04 11:36:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 3923. [2025-03-04 11:36:33,110 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-03-04 11:36:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 5044 transitions. [2025-03-04 11:36:33,120 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 5044 transitions. Word has length 113 [2025-03-04 11:36:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:33,120 INFO L471 AbstractCegarLoop]: Abstraction has 3923 states and 5044 transitions. [2025-03-04 11:36:33,121 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-03-04 11:36:33,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 5044 transitions. [2025-03-04 11:36:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 11:36:33,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:33,125 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-03-04 11:36:33,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:33,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:33,326 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 11:36:33,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1416031263, now seen corresponding path program 1 times [2025-03-04 11:36:33,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:33,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190602129] [2025-03-04 11:36:33,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:33,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:33,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 11:36:33,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 11:36:33,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:33,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-04 11:36:33,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:33,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190602129] [2025-03-04 11:36:33,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190602129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:33,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:33,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:36:33,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909883388] [2025-03-04 11:36:33,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:33,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:33,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:33,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:33,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:33,516 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-03-04 11:36:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:34,113 INFO L93 Difference]: Finished difference Result 7524 states and 9694 transitions. [2025-03-04 11:36:34,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:34,113 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-03-04 11:36:34,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:34,129 INFO L225 Difference]: With dead ends: 7524 [2025-03-04 11:36:34,129 INFO L226 Difference]: Without dead ends: 3711 [2025-03-04 11:36:34,136 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-03-04 11:36:34,137 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 471 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:34,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1441 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:36:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2025-03-04 11:36:34,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3709. [2025-03-04 11:36:34,233 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-03-04 11:36:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 4742 transitions. [2025-03-04 11:36:34,242 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 4742 transitions. Word has length 135 [2025-03-04 11:36:34,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:34,243 INFO L471 AbstractCegarLoop]: Abstraction has 3709 states and 4742 transitions. [2025-03-04 11:36:34,243 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-03-04 11:36:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 4742 transitions. [2025-03-04 11:36:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-04 11:36:34,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:34,251 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-03-04 11:36:34,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:36:34,251 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 11:36:34,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:34,251 INFO L85 PathProgramCache]: Analyzing trace with hash -241928315, now seen corresponding path program 1 times [2025-03-04 11:36:34,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:34,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825492817] [2025-03-04 11:36:34,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:34,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:34,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 11:36:34,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 11:36:34,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:34,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-04 11:36:34,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:34,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825492817] [2025-03-04 11:36:34,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825492817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:34,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:34,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:36:34,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325574789] [2025-03-04 11:36:34,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:34,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:34,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:34,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:34,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:34,518 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-03-04 11:36:34,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:34,941 INFO L93 Difference]: Finished difference Result 7416 states and 9481 transitions. [2025-03-04 11:36:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:34,942 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-03-04 11:36:34,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:34,954 INFO L225 Difference]: With dead ends: 7416 [2025-03-04 11:36:34,954 INFO L226 Difference]: Without dead ends: 3045 [2025-03-04 11:36:34,961 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-03-04 11:36:34,963 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 422 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:34,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1091 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:36:34,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2025-03-04 11:36:35,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 3044. [2025-03-04 11:36:35,033 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-03-04 11:36:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 3870 transitions. [2025-03-04 11:36:35,041 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 3870 transitions. Word has length 228 [2025-03-04 11:36:35,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:35,042 INFO L471 AbstractCegarLoop]: Abstraction has 3044 states and 3870 transitions. [2025-03-04 11:36:35,042 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-03-04 11:36:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 3870 transitions. [2025-03-04 11:36:35,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-04 11:36:35,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:35,048 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-03-04 11:36:35,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 11:36:35,048 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 11:36:35,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:35,049 INFO L85 PathProgramCache]: Analyzing trace with hash -374252060, now seen corresponding path program 1 times [2025-03-04 11:36:35,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:35,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108528841] [2025-03-04 11:36:35,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:35,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:35,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 11:36:35,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 11:36:35,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:35,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-04 11:36:35,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:35,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108528841] [2025-03-04 11:36:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108528841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:35,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:35,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:36:35,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855723989] [2025-03-04 11:36:35,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:35,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:36:35,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:35,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:36:35,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:36:35,287 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-03-04 11:36:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:35,396 INFO L93 Difference]: Finished difference Result 6097 states and 7752 transitions. [2025-03-04 11:36:35,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:36:35,399 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-03-04 11:36:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:35,411 INFO L225 Difference]: With dead ends: 6097 [2025-03-04 11:36:35,411 INFO L226 Difference]: Without dead ends: 3050 [2025-03-04 11:36:35,416 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-03-04 11:36:35,417 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 517 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:35,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1032 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3050 states. [2025-03-04 11:36:35,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3050 to 3044. [2025-03-04 11:36:35,517 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-03-04 11:36:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 3867 transitions. [2025-03-04 11:36:35,524 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 3867 transitions. Word has length 228 [2025-03-04 11:36:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:35,525 INFO L471 AbstractCegarLoop]: Abstraction has 3044 states and 3867 transitions. [2025-03-04 11:36:35,525 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-03-04 11:36:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 3867 transitions. [2025-03-04 11:36:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 11:36:35,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:35,530 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-03-04 11:36:35,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 11:36:35,530 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 11:36:35,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:35,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1813571220, now seen corresponding path program 1 times [2025-03-04 11:36:35,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:35,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754418225] [2025-03-04 11:36:35,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:35,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:35,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 11:36:35,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 11:36:35,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:35,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-04 11:36:35,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:35,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754418225] [2025-03-04 11:36:35,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754418225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:35,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:35,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:36:35,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859066442] [2025-03-04 11:36:35,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:35,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:36:35,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:35,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:36:35,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:36:35,757 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-03-04 11:36:35,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:35,890 INFO L93 Difference]: Finished difference Result 6000 states and 7634 transitions. [2025-03-04 11:36:35,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:36:35,890 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-03-04 11:36:35,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:35,902 INFO L225 Difference]: With dead ends: 6000 [2025-03-04 11:36:35,902 INFO L226 Difference]: Without dead ends: 3048 [2025-03-04 11:36:35,907 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-03-04 11:36:35,908 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 0 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:35,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1544 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states. [2025-03-04 11:36:36,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 3048. [2025-03-04 11:36:36,027 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-03-04 11:36:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 3870 transitions. [2025-03-04 11:36:36,038 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 3870 transitions. Word has length 237 [2025-03-04 11:36:36,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:36,038 INFO L471 AbstractCegarLoop]: Abstraction has 3048 states and 3870 transitions. [2025-03-04 11:36:36,039 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-03-04 11:36:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 3870 transitions. [2025-03-04 11:36:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-04 11:36:36,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:36,045 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-03-04 11:36:36,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 11:36:36,045 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 11:36:36,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:36,046 INFO L85 PathProgramCache]: Analyzing trace with hash -443046877, now seen corresponding path program 1 times [2025-03-04 11:36:36,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:36,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354914678] [2025-03-04 11:36:36,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:36,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:36,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-04 11:36:36,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-04 11:36:36,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:36,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-04 11:36:36,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:36,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354914678] [2025-03-04 11:36:36,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354914678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:36,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:36,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:36:36,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072082874] [2025-03-04 11:36:36,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:36,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:36,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:36,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:36,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:36,297 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-03-04 11:36:36,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:36,744 INFO L93 Difference]: Finished difference Result 3168 states and 4006 transitions. [2025-03-04 11:36:36,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:36,745 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-03-04 11:36:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:36,754 INFO L225 Difference]: With dead ends: 3168 [2025-03-04 11:36:36,758 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:36:36,769 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-03-04 11:36:36,769 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:36,770 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.4s Time] [2025-03-04 11:36:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:36:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:36:36,770 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-03-04 11:36:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:36:36,774 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 258 [2025-03-04 11:36:36,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:36,774 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:36:36,774 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-03-04 11:36:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:36:36,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:36:36,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-04 11:36:36,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-04 11:36:36,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-04 11:36:36,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-04 11:36:36,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_initErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-04 11:36:36,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_initErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-04 11:36:36,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-04 11:36:36,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-04 11:36:36,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-04 11:36:36,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-04 11:36:36,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 11:36:36,778 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-03-04 11:36:36,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:36:40,992 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:36:40,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:36:40 BoogieIcfgContainer [2025-03-04 11:36:40,996 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:36:40,997 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:36:40,997 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:36:40,997 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:36:40,998 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:36:14" (3/4) ... [2025-03-04 11:36:40,999 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_ring_idx_inc [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __raw_spin_lock_init [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_ring_exit [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure uspace_ring_map [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure scsi_tgt_cmd_destroy [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_write [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_ring_init [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure list_del [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kmem_cache_free [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_head_event [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_poll [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure scsi_unmap_user_pages [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _raw_spin_lock_irqsave [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure scsi_host_put [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure hash_64 [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~int [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_open [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure scsi_host_lookup [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_mmap [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure scsi_release_buffers [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kmem_cache_destroy [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure spin_unlock_irqrestore [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure destroy_workqueue [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _copy_from_user [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure list_add [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure scsi_tgt_cmd_to_host [2025-03-04 11:36:41,004 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure spinlock_check [2025-03-04 11:36:41,024 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 157 nodes and edges [2025-03-04 11:36:41,026 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2025-03-04 11:36:41,027 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-03-04 11:36:41,028 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 11:36:41,029 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 11:36:41,031 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:36:41,152 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:36:41,152 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:36:41,153 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:36:41,153 INFO L158 Benchmark]: Toolchain (without parser) took 30509.99ms. Allocated memory was 167.8MB in the beginning and 721.4MB in the end (delta: 553.6MB). Free memory was 123.8MB in the beginning and 487.2MB in the end (delta: -363.4MB). Peak memory consumption was 191.0MB. Max. memory is 16.1GB. [2025-03-04 11:36:41,153 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:36:41,153 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1413.52ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 59.5MB in the end (delta: 64.3MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. [2025-03-04 11:36:41,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.71ms. Allocated memory is still 167.8MB. Free memory was 59.5MB in the beginning and 105.2MB in the end (delta: -45.7MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2025-03-04 11:36:41,154 INFO L158 Benchmark]: Boogie Preprocessor took 157.38ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 81.0MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:36:41,154 INFO L158 Benchmark]: IcfgBuilder took 1915.38ms. Allocated memory is still 167.8MB. Free memory was 81.0MB in the beginning and 64.9MB in the end (delta: 16.1MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2025-03-04 11:36:41,154 INFO L158 Benchmark]: TraceAbstraction took 26733.87ms. Allocated memory was 167.8MB in the beginning and 721.4MB in the end (delta: 553.6MB). Free memory was 64.9MB in the beginning and 512.1MB in the end (delta: -447.2MB). Peak memory consumption was 411.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:41,154 INFO L158 Benchmark]: Witness Printer took 155.67ms. Allocated memory is still 721.4MB. Free memory was 512.1MB in the beginning and 487.2MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:36:41,155 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 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1413.52ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 59.5MB in the end (delta: 64.3MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.71ms. Allocated memory is still 167.8MB. Free memory was 59.5MB in the beginning and 105.2MB in the end (delta: -45.7MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 157.38ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 81.0MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1915.38ms. Allocated memory is still 167.8MB. Free memory was 81.0MB in the beginning and 64.9MB in the end (delta: 16.1MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26733.87ms. Allocated memory was 167.8MB in the beginning and 721.4MB in the end (delta: 553.6MB). Free memory was 64.9MB in the beginning and 512.1MB in the end (delta: -447.2MB). Peak memory consumption was 411.4MB. Max. memory is 16.1GB. * Witness Printer took 155.67ms. Allocated memory is still 721.4MB. Free memory was 512.1MB in the beginning and 487.2MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. 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: 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 - 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 32 procedures, 434 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 22.5s, OverallIterations: 25, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6752 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6743 mSDsluCounter, 39060 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24787 mSDsCounter, 490 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1374 IncrementalHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 490 mSolverCounterUnsat, 14273 mSDtfsCounter, 1374 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.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 1738 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 3.3s 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 RESULT: Ultimate proved your program to be correct! [2025-03-04 11:36:41,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE