./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/libvsync/hclhlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/hclhlock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:45:45,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:45:45,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:45:45,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:45:45,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:45:45,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:45:45,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:45:45,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:45:45,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:45:45,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:45:45,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:45:45,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:45:45,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:45:45,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:45:45,105 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:45:45,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:45:45,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:45:45,105 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:45:45,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:45:45,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:45:45,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:45:45,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:45:45,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:45:45,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:45:45,106 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:45:45,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:45:45,106 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:45:45,106 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:45:45,106 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:45:45,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:45:45,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:45:45,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:45:45,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:45:45,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:45:45,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:45:45,107 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:45:45,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:45:45,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:45:45,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:45:45,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:45:45,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:45:45,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:45:45,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:45:45,108 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 [2025-02-06 04:45:45,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:45:45,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:45:45,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:45:45,351 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:45:45,351 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:45:45,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/hclhlock.i [2025-02-06 04:45:46,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81641fabd/03558669da134fbd9e19966d6624171e/FLAG18a09d9b5 [2025-02-06 04:45:46,840 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:45:46,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i [2025-02-06 04:45:46,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81641fabd/03558669da134fbd9e19966d6624171e/FLAG18a09d9b5 [2025-02-06 04:45:46,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81641fabd/03558669da134fbd9e19966d6624171e [2025-02-06 04:45:46,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:45:46,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:45:46,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:45:46,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:45:46,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:45:46,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:45:46" (1/1) ... [2025-02-06 04:45:46,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ef72f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:46, skipping insertion in model container [2025-02-06 04:45:46,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:45:46" (1/1) ... [2025-02-06 04:45:46,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:45:48,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172094,172107] [2025-02-06 04:45:48,298 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172145,172158] [2025-02-06 04:45:48,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172202,172215] [2025-02-06 04:45:48,304 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172763,172776] [2025-02-06 04:45:48,304 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172814,172827] [2025-02-06 04:45:48,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174060,174073] [2025-02-06 04:45:48,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174118,174131] [2025-02-06 04:45:48,311 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174622,174635] [2025-02-06 04:45:48,311 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174679,174692] [2025-02-06 04:45:48,312 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174746,174759] [2025-02-06 04:45:48,312 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175274,175287] [2025-02-06 04:45:48,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175341,175354] [2025-02-06 04:45:48,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175944,175957] [2025-02-06 04:45:48,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198494,198507] [2025-02-06 04:45:48,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198561,198574] [2025-02-06 04:45:48,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:45:48,667 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:45:48,772 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-02-06 04:45:48,774 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-02-06 04:45:48,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-02-06 04:45:48,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-02-06 04:45:48,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-02-06 04:45:48,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-02-06 04:45:48,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-02-06 04:45:48,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-02-06 04:45:48,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-02-06 04:45:48,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-02-06 04:45:48,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-02-06 04:45:48,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-02-06 04:45:48,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-02-06 04:45:48,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-02-06 04:45:48,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-02-06 04:45:48,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-02-06 04:45:48,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-02-06 04:45:48,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-02-06 04:45:48,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-02-06 04:45:48,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-02-06 04:45:48,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-02-06 04:45:48,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-02-06 04:45:48,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-02-06 04:45:48,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-02-06 04:45:48,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-02-06 04:45:48,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-02-06 04:45:48,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-02-06 04:45:48,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-02-06 04:45:48,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-02-06 04:45:48,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-02-06 04:45:48,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-02-06 04:45:48,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-02-06 04:45:48,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-02-06 04:45:48,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-02-06 04:45:48,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-02-06 04:45:48,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-02-06 04:45:48,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-02-06 04:45:48,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-02-06 04:45:48,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-02-06 04:45:48,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-02-06 04:45:48,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-02-06 04:45:48,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-02-06 04:45:48,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-02-06 04:45:48,787 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-02-06 04:45:48,787 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-02-06 04:45:48,787 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-02-06 04:45:48,787 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-02-06 04:45:48,788 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-02-06 04:45:48,788 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-02-06 04:45:48,788 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-02-06 04:45:48,788 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-02-06 04:45:48,790 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-02-06 04:45:48,790 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-02-06 04:45:48,791 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-02-06 04:45:48,792 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-02-06 04:45:48,792 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-02-06 04:45:48,792 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-02-06 04:45:48,793 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-02-06 04:45:48,794 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-02-06 04:45:48,794 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-02-06 04:45:48,794 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-02-06 04:45:48,794 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-02-06 04:45:48,795 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-02-06 04:45:48,796 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-02-06 04:45:48,796 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-02-06 04:45:48,797 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-02-06 04:45:48,798 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-02-06 04:45:48,798 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-02-06 04:45:48,798 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-02-06 04:45:48,799 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-02-06 04:45:48,799 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-02-06 04:45:48,799 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-02-06 04:45:48,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-02-06 04:45:48,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-02-06 04:45:48,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-02-06 04:45:48,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-02-06 04:45:48,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-02-06 04:45:48,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-02-06 04:45:48,803 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-02-06 04:45:48,803 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-02-06 04:45:48,803 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-02-06 04:45:48,803 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-02-06 04:45:48,804 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-02-06 04:45:48,804 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-02-06 04:45:48,805 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-02-06 04:45:48,805 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-02-06 04:45:48,805 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-02-06 04:45:48,806 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-02-06 04:45:48,806 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-02-06 04:45:48,807 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-02-06 04:45:48,807 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-02-06 04:45:48,807 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-02-06 04:45:48,807 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-02-06 04:45:48,807 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-02-06 04:45:48,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-02-06 04:45:48,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-02-06 04:45:48,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-02-06 04:45:48,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-02-06 04:45:48,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-02-06 04:45:48,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-02-06 04:45:48,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172094,172107] [2025-02-06 04:45:48,848 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172145,172158] [2025-02-06 04:45:48,848 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172202,172215] [2025-02-06 04:45:48,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172763,172776] [2025-02-06 04:45:48,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172814,172827] [2025-02-06 04:45:48,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174060,174073] [2025-02-06 04:45:48,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174118,174131] [2025-02-06 04:45:48,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174622,174635] [2025-02-06 04:45:48,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174679,174692] [2025-02-06 04:45:48,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174746,174759] [2025-02-06 04:45:48,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175274,175287] [2025-02-06 04:45:48,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175341,175354] [2025-02-06 04:45:48,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175944,175957] [2025-02-06 04:45:48,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198494,198507] [2025-02-06 04:45:48,872 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198561,198574] [2025-02-06 04:45:48,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:45:49,044 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:45:49,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:49 WrapperNode [2025-02-06 04:45:49,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:45:49,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:45:49,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:45:49,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:45:49,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:49" (1/1) ... [2025-02-06 04:45:49,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:49" (1/1) ... [2025-02-06 04:45:49,144 INFO L138 Inliner]: procedures = 921, calls = 957, calls flagged for inlining = 833, calls inlined = 67, statements flattened = 799 [2025-02-06 04:45:49,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:45:49,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:45:49,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:45:49,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:45:49,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:49" (1/1) ... [2025-02-06 04:45:49,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:49" (1/1) ... [2025-02-06 04:45:49,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:49" (1/1) ... [2025-02-06 04:45:49,188 INFO L175 MemorySlicer]: Split 50 memory accesses to 4 slices as follows [2, 28, 2, 18]. 56 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 7, 0, 6]. The 15 writes are split as follows [0, 9, 1, 5]. [2025-02-06 04:45:49,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:49" (1/1) ... [2025-02-06 04:45:49,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:49" (1/1) ... [2025-02-06 04:45:49,206 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:49" (1/1) ... [2025-02-06 04:45:49,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:49" (1/1) ... [2025-02-06 04:45:49,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:49" (1/1) ... [2025-02-06 04:45:49,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:49" (1/1) ... [2025-02-06 04:45:49,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:45:49,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:45:49,224 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:45:49,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:45:49,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:49" (1/1) ... [2025-02-06 04:45:49,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:45:49,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:49,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:45:49,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:45:49,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-02-06 04:45:49,274 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 04:45:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 04:45:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 04:45:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:45:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:45:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 04:45:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 04:45:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 04:45:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 04:45:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 04:45:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 04:45:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 04:45:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:45:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:45:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 04:45:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 04:45:49,277 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:45:49,435 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:45:49,437 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:45:50,074 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-02-06 04:45:50,074 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-9: havoc vatomic32_read_rlx_#t~ret112#1; [2025-02-06 04:45:50,074 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-18: havoc vatomic32_read_rlx_#t~ret112#1; [2025-02-06 04:45:50,074 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-27: havoc vatomic32_read_rlx_#t~ret112#1; [2025-02-06 04:45:50,074 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-02-06 04:45:50,074 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-9: havoc vatomic32_read_acq_#t~ret113#1; [2025-02-06 04:45:50,075 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-02-06 04:45:50,075 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290-9: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-02-06 04:45:50,075 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-02-06 04:45:50,075 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-02-06 04:45:50,251 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-06 04:45:50,252 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-06 04:45:50,253 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:45:50,253 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:45:50,571 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:45:50,572 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:45:50,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:45:50 BoogieIcfgContainer [2025-02-06 04:45:50,572 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:45:50,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:45:50,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:45:50,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:45:50,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:45:46" (1/3) ... [2025-02-06 04:45:50,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565955d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:45:50, skipping insertion in model container [2025-02-06 04:45:50,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:49" (2/3) ... [2025-02-06 04:45:50,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565955d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:45:50, skipping insertion in model container [2025-02-06 04:45:50,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:45:50" (3/3) ... [2025-02-06 04:45:50,579 INFO L128 eAbstractionObserver]: Analyzing ICFG hclhlock.i [2025-02-06 04:45:50,595 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:45:50,597 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hclhlock.i that has 2 procedures, 273 locations, 1 initial locations, 60 loop locations, and 17 error locations. [2025-02-06 04:45:50,597 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:45:50,753 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 04:45:50,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 425 transitions, 857 flow [2025-02-06 04:45:50,861 INFO L124 PetriNetUnfolderBase]: 164/459 cut-off events. [2025-02-06 04:45:50,863 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:45:50,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 459 events. 164/459 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1509 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 350. Up to 6 conditions per place. [2025-02-06 04:45:50,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 425 transitions, 857 flow [2025-02-06 04:45:50,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 425 transitions, 857 flow [2025-02-06 04:45:50,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:45:50,893 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;@6924dfb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:45:50,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-02-06 04:45:50,902 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:45:50,902 INFO L124 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-02-06 04:45:50,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:45:50,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:50,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:50,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 04:45:50,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:50,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1309950939, now seen corresponding path program 1 times [2025-02-06 04:45:50,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:50,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812150913] [2025-02-06 04:45:50,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:50,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:51,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 04:45:51,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:45:51,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:51,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:51,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:51,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812150913] [2025-02-06 04:45:51,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812150913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:51,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:51,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:45:51,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568047195] [2025-02-06 04:45:51,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:51,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:45:51,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:51,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:45:51,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:45:51,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 425 [2025-02-06 04:45:51,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 425 transitions, 857 flow. Second operand has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:51,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:51,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 425 [2025-02-06 04:45:51,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:51,788 INFO L124 PetriNetUnfolderBase]: 796/2481 cut-off events. [2025-02-06 04:45:51,789 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:45:51,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3939 conditions, 2481 events. 796/2481 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 17195 event pairs, 574 based on Foata normal form. 1644/3753 useless extension candidates. Maximal degree in co-relation 3824. Up to 1442 conditions per place. [2025-02-06 04:45:51,801 INFO L140 encePairwiseOnDemand]: 303/425 looper letters, 134 selfloop transitions, 3 changer transitions 0/304 dead transitions. [2025-02-06 04:45:51,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 304 transitions, 889 flow [2025-02-06 04:45:51,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:45:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:45:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 928 transitions. [2025-02-06 04:45:51,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5458823529411765 [2025-02-06 04:45:51,816 INFO L175 Difference]: Start difference. First operand has 276 places, 425 transitions, 857 flow. Second operand 4 states and 928 transitions. [2025-02-06 04:45:51,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 304 transitions, 889 flow [2025-02-06 04:45:51,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 304 transitions, 889 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:45:51,826 INFO L231 Difference]: Finished difference. Result has 277 places, 304 transitions, 621 flow [2025-02-06 04:45:51,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=621, PETRI_PLACES=277, PETRI_TRANSITIONS=304} [2025-02-06 04:45:51,834 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 1 predicate places. [2025-02-06 04:45:51,834 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 304 transitions, 621 flow [2025-02-06 04:45:51,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:51,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:51,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:51,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:45:51,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 04:45:51,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:51,835 INFO L85 PathProgramCache]: Analyzing trace with hash 678864681, now seen corresponding path program 1 times [2025-02-06 04:45:51,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:51,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007923869] [2025-02-06 04:45:51,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:51,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:51,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 04:45:51,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 04:45:51,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:51,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:51,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:51,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:51,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007923869] [2025-02-06 04:45:51,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007923869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:51,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:51,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:45:51,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900982337] [2025-02-06 04:45:51,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:51,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:45:51,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:51,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:45:51,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:45:51,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 425 [2025-02-06 04:45:51,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 304 transitions, 621 flow. Second operand has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:51,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:51,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 425 [2025-02-06 04:45:51,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:52,367 INFO L124 PetriNetUnfolderBase]: 796/2479 cut-off events. [2025-02-06 04:45:52,367 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:45:52,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3941 conditions, 2479 events. 796/2479 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 17182 event pairs, 574 based on Foata normal form. 1/2110 useless extension candidates. Maximal degree in co-relation 3890. Up to 1442 conditions per place. [2025-02-06 04:45:52,376 INFO L140 encePairwiseOnDemand]: 421/425 looper letters, 134 selfloop transitions, 3 changer transitions 0/302 dead transitions. [2025-02-06 04:45:52,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 302 transitions, 891 flow [2025-02-06 04:45:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:45:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:45:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 810 transitions. [2025-02-06 04:45:52,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4764705882352941 [2025-02-06 04:45:52,379 INFO L175 Difference]: Start difference. First operand has 277 places, 304 transitions, 621 flow. Second operand 4 states and 810 transitions. [2025-02-06 04:45:52,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 302 transitions, 891 flow [2025-02-06 04:45:52,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 302 transitions, 885 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:45:52,383 INFO L231 Difference]: Finished difference. Result has 275 places, 302 transitions, 617 flow [2025-02-06 04:45:52,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=617, PETRI_PLACES=275, PETRI_TRANSITIONS=302} [2025-02-06 04:45:52,383 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -1 predicate places. [2025-02-06 04:45:52,384 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 302 transitions, 617 flow [2025-02-06 04:45:52,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:52,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:52,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:52,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:45:52,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 04:45:52,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:52,386 INFO L85 PathProgramCache]: Analyzing trace with hash -935349581, now seen corresponding path program 1 times [2025-02-06 04:45:52,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:52,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142129714] [2025-02-06 04:45:52,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:52,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:52,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 04:45:52,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:45:52,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:52,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142129714] [2025-02-06 04:45:52,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142129714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:52,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:52,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:45:52,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706592885] [2025-02-06 04:45:52,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:52,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:45:52,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:52,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:45:52,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:45:52,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 425 [2025-02-06 04:45:52,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 302 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:52,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:52,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 425 [2025-02-06 04:45:52,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:52,888 INFO L124 PetriNetUnfolderBase]: 796/2482 cut-off events. [2025-02-06 04:45:52,888 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:45:52,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 2482 events. 796/2482 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 17200 event pairs, 574 based on Foata normal form. 0/2112 useless extension candidates. Maximal degree in co-relation 3896. Up to 1449 conditions per place. [2025-02-06 04:45:52,896 INFO L140 encePairwiseOnDemand]: 422/425 looper letters, 138 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2025-02-06 04:45:52,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 305 transitions, 903 flow [2025-02-06 04:45:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:45:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:45:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2025-02-06 04:45:52,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.508235294117647 [2025-02-06 04:45:52,899 INFO L175 Difference]: Start difference. First operand has 275 places, 302 transitions, 617 flow. Second operand 3 states and 648 transitions. [2025-02-06 04:45:52,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 305 transitions, 903 flow [2025-02-06 04:45:52,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 305 transitions, 897 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:45:52,905 INFO L231 Difference]: Finished difference. Result has 275 places, 303 transitions, 623 flow [2025-02-06 04:45:52,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=623, PETRI_PLACES=275, PETRI_TRANSITIONS=303} [2025-02-06 04:45:52,906 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -1 predicate places. [2025-02-06 04:45:52,906 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 303 transitions, 623 flow [2025-02-06 04:45:52,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:52,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:52,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:52,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:45:52,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 04:45:52,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash -270863924, now seen corresponding path program 1 times [2025-02-06 04:45:52,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:52,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131714353] [2025-02-06 04:45:52,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:52,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:52,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:45:52,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:45:52,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:52,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:53,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131714353] [2025-02-06 04:45:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131714353] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:45:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767667240] [2025-02-06 04:45:53,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:53,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:53,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:53,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:45:53,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:45:53,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:45:53,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:45:53,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:53,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:53,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 04:45:53,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:45:53,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:45:53,190 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:45:53,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767667240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:53,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:45:53,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-06 04:45:53,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680681426] [2025-02-06 04:45:53,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:53,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:45:53,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:53,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:45:53,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:45:53,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 425 [2025-02-06 04:45:53,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 303 transitions, 623 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:53,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:53,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 425 [2025-02-06 04:45:53,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:53,574 INFO L124 PetriNetUnfolderBase]: 796/2480 cut-off events. [2025-02-06 04:45:53,574 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:45:53,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3948 conditions, 2480 events. 796/2480 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 17180 event pairs, 574 based on Foata normal form. 1/2112 useless extension candidates. Maximal degree in co-relation 3924. Up to 1446 conditions per place. [2025-02-06 04:45:53,583 INFO L140 encePairwiseOnDemand]: 422/425 looper letters, 136 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2025-02-06 04:45:53,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 301 transitions, 895 flow [2025-02-06 04:45:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:45:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:45:53,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2025-02-06 04:45:53,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035294117647059 [2025-02-06 04:45:53,587 INFO L175 Difference]: Start difference. First operand has 275 places, 303 transitions, 623 flow. Second operand 3 states and 642 transitions. [2025-02-06 04:45:53,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 301 transitions, 895 flow [2025-02-06 04:45:53,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 301 transitions, 893 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:45:53,593 INFO L231 Difference]: Finished difference. Result has 274 places, 301 transitions, 621 flow [2025-02-06 04:45:53,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=274, PETRI_TRANSITIONS=301} [2025-02-06 04:45:53,594 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, -2 predicate places. [2025-02-06 04:45:53,595 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 301 transitions, 621 flow [2025-02-06 04:45:53,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:53,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:53,595 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:53,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:45:53,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:53,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 04:45:53,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:53,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1701348843, now seen corresponding path program 1 times [2025-02-06 04:45:53,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:53,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508410421] [2025-02-06 04:45:53,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:53,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:53,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:45:53,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:45:53,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:53,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:53,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:53,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508410421] [2025-02-06 04:45:53,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508410421] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:45:53,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759192590] [2025-02-06 04:45:53,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:53,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:53,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:53,890 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:45:53,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:45:53,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:45:54,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:45:54,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:54,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:54,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:45:54,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:45:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:54,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:45:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 04:45:54,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759192590] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:45:54,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:45:54,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2025-02-06 04:45:54,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691630564] [2025-02-06 04:45:54,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:54,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:45:54,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:54,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:45:54,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:45:54,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 425 [2025-02-06 04:45:54,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 301 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:54,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:54,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 425 [2025-02-06 04:45:54,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:54,452 INFO L124 PetriNetUnfolderBase]: 796/2481 cut-off events. [2025-02-06 04:45:54,452 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:45:54,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3952 conditions, 2481 events. 796/2481 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 17030 event pairs, 574 based on Foata normal form. 1/2114 useless extension candidates. Maximal degree in co-relation 3919. Up to 1445 conditions per place. [2025-02-06 04:45:54,460 INFO L140 encePairwiseOnDemand]: 421/425 looper letters, 136 selfloop transitions, 3 changer transitions 0/302 dead transitions. [2025-02-06 04:45:54,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 302 transitions, 903 flow [2025-02-06 04:45:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:45:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:45:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2025-02-06 04:45:54,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2025-02-06 04:45:54,464 INFO L175 Difference]: Start difference. First operand has 274 places, 301 transitions, 621 flow. Second operand 3 states and 646 transitions. [2025-02-06 04:45:54,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 302 transitions, 903 flow [2025-02-06 04:45:54,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 302 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:45:54,468 INFO L231 Difference]: Finished difference. Result has 276 places, 302 transitions, 635 flow [2025-02-06 04:45:54,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=635, PETRI_PLACES=276, PETRI_TRANSITIONS=302} [2025-02-06 04:45:54,470 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 0 predicate places. [2025-02-06 04:45:54,471 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 302 transitions, 635 flow [2025-02-06 04:45:54,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:54,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:54,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:54,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:45:54,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:54,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 04:45:54,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:54,675 INFO L85 PathProgramCache]: Analyzing trace with hash -985197371, now seen corresponding path program 1 times [2025-02-06 04:45:54,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:54,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242457917] [2025-02-06 04:45:54,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:54,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:54,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:45:54,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:45:54,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:54,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:54,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:54,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242457917] [2025-02-06 04:45:54,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242457917] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:45:54,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316262922] [2025-02-06 04:45:54,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:54,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:54,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:54,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:45:54,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:45:54,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:45:54,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:45:54,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:54,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:54,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 04:45:54,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:45:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:54,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:45:54,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:54,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316262922] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:45:54,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:45:54,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 04:45:54,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514034312] [2025-02-06 04:45:54,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:45:54,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:45:54,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:54,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:45:54,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:45:54,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 425 [2025-02-06 04:45:54,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 302 transitions, 635 flow. Second operand has 7 states, 7 states have (on average 171.57142857142858) internal successors, (1201), 7 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:54,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:54,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 425 [2025-02-06 04:45:54,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:55,445 INFO L124 PetriNetUnfolderBase]: 796/2484 cut-off events. [2025-02-06 04:45:55,446 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 04:45:55,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3965 conditions, 2484 events. 796/2484 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 17046 event pairs, 574 based on Foata normal form. 1/2117 useless extension candidates. Maximal degree in co-relation 3922. Up to 1448 conditions per place. [2025-02-06 04:45:55,454 INFO L140 encePairwiseOnDemand]: 421/425 looper letters, 139 selfloop transitions, 5 changer transitions 0/307 dead transitions. [2025-02-06 04:45:55,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 307 transitions, 935 flow [2025-02-06 04:45:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:45:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:45:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 989 transitions. [2025-02-06 04:45:55,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46541176470588236 [2025-02-06 04:45:55,457 INFO L175 Difference]: Start difference. First operand has 276 places, 302 transitions, 635 flow. Second operand 5 states and 989 transitions. [2025-02-06 04:45:55,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 307 transitions, 935 flow [2025-02-06 04:45:55,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 307 transitions, 929 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:45:55,461 INFO L231 Difference]: Finished difference. Result has 280 places, 304 transitions, 655 flow [2025-02-06 04:45:55,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=655, PETRI_PLACES=280, PETRI_TRANSITIONS=304} [2025-02-06 04:45:55,482 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 4 predicate places. [2025-02-06 04:45:55,482 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 304 transitions, 655 flow [2025-02-06 04:45:55,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 171.57142857142858) internal successors, (1201), 7 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:55,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:55,483 INFO L206 CegarLoopForPetriNet]: 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] [2025-02-06 04:45:55,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:45:55,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:55,687 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 04:45:55,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:55,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2018793356, now seen corresponding path program 2 times [2025-02-06 04:45:55,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:55,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942482767] [2025-02-06 04:45:55,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:45:55,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:55,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-06 04:45:55,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 26 statements. [2025-02-06 04:45:55,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:45:55,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 04:45:55,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:55,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942482767] [2025-02-06 04:45:55,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942482767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:55,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:55,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:45:55,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992095080] [2025-02-06 04:45:55,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:55,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:45:55,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:55,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:45:55,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:45:55,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 425 [2025-02-06 04:45:55,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 304 transitions, 655 flow. Second operand has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:55,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:55,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 425 [2025-02-06 04:45:55,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:56,204 INFO L124 PetriNetUnfolderBase]: 796/2482 cut-off events. [2025-02-06 04:45:56,204 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 04:45:56,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3972 conditions, 2482 events. 796/2482 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 17035 event pairs, 574 based on Foata normal form. 1/2115 useless extension candidates. Maximal degree in co-relation 3923. Up to 1449 conditions per place. [2025-02-06 04:45:56,212 INFO L140 encePairwiseOnDemand]: 420/425 looper letters, 136 selfloop transitions, 5 changer transitions 0/302 dead transitions. [2025-02-06 04:45:56,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 302 transitions, 933 flow [2025-02-06 04:45:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:45:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:45:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 806 transitions. [2025-02-06 04:45:56,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47411764705882353 [2025-02-06 04:45:56,215 INFO L175 Difference]: Start difference. First operand has 280 places, 304 transitions, 655 flow. Second operand 4 states and 806 transitions. [2025-02-06 04:45:56,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 302 transitions, 933 flow [2025-02-06 04:45:56,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 302 transitions, 927 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 04:45:56,221 INFO L231 Difference]: Finished difference. Result has 280 places, 302 transitions, 655 flow [2025-02-06 04:45:56,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=655, PETRI_PLACES=280, PETRI_TRANSITIONS=302} [2025-02-06 04:45:56,222 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 4 predicate places. [2025-02-06 04:45:56,222 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 302 transitions, 655 flow [2025-02-06 04:45:56,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:56,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:56,223 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:56,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:45:56,223 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 04:45:56,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:56,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1388205947, now seen corresponding path program 1 times [2025-02-06 04:45:56,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:56,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365515101] [2025-02-06 04:45:56,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:56,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 04:45:56,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 04:45:56,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:56,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 04:45:56,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:56,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365515101] [2025-02-06 04:45:56,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365515101] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:45:56,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294305920] [2025-02-06 04:45:56,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:56,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:56,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:56,351 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:45:56,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:45:56,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 04:45:56,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 04:45:56,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:56,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:56,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 04:45:56,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:45:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 04:45:56,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:45:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 04:45:56,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294305920] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:45:56,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:45:56,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2025-02-06 04:45:56,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687156920] [2025-02-06 04:45:56,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:45:56,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:45:56,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:56,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:45:56,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:45:56,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 425 [2025-02-06 04:45:56,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 302 transitions, 655 flow. Second operand has 9 states, 9 states have (on average 173.33333333333334) internal successors, (1560), 9 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:56,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:56,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 425 [2025-02-06 04:45:56,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:57,239 INFO L124 PetriNetUnfolderBase]: 802/2536 cut-off events. [2025-02-06 04:45:57,239 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-06 04:45:57,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4063 conditions, 2536 events. 802/2536 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 17042 event pairs, 574 based on Foata normal form. 2/2171 useless extension candidates. Maximal degree in co-relation 4016. Up to 1448 conditions per place. [2025-02-06 04:45:57,249 INFO L140 encePairwiseOnDemand]: 421/425 looper letters, 158 selfloop transitions, 5 changer transitions 0/324 dead transitions. [2025-02-06 04:45:57,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 324 transitions, 1049 flow [2025-02-06 04:45:57,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:45:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:45:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1007 transitions. [2025-02-06 04:45:57,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4738823529411765 [2025-02-06 04:45:57,251 INFO L175 Difference]: Start difference. First operand has 280 places, 302 transitions, 655 flow. Second operand 5 states and 1007 transitions. [2025-02-06 04:45:57,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 324 transitions, 1049 flow [2025-02-06 04:45:57,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 324 transitions, 1023 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:45:57,258 INFO L231 Difference]: Finished difference. Result has 284 places, 305 transitions, 681 flow [2025-02-06 04:45:57,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=681, PETRI_PLACES=284, PETRI_TRANSITIONS=305} [2025-02-06 04:45:57,259 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 8 predicate places. [2025-02-06 04:45:57,259 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 305 transitions, 681 flow [2025-02-06 04:45:57,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 173.33333333333334) internal successors, (1560), 9 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:57,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:57,262 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:57,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 04:45:57,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-06 04:45:57,467 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 04:45:57,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:57,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1694702231, now seen corresponding path program 2 times [2025-02-06 04:45:57,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:57,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113270789] [2025-02-06 04:45:57,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:45:57,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:57,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-02-06 04:45:57,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 04:45:57,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:45:57,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 04:45:57,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:57,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113270789] [2025-02-06 04:45:57,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113270789] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:45:57,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733276177] [2025-02-06 04:45:57,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:45:57,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:45:57,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:57,995 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:45:57,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 04:45:58,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-02-06 04:45:58,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 04:45:58,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:45:58,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:58,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 04:45:58,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:45:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 04:45:58,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:45:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 04:45:58,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733276177] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:45:58,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:45:58,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 17 [2025-02-06 04:45:58,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255940118] [2025-02-06 04:45:58,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:45:58,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 04:45:58,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:58,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 04:45:58,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:45:58,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 425 [2025-02-06 04:45:58,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 305 transitions, 681 flow. Second operand has 17 states, 17 states have (on average 167.52941176470588) internal successors, (2848), 17 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:58,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:58,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 425 [2025-02-06 04:45:58,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:00,157 INFO L124 PetriNetUnfolderBase]: 804/2576 cut-off events. [2025-02-06 04:46:00,157 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 04:46:00,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4148 conditions, 2576 events. 804/2576 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 17283 event pairs, 574 based on Foata normal form. 2/2203 useless extension candidates. Maximal degree in co-relation 4099. Up to 1448 conditions per place. [2025-02-06 04:46:00,168 INFO L140 encePairwiseOnDemand]: 414/425 looper letters, 170 selfloop transitions, 27 changer transitions 0/355 dead transitions. [2025-02-06 04:46:00,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 355 transitions, 1197 flow [2025-02-06 04:46:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 04:46:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 04:46:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3149 transitions. [2025-02-06 04:46:00,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4116339869281046 [2025-02-06 04:46:00,174 INFO L175 Difference]: Start difference. First operand has 284 places, 305 transitions, 681 flow. Second operand 18 states and 3149 transitions. [2025-02-06 04:46:00,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 355 transitions, 1197 flow [2025-02-06 04:46:00,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 355 transitions, 1197 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:46:00,179 INFO L231 Difference]: Finished difference. Result has 311 places, 329 transitions, 870 flow [2025-02-06 04:46:00,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=870, PETRI_PLACES=311, PETRI_TRANSITIONS=329} [2025-02-06 04:46:00,181 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 35 predicate places. [2025-02-06 04:46:00,181 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 329 transitions, 870 flow [2025-02-06 04:46:00,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 167.52941176470588) internal successors, (2848), 17 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:00,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:00,183 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 04:46:00,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 04:46:00,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:46:00,383 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 04:46:00,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:00,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1367996780, now seen corresponding path program 1 times [2025-02-06 04:46:00,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:00,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579363656] [2025-02-06 04:46:00,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:00,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:00,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 04:46:00,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 04:46:00,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:00,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 04:46:00,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:00,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579363656] [2025-02-06 04:46:00,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579363656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:00,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:46:00,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:46:00,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113364955] [2025-02-06 04:46:00,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:00,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:46:00,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:00,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:46:00,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:46:00,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 425 [2025-02-06 04:46:00,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 329 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:00,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:00,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 425 [2025-02-06 04:46:00,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:00,949 INFO L124 PetriNetUnfolderBase]: 796/2548 cut-off events. [2025-02-06 04:46:00,949 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-02-06 04:46:00,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4161 conditions, 2548 events. 796/2548 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 17191 event pairs, 574 based on Foata normal form. 4/2185 useless extension candidates. Maximal degree in co-relation 4101. Up to 1482 conditions per place. [2025-02-06 04:46:00,960 INFO L140 encePairwiseOnDemand]: 422/425 looper letters, 155 selfloop transitions, 6 changer transitions 0/319 dead transitions. [2025-02-06 04:46:00,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 319 transitions, 1148 flow [2025-02-06 04:46:00,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:46:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:46:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 638 transitions. [2025-02-06 04:46:00,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5003921568627451 [2025-02-06 04:46:00,962 INFO L175 Difference]: Start difference. First operand has 311 places, 329 transitions, 870 flow. Second operand 3 states and 638 transitions. [2025-02-06 04:46:00,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 319 transitions, 1148 flow [2025-02-06 04:46:00,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 319 transitions, 1129 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 04:46:00,967 INFO L231 Difference]: Finished difference. Result has 305 places, 319 transitions, 819 flow [2025-02-06 04:46:00,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=425, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=819, PETRI_PLACES=305, PETRI_TRANSITIONS=319} [2025-02-06 04:46:00,969 INFO L279 CegarLoopForPetriNet]: 276 programPoint places, 29 predicate places. [2025-02-06 04:46:00,969 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 319 transitions, 819 flow [2025-02-06 04:46:00,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:00,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:00,970 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 04:46:00,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:46:00,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-06 04:46:00,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1397176120, now seen corresponding path program 1 times [2025-02-06 04:46:00,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:00,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845876884] [2025-02-06 04:46:00,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:00,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:00,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 04:46:01,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 04:46:01,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:01,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:46:01,105 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:46:01,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 04:46:01,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 04:46:01,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:01,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:46:01,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:46:01,209 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:46:01,210 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-02-06 04:46:01,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2025-02-06 04:46:01,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2025-02-06 04:46:01,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2025-02-06 04:46:01,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2025-02-06 04:46:01,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2025-02-06 04:46:01,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2025-02-06 04:46:01,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2025-02-06 04:46:01,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2025-02-06 04:46:01,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2025-02-06 04:46:01,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2025-02-06 04:46:01,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2025-02-06 04:46:01,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2025-02-06 04:46:01,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2025-02-06 04:46:01,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2025-02-06 04:46:01,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2025-02-06 04:46:01,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2025-02-06 04:46:01,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2025-02-06 04:46:01,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2025-02-06 04:46:01,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2025-02-06 04:46:01,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2025-02-06 04:46:01,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2025-02-06 04:46:01,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2025-02-06 04:46:01,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2025-02-06 04:46:01,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2025-02-06 04:46:01,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2025-02-06 04:46:01,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2025-02-06 04:46:01,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2025-02-06 04:46:01,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2025-02-06 04:46:01,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:46:01,214 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:01,216 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:46:01,216 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 04:46:01,345 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:46:01,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 479 places, 742 transitions, 1500 flow [2025-02-06 04:46:01,463 INFO L124 PetriNetUnfolderBase]: 299/834 cut-off events. [2025-02-06 04:46:01,463 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 04:46:01,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 834 events. 299/834 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3641 event pairs, 0 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 687. Up to 12 conditions per place. [2025-02-06 04:46:01,475 INFO L82 GeneralOperation]: Start removeDead. Operand has 479 places, 742 transitions, 1500 flow [2025-02-06 04:46:01,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 479 places, 742 transitions, 1500 flow [2025-02-06 04:46:01,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:46:01,492 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;@6924dfb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:46:01,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-02-06 04:46:01,494 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:46:01,494 INFO L124 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-02-06 04:46:01,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:46:01,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:01,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:01,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2025-02-06 04:46:01,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:01,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1616628837, now seen corresponding path program 1 times [2025-02-06 04:46:01,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:01,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837278624] [2025-02-06 04:46:01,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:01,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:01,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 04:46:01,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:46:01,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:01,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:01,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:01,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837278624] [2025-02-06 04:46:01,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837278624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:01,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:46:01,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:46:01,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216447214] [2025-02-06 04:46:01,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:01,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:46:01,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:01,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:46:01,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:46:01,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 742 [2025-02-06 04:46:01,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 742 transitions, 1500 flow. Second operand has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:01,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:01,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 742 [2025-02-06 04:46:01,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:22,544 INFO L124 PetriNetUnfolderBase]: 139271/266532 cut-off events. [2025-02-06 04:46:22,544 INFO L125 PetriNetUnfolderBase]: For 728/728 co-relation queries the response was YES. [2025-02-06 04:46:22,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460492 conditions, 266532 events. 139271/266532 cut-off events. For 728/728 co-relation queries the response was YES. Maximal size of possible extension queue 4510. Compared 3011493 event pairs, 103947 based on Foata normal form. 189632/417896 useless extension candidates. Maximal degree in co-relation 445087. Up to 193527 conditions per place. [2025-02-06 04:46:23,754 INFO L140 encePairwiseOnDemand]: 532/742 looper letters, 241 selfloop transitions, 3 changer transitions 0/533 dead transitions. [2025-02-06 04:46:23,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 533 transitions, 1570 flow [2025-02-06 04:46:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:46:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:46:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1611 transitions. [2025-02-06 04:46:23,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5427897574123989 [2025-02-06 04:46:23,757 INFO L175 Difference]: Start difference. First operand has 479 places, 742 transitions, 1500 flow. Second operand 4 states and 1611 transitions. [2025-02-06 04:46:23,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 533 transitions, 1570 flow [2025-02-06 04:46:23,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 533 transitions, 1570 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:46:23,764 INFO L231 Difference]: Finished difference. Result has 480 places, 533 transitions, 1088 flow [2025-02-06 04:46:23,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=742, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1088, PETRI_PLACES=480, PETRI_TRANSITIONS=533} [2025-02-06 04:46:23,765 INFO L279 CegarLoopForPetriNet]: 479 programPoint places, 1 predicate places. [2025-02-06 04:46:23,765 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 533 transitions, 1088 flow [2025-02-06 04:46:23,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:23,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:23,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:23,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:46:23,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2025-02-06 04:46:23,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:23,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1517363825, now seen corresponding path program 1 times [2025-02-06 04:46:23,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:23,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777066860] [2025-02-06 04:46:23,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:23,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:23,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 04:46:23,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 04:46:23,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:23,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:23,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:23,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777066860] [2025-02-06 04:46:23,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777066860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:23,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:46:23,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:46:23,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696710655] [2025-02-06 04:46:23,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:23,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:46:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:23,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:46:23,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:46:23,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 742 [2025-02-06 04:46:23,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 533 transitions, 1088 flow. Second operand has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:23,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:23,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 742 [2025-02-06 04:46:23,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand