./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 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/hclhlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! 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-?-735b3cc-m [2025-03-14 01:12:39,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:12:39,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:12:39,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:12:39,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:12:39,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:12:39,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:12:39,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:12:39,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:12:39,982 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:12:39,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:12:39,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:12:39,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:12:39,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:12:39,982 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:12:39,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:12:39,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:12:39,982 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:12:39,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:12:39,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:12:39,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:12:39,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:12:39,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:12:39,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:12:39,983 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:12:39,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:12:39,983 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:12:39,983 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:12:39,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:12:39,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:12:39,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:12:39,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:12:39,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:12:39,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:12:39,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:12:39,983 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:12:39,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:12:39,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:12:39,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:12:39,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:12:39,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:12:39,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:12:39,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:12:39,984 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-03-14 01:12:40,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:12:40,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:12:40,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:12:40,239 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:12:40,239 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:12:40,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/hclhlock.i [2025-03-14 01:12:41,401 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398a0cfd6/96e287e77d9543de97f7592c60dcd5d2/FLAG42d42b30a [2025-03-14 01:12:41,851 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:12:41,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i [2025-03-14 01:12:41,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398a0cfd6/96e287e77d9543de97f7592c60dcd5d2/FLAG42d42b30a [2025-03-14 01:12:41,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398a0cfd6/96e287e77d9543de97f7592c60dcd5d2 [2025-03-14 01:12:41,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:12:41,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:12:41,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:12:41,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:12:41,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:12:41,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:12:41" (1/1) ... [2025-03-14 01:12:41,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c5313d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:41, skipping insertion in model container [2025-03-14 01:12:41,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:12:41" (1/1) ... [2025-03-14 01:12:42,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:12:43,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172094,172107] [2025-03-14 01:12:43,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172145,172158] [2025-03-14 01:12:43,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172202,172215] [2025-03-14 01:12:43,870 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172763,172776] [2025-03-14 01:12:43,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172814,172827] [2025-03-14 01:12:43,881 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174060,174073] [2025-03-14 01:12:43,881 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174118,174131] [2025-03-14 01:12:43,884 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174622,174635] [2025-03-14 01:12:43,885 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174679,174692] [2025-03-14 01:12:43,885 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174746,174759] [2025-03-14 01:12:43,886 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175274,175287] [2025-03-14 01:12:43,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175341,175354] [2025-03-14 01:12:43,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175944,175957] [2025-03-14 01:12:44,122 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198494,198507] [2025-03-14 01:12:44,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198561,198574] [2025-03-14 01:12:44,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:12:44,150 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:12:44,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-14 01:12:44,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-14 01:12:44,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-14 01:12:44,232 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-14 01:12:44,232 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-14 01:12:44,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-14 01:12:44,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-14 01:12:44,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-14 01:12:44,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-14 01:12:44,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-14 01:12:44,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-14 01:12:44,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-14 01:12:44,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-14 01:12:44,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-14 01:12:44,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-14 01:12:44,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-14 01:12:44,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-14 01:12:44,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-14 01:12:44,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-14 01:12:44,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-14 01:12:44,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-14 01:12:44,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-14 01:12:44,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-14 01:12:44,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-14 01:12:44,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-14 01:12:44,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-14 01:12:44,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-14 01:12:44,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-14 01:12:44,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-14 01:12:44,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-14 01:12:44,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-14 01:12:44,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-14 01:12:44,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-14 01:12:44,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-14 01:12:44,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-14 01:12:44,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-14 01:12:44,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-14 01:12:44,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-14 01:12:44,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-14 01:12:44,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-14 01:12:44,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-14 01:12:44,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-14 01:12:44,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-14 01:12:44,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-14 01:12:44,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-14 01:12:44,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-14 01:12:44,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-14 01:12:44,245 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-14 01:12:44,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-14 01:12:44,247 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-14 01:12:44,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-14 01:12:44,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-14 01:12:44,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-14 01:12:44,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-14 01:12:44,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-14 01:12:44,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-14 01:12:44,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-14 01:12:44,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-14 01:12:44,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-14 01:12:44,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-14 01:12:44,252 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-14 01:12:44,252 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-14 01:12:44,252 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-14 01:12:44,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-14 01:12:44,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-14 01:12:44,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-14 01:12:44,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-14 01:12:44,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-14 01:12:44,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-14 01:12:44,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-14 01:12:44,254 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-14 01:12:44,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-14 01:12:44,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-14 01:12:44,256 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-14 01:12:44,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-14 01:12:44,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-14 01:12:44,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-14 01:12:44,257 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-14 01:12:44,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-14 01:12:44,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-14 01:12:44,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-14 01:12:44,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-14 01:12:44,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-14 01:12:44,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-14 01:12:44,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-14 01:12:44,261 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-14 01:12:44,261 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-14 01:12:44,261 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-14 01:12:44,262 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-14 01:12:44,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-14 01:12:44,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-14 01:12:44,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-14 01:12:44,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-14 01:12:44,264 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-14 01:12:44,264 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-14 01:12:44,264 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-14 01:12:44,265 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-14 01:12:44,265 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-14 01:12:44,265 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-14 01:12:44,266 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-14 01:12:44,311 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172094,172107] [2025-03-14 01:12:44,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172145,172158] [2025-03-14 01:12:44,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172202,172215] [2025-03-14 01:12:44,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172763,172776] [2025-03-14 01:12:44,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172814,172827] [2025-03-14 01:12:44,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174060,174073] [2025-03-14 01:12:44,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174118,174131] [2025-03-14 01:12:44,319 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174622,174635] [2025-03-14 01:12:44,320 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174679,174692] [2025-03-14 01:12:44,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174746,174759] [2025-03-14 01:12:44,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175274,175287] [2025-03-14 01:12:44,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175341,175354] [2025-03-14 01:12:44,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175944,175957] [2025-03-14 01:12:44,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198494,198507] [2025-03-14 01:12:44,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198561,198574] [2025-03-14 01:12:44,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:12:44,522 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:12:44,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:44 WrapperNode [2025-03-14 01:12:44,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:12:44,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:12:44,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:12:44,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:12:44,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:44" (1/1) ... [2025-03-14 01:12:44,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:44" (1/1) ... [2025-03-14 01:12:44,619 INFO L138 Inliner]: procedures = 921, calls = 957, calls flagged for inlining = 833, calls inlined = 67, statements flattened = 799 [2025-03-14 01:12:44,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:12:44,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:12:44,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:12:44,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:12:44,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:44" (1/1) ... [2025-03-14 01:12:44,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:44" (1/1) ... [2025-03-14 01:12:44,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:44" (1/1) ... [2025-03-14 01:12:44,678 INFO L175 MemorySlicer]: Split 50 memory accesses to 4 slices as follows [2, 28, 18, 2]. 56 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 7, 6, 0]. The 15 writes are split as follows [0, 9, 5, 1]. [2025-03-14 01:12:44,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:44" (1/1) ... [2025-03-14 01:12:44,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:44" (1/1) ... [2025-03-14 01:12:44,696 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:44" (1/1) ... [2025-03-14 01:12:44,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:44" (1/1) ... [2025-03-14 01:12:44,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:44" (1/1) ... [2025-03-14 01:12:44,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:44" (1/1) ... [2025-03-14 01:12:44,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:12:44,715 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:12:44,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:12:44,716 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:12:44,716 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:44" (1/1) ... [2025-03-14 01:12:44,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:12:44,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:44,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:12:44,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:12:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:12:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:12:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-14 01:12:44,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-14 01:12:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:12:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-14 01:12:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-14 01:12:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-14 01:12:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-14 01:12:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:12:44,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:12:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-14 01:12:44,768 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-14 01:12:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:12:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-14 01:12:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-14 01:12:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-14 01:12:44,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-14 01:12:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:12:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:12:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-14 01:12:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-14 01:12:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:12:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-14 01:12:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-14 01:12:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-14 01:12:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-14 01:12:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:12:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:12:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-14 01:12:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-14 01:12:44,771 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:12:44,936 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:12:44,937 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:12:45,662 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-14 01:12:45,663 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-9: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-14 01:12:45,663 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-18: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-14 01:12:45,663 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-27: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-14 01:12:45,663 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-03-14 01:12:45,663 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-14 01:12:45,663 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-9: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-14 01:12:45,663 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-14 01:12:45,663 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290-9: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-14 01:12:45,663 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-03-14 01:12:45,846 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-14 01:12:45,847 INFO L1326 $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-03-14 01:12:45,848 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:12:45,849 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:12:45,849 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:12:46,430 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:12:46,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:12:46 BoogieIcfgContainer [2025-03-14 01:12:46,430 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:12:46,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:12:46,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:12:46,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:12:46,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:12:41" (1/3) ... [2025-03-14 01:12:46,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50427adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:12:46, skipping insertion in model container [2025-03-14 01:12:46,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:12:44" (2/3) ... [2025-03-14 01:12:46,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50427adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:12:46, skipping insertion in model container [2025-03-14 01:12:46,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:12:46" (3/3) ... [2025-03-14 01:12:46,440 INFO L128 eAbstractionObserver]: Analyzing ICFG hclhlock.i [2025-03-14 01:12:46,453 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:12:46,455 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hclhlock.i that has 2 procedures, 225 locations, 1 initial locations, 42 loop locations, and 17 error locations. [2025-03-14 01:12:46,455 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:12:46,617 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:12:46,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 365 transitions, 737 flow [2025-03-14 01:12:46,770 INFO L124 PetriNetUnfolderBase]: 151/393 cut-off events. [2025-03-14 01:12:46,808 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:12:46,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 393 events. 151/393 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1133 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 298. Up to 8 conditions per place. [2025-03-14 01:12:46,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 365 transitions, 737 flow [2025-03-14 01:12:46,824 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 365 transitions, 737 flow [2025-03-14 01:12:46,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:12:46,849 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;@19073af1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:12:46,849 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-14 01:12:46,859 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:12:46,859 INFO L124 PetriNetUnfolderBase]: 9/26 cut-off events. [2025-03-14 01:12:46,859 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:12:46,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:46,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:46,860 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-03-14 01:12:46,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:46,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1020516110, now seen corresponding path program 1 times [2025-03-14 01:12:46,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:46,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014878767] [2025-03-14 01:12:46,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:46,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:46,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 01:12:46,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 01:12:46,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:46,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:47,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:47,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014878767] [2025-03-14 01:12:47,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014878767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:47,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:47,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:12:47,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836209257] [2025-03-14 01:12:47,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:47,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:12:47,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:47,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:12:47,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:12:47,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 365 [2025-03-14 01:12:47,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 365 transitions, 737 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:47,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:47,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 365 [2025-03-14 01:12:47,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:47,903 INFO L124 PetriNetUnfolderBase]: 945/2518 cut-off events. [2025-03-14 01:12:47,903 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:12:47,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4251 conditions, 2518 events. 945/2518 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16346 event pairs, 696 based on Foata normal form. 1159/3271 useless extension candidates. Maximal degree in co-relation 4147. Up to 1717 conditions per place. [2025-03-14 01:12:47,925 INFO L140 encePairwiseOnDemand]: 255/365 looper letters, 141 selfloop transitions, 3 changer transitions 0/256 dead transitions. [2025-03-14 01:12:47,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 256 transitions, 807 flow [2025-03-14 01:12:47,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:12:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:12:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 703 transitions. [2025-03-14 01:12:47,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4815068493150685 [2025-03-14 01:12:47,942 INFO L175 Difference]: Start difference. First operand has 228 places, 365 transitions, 737 flow. Second operand 4 states and 703 transitions. [2025-03-14 01:12:47,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 256 transitions, 807 flow [2025-03-14 01:12:47,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 256 transitions, 807 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:12:47,958 INFO L231 Difference]: Finished difference. Result has 229 places, 256 transitions, 525 flow [2025-03-14 01:12:47,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=525, PETRI_PLACES=229, PETRI_TRANSITIONS=256} [2025-03-14 01:12:47,967 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 1 predicate places. [2025-03-14 01:12:47,967 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 256 transitions, 525 flow [2025-03-14 01:12:47,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:47,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:47,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:47,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:12:47,968 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-03-14 01:12:47,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1463336687, now seen corresponding path program 1 times [2025-03-14 01:12:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:47,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099973499] [2025-03-14 01:12:47,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:47,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:47,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 01:12:47,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 01:12:47,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:47,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:48,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:48,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099973499] [2025-03-14 01:12:48,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099973499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:48,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:48,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:12:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140785875] [2025-03-14 01:12:48,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:48,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:12:48,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:48,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:12:48,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:12:48,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 365 [2025-03-14 01:12:48,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 256 transitions, 525 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:48,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:48,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 365 [2025-03-14 01:12:48,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:48,587 INFO L124 PetriNetUnfolderBase]: 945/2516 cut-off events. [2025-03-14 01:12:48,588 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:12:48,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4253 conditions, 2516 events. 945/2516 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16353 event pairs, 696 based on Foata normal form. 1/2113 useless extension candidates. Maximal degree in co-relation 4206. Up to 1717 conditions per place. [2025-03-14 01:12:48,605 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 141 selfloop transitions, 3 changer transitions 0/254 dead transitions. [2025-03-14 01:12:48,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 254 transitions, 809 flow [2025-03-14 01:12:48,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:12:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:12:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2025-03-14 01:12:48,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4089041095890411 [2025-03-14 01:12:48,609 INFO L175 Difference]: Start difference. First operand has 229 places, 256 transitions, 525 flow. Second operand 4 states and 597 transitions. [2025-03-14 01:12:48,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 254 transitions, 809 flow [2025-03-14 01:12:48,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 254 transitions, 803 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:12:48,616 INFO L231 Difference]: Finished difference. Result has 227 places, 254 transitions, 521 flow [2025-03-14 01:12:48,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=521, PETRI_PLACES=227, PETRI_TRANSITIONS=254} [2025-03-14 01:12:48,619 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -1 predicate places. [2025-03-14 01:12:48,619 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 254 transitions, 521 flow [2025-03-14 01:12:48,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:48,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:48,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:48,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:12:48,620 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-03-14 01:12:48,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:48,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1812020352, now seen corresponding path program 1 times [2025-03-14 01:12:48,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:48,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585231709] [2025-03-14 01:12:48,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:48,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:48,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-14 01:12:48,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-14 01:12:48,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:48,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:48,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:48,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585231709] [2025-03-14 01:12:48,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585231709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:48,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:48,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:12:48,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090475837] [2025-03-14 01:12:48,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:48,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:12:48,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:48,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:12:48,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:12:48,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 365 [2025-03-14 01:12:48,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 254 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:48,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:48,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 365 [2025-03-14 01:12:48,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:49,224 INFO L124 PetriNetUnfolderBase]: 945/2519 cut-off events. [2025-03-14 01:12:49,224 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:12:49,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 2519 events. 945/2519 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16342 event pairs, 696 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 4212. Up to 1724 conditions per place. [2025-03-14 01:12:49,236 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 145 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2025-03-14 01:12:49,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 257 transitions, 821 flow [2025-03-14 01:12:49,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:12:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:12:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2025-03-14 01:12:49,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4474885844748858 [2025-03-14 01:12:49,239 INFO L175 Difference]: Start difference. First operand has 227 places, 254 transitions, 521 flow. Second operand 3 states and 490 transitions. [2025-03-14 01:12:49,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 257 transitions, 821 flow [2025-03-14 01:12:49,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 257 transitions, 815 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:12:49,245 INFO L231 Difference]: Finished difference. Result has 227 places, 255 transitions, 527 flow [2025-03-14 01:12:49,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=227, PETRI_TRANSITIONS=255} [2025-03-14 01:12:49,247 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -1 predicate places. [2025-03-14 01:12:49,247 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 255 transitions, 527 flow [2025-03-14 01:12:49,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:49,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:49,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:49,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:12:49,248 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-03-14 01:12:49,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1640610705, now seen corresponding path program 1 times [2025-03-14 01:12:49,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:49,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230635770] [2025-03-14 01:12:49,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:49,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:49,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:12:49,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:49,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:49,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:49,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:49,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230635770] [2025-03-14 01:12:49,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230635770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:49,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856045270] [2025-03-14 01:12:49,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:49,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:49,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:49,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:12:49,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:12:49,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:12:49,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:49,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:49,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:49,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-14 01:12:49,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:49,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:49,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856045270] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:49,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:49,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-14 01:12:49,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494909772] [2025-03-14 01:12:49,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:49,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:12:49,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:49,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:12:49,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:12:49,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 365 [2025-03-14 01:12:49,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 255 transitions, 527 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:49,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:49,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 365 [2025-03-14 01:12:49,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:50,198 INFO L124 PetriNetUnfolderBase]: 945/2522 cut-off events. [2025-03-14 01:12:50,198 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:12:50,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4269 conditions, 2522 events. 945/2522 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16376 event pairs, 696 based on Foata normal form. 1/2119 useless extension candidates. Maximal degree in co-relation 4245. Up to 1722 conditions per place. [2025-03-14 01:12:50,208 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 145 selfloop transitions, 5 changer transitions 0/260 dead transitions. [2025-03-14 01:12:50,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 260 transitions, 839 flow [2025-03-14 01:12:50,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:12:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:12:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 721 transitions. [2025-03-14 01:12:50,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39506849315068493 [2025-03-14 01:12:50,216 INFO L175 Difference]: Start difference. First operand has 227 places, 255 transitions, 527 flow. Second operand 5 states and 721 transitions. [2025-03-14 01:12:50,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 260 transitions, 839 flow [2025-03-14 01:12:50,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 260 transitions, 837 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:12:50,222 INFO L231 Difference]: Finished difference. Result has 232 places, 257 transitions, 551 flow [2025-03-14 01:12:50,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=551, PETRI_PLACES=232, PETRI_TRANSITIONS=257} [2025-03-14 01:12:50,223 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 4 predicate places. [2025-03-14 01:12:50,223 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 257 transitions, 551 flow [2025-03-14 01:12:50,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:50,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:50,225 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:50,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:12:50,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:50,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-14 01:12:50,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:50,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1891931872, now seen corresponding path program 2 times [2025-03-14 01:12:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:50,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531356952] [2025-03-14 01:12:50,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:12:50,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:50,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-14 01:12:50,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 19 statements. [2025-03-14 01:12:50,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:12:50,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-14 01:12:50,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:50,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531356952] [2025-03-14 01:12:50,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531356952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:50,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:50,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:12:50,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66556410] [2025-03-14 01:12:50,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:50,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:12:50,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:50,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:12:50,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:12:50,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 365 [2025-03-14 01:12:50,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 257 transitions, 551 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:50,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:50,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 365 [2025-03-14 01:12:50,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:50,926 INFO L124 PetriNetUnfolderBase]: 945/2520 cut-off events. [2025-03-14 01:12:50,926 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-14 01:12:50,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4278 conditions, 2520 events. 945/2520 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16335 event pairs, 696 based on Foata normal form. 1/2118 useless extension candidates. Maximal degree in co-relation 4230. Up to 1724 conditions per place. [2025-03-14 01:12:50,935 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 145 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2025-03-14 01:12:50,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 255 transitions, 841 flow [2025-03-14 01:12:50,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:12:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:12:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2025-03-14 01:12:50,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4420091324200913 [2025-03-14 01:12:50,937 INFO L175 Difference]: Start difference. First operand has 232 places, 257 transitions, 551 flow. Second operand 3 states and 484 transitions. [2025-03-14 01:12:50,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 255 transitions, 841 flow [2025-03-14 01:12:50,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 255 transitions, 835 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:12:50,942 INFO L231 Difference]: Finished difference. Result has 231 places, 255 transitions, 545 flow [2025-03-14 01:12:50,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=545, PETRI_PLACES=231, PETRI_TRANSITIONS=255} [2025-03-14 01:12:50,944 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 3 predicate places. [2025-03-14 01:12:50,944 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 255 transitions, 545 flow [2025-03-14 01:12:50,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:50,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:50,945 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:50,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:12:50,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-14 01:12:50,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:50,945 INFO L85 PathProgramCache]: Analyzing trace with hash -369578837, now seen corresponding path program 1 times [2025-03-14 01:12:50,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:50,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51787403] [2025-03-14 01:12:50,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:50,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:50,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:12:50,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:12:50,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:50,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-14 01:12:51,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:51,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51787403] [2025-03-14 01:12:51,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51787403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:51,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:51,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:12:51,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164512391] [2025-03-14 01:12:51,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:51,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:12:51,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:51,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:12:51,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:12:51,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 365 [2025-03-14 01:12:51,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 255 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:51,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:51,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 365 [2025-03-14 01:12:51,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:51,412 INFO L124 PetriNetUnfolderBase]: 948/2545 cut-off events. [2025-03-14 01:12:51,412 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:12:51,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4316 conditions, 2545 events. 948/2545 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16349 event pairs, 696 based on Foata normal form. 1/2143 useless extension candidates. Maximal degree in co-relation 4270. Up to 1734 conditions per place. [2025-03-14 01:12:51,422 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 156 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-03-14 01:12:51,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 266 transitions, 887 flow [2025-03-14 01:12:51,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:12:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:12:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2025-03-14 01:12:51,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4547945205479452 [2025-03-14 01:12:51,424 INFO L175 Difference]: Start difference. First operand has 231 places, 255 transitions, 545 flow. Second operand 3 states and 498 transitions. [2025-03-14 01:12:51,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 266 transitions, 887 flow [2025-03-14 01:12:51,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 266 transitions, 879 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:12:51,428 INFO L231 Difference]: Finished difference. Result has 232 places, 256 transitions, 553 flow [2025-03-14 01:12:51,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=553, PETRI_PLACES=232, PETRI_TRANSITIONS=256} [2025-03-14 01:12:51,430 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 4 predicate places. [2025-03-14 01:12:51,431 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 256 transitions, 553 flow [2025-03-14 01:12:51,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:51,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:51,431 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:51,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:12:51,431 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-03-14 01:12:51,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:51,432 INFO L85 PathProgramCache]: Analyzing trace with hash 315278783, now seen corresponding path program 1 times [2025-03-14 01:12:51,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:51,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466705057] [2025-03-14 01:12:51,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:51,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:51,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:12:51,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:12:51,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:51,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-14 01:12:51,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:51,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466705057] [2025-03-14 01:12:51,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466705057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:51,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:51,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:12:51,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958262070] [2025-03-14 01:12:51,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:51,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:12:51,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:51,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:12:51,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:12:51,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 365 [2025-03-14 01:12:51,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 256 transitions, 553 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:51,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:51,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 365 [2025-03-14 01:12:51,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:52,052 INFO L124 PetriNetUnfolderBase]: 948/2541 cut-off events. [2025-03-14 01:12:52,052 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:12:52,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4314 conditions, 2541 events. 948/2541 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16335 event pairs, 696 based on Foata normal form. 2/2142 useless extension candidates. Maximal degree in co-relation 4267. Up to 1725 conditions per place. [2025-03-14 01:12:52,060 INFO L140 encePairwiseOnDemand]: 360/365 looper letters, 143 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2025-03-14 01:12:52,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 254 transitions, 845 flow [2025-03-14 01:12:52,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:12:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:12:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 593 transitions. [2025-03-14 01:12:52,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40616438356164386 [2025-03-14 01:12:52,063 INFO L175 Difference]: Start difference. First operand has 232 places, 256 transitions, 553 flow. Second operand 4 states and 593 transitions. [2025-03-14 01:12:52,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 254 transitions, 845 flow [2025-03-14 01:12:52,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 254 transitions, 843 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:12:52,066 INFO L231 Difference]: Finished difference. Result has 232 places, 254 transitions, 557 flow [2025-03-14 01:12:52,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=557, PETRI_PLACES=232, PETRI_TRANSITIONS=254} [2025-03-14 01:12:52,067 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 4 predicate places. [2025-03-14 01:12:52,067 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 254 transitions, 557 flow [2025-03-14 01:12:52,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:52,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:52,068 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] [2025-03-14 01:12:52,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:12:52,069 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-03-14 01:12:52,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1417187650, now seen corresponding path program 1 times [2025-03-14 01:12:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:52,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091089738] [2025-03-14 01:12:52,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:52,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:52,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:12:52,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:12:52,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:52,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-14 01:12:52,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091089738] [2025-03-14 01:12:52,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091089738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:52,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206031716] [2025-03-14 01:12:52,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:52,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:52,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:52,246 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:12:52,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:12:52,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:12:52,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:12:52,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:52,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:52,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 01:12:52,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-14 01:12:52,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:52,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-14 01:12:52,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206031716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:52,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:52,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2025-03-14 01:12:52,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134510517] [2025-03-14 01:12:52,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:52,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:12:52,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:52,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:12:52,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:12:52,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 365 [2025-03-14 01:12:52,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 254 transitions, 557 flow. Second operand has 9 states, 9 states have (on average 118.44444444444444) internal successors, (1066), 9 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:52,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:52,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 365 [2025-03-14 01:12:52,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:53,222 INFO L124 PetriNetUnfolderBase]: 951/2565 cut-off events. [2025-03-14 01:12:53,223 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-14 01:12:53,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4363 conditions, 2565 events. 951/2565 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16219 event pairs, 696 based on Foata normal form. 2/2166 useless extension candidates. Maximal degree in co-relation 4316. Up to 1723 conditions per place. [2025-03-14 01:12:53,238 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 165 selfloop transitions, 5 changer transitions 0/276 dead transitions. [2025-03-14 01:12:53,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 276 transitions, 959 flow [2025-03-14 01:12:53,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:12:53,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:12:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 739 transitions. [2025-03-14 01:12:53,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40493150684931506 [2025-03-14 01:12:53,241 INFO L175 Difference]: Start difference. First operand has 232 places, 254 transitions, 557 flow. Second operand 5 states and 739 transitions. [2025-03-14 01:12:53,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 276 transitions, 959 flow [2025-03-14 01:12:53,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 276 transitions, 933 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:12:53,246 INFO L231 Difference]: Finished difference. Result has 236 places, 256 transitions, 577 flow [2025-03-14 01:12:53,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=577, PETRI_PLACES=236, PETRI_TRANSITIONS=256} [2025-03-14 01:12:53,247 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 8 predicate places. [2025-03-14 01:12:53,248 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 256 transitions, 577 flow [2025-03-14 01:12:53,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.44444444444444) internal successors, (1066), 9 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:53,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:53,249 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 01:12:53,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 01:12:53,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-14 01:12:53,450 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-03-14 01:12:53,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:53,450 INFO L85 PathProgramCache]: Analyzing trace with hash -888000400, now seen corresponding path program 2 times [2025-03-14 01:12:53,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:53,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713432017] [2025-03-14 01:12:53,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:12:53,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:53,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-14 01:12:53,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-14 01:12:53,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:12:53,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-14 01:12:53,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:53,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713432017] [2025-03-14 01:12:53,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713432017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:53,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86824868] [2025-03-14 01:12:53,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:12:53,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:53,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:53,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:12:53,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:12:54,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-14 01:12:54,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-14 01:12:54,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:12:54,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:54,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-14 01:12:54,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-14 01:12:54,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-14 01:12:54,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86824868] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:54,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:54,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2025-03-14 01:12:54,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393043966] [2025-03-14 01:12:54,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:54,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-14 01:12:54,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:54,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-14 01:12:54,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-14 01:12:54,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 365 [2025-03-14 01:12:54,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 256 transitions, 577 flow. Second operand has 16 states, 16 states have (on average 112.6875) internal successors, (1803), 16 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:54,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:54,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 365 [2025-03-14 01:12:54,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:56,005 INFO L124 PetriNetUnfolderBase]: 953/2601 cut-off events. [2025-03-14 01:12:56,005 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-14 01:12:56,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4444 conditions, 2601 events. 953/2601 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16414 event pairs, 696 based on Foata normal form. 2/2194 useless extension candidates. Maximal degree in co-relation 4395. Up to 1723 conditions per place. [2025-03-14 01:12:56,014 INFO L140 encePairwiseOnDemand]: 354/365 looper letters, 177 selfloop transitions, 27 changer transitions 0/307 dead transitions. [2025-03-14 01:12:56,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 307 transitions, 1107 flow [2025-03-14 01:12:56,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:12:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:12:56,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2166 transitions. [2025-03-14 01:12:56,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32968036529680367 [2025-03-14 01:12:56,021 INFO L175 Difference]: Start difference. First operand has 236 places, 256 transitions, 577 flow. Second operand 18 states and 2166 transitions. [2025-03-14 01:12:56,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 307 transitions, 1107 flow [2025-03-14 01:12:56,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 307 transitions, 1099 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-14 01:12:56,028 INFO L231 Difference]: Finished difference. Result has 262 places, 280 transitions, 754 flow [2025-03-14 01:12:56,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=754, PETRI_PLACES=262, PETRI_TRANSITIONS=280} [2025-03-14 01:12:56,029 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 34 predicate places. [2025-03-14 01:12:56,030 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 280 transitions, 754 flow [2025-03-14 01:12:56,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 112.6875) internal successors, (1803), 16 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:56,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:56,031 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 01:12:56,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 01:12:56,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:56,232 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-03-14 01:12:56,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1672469636, now seen corresponding path program 1 times [2025-03-14 01:12:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:56,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470766731] [2025-03-14 01:12:56,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:56,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-14 01:12:56,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-14 01:12:56,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:56,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-14 01:12:56,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:56,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470766731] [2025-03-14 01:12:56,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470766731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:56,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:56,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:12:56,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930926915] [2025-03-14 01:12:56,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:56,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:12:56,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:56,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:12:56,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:12:56,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 365 [2025-03-14 01:12:56,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 280 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:56,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:56,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 365 [2025-03-14 01:12:56,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:56,936 INFO L124 PetriNetUnfolderBase]: 945/2573 cut-off events. [2025-03-14 01:12:56,936 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-14 01:12:56,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4454 conditions, 2573 events. 945/2573 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16335 event pairs, 696 based on Foata normal form. 4/2176 useless extension candidates. Maximal degree in co-relation 4394. Up to 1757 conditions per place. [2025-03-14 01:12:56,945 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 161 selfloop transitions, 6 changer transitions 0/270 dead transitions. [2025-03-14 01:12:56,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 270 transitions, 1044 flow [2025-03-14 01:12:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:12:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:12:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2025-03-14 01:12:56,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4383561643835616 [2025-03-14 01:12:56,948 INFO L175 Difference]: Start difference. First operand has 262 places, 280 transitions, 754 flow. Second operand 3 states and 480 transitions. [2025-03-14 01:12:56,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 270 transitions, 1044 flow [2025-03-14 01:12:56,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 270 transitions, 1021 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-14 01:12:56,953 INFO L231 Difference]: Finished difference. Result has 255 places, 270 transitions, 699 flow [2025-03-14 01:12:56,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=255, PETRI_TRANSITIONS=270} [2025-03-14 01:12:56,954 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 27 predicate places. [2025-03-14 01:12:56,954 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 270 transitions, 699 flow [2025-03-14 01:12:56,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:56,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:56,954 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-14 01:12:56,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:12:56,955 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-03-14 01:12:56,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1589806924, now seen corresponding path program 1 times [2025-03-14 01:12:56,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:56,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071349159] [2025-03-14 01:12:56,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:56,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:56,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-14 01:12:57,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-14 01:12:57,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:57,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:12:57,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:12:57,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-14 01:12:57,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-14 01:12:57,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:57,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:12:57,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:12:57,296 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:12:57,296 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-03-14 01:12:57,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2025-03-14 01:12:57,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2025-03-14 01:12:57,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2025-03-14 01:12:57,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2025-03-14 01:12:57,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2025-03-14 01:12:57,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2025-03-14 01:12:57,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2025-03-14 01:12:57,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2025-03-14 01:12:57,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2025-03-14 01:12:57,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2025-03-14 01:12:57,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2025-03-14 01:12:57,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2025-03-14 01:12:57,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2025-03-14 01:12:57,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2025-03-14 01:12:57,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2025-03-14 01:12:57,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2025-03-14 01:12:57,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2025-03-14 01:12:57,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2025-03-14 01:12:57,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2025-03-14 01:12:57,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2025-03-14 01:12:57,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2025-03-14 01:12:57,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2025-03-14 01:12:57,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2025-03-14 01:12:57,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2025-03-14 01:12:57,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2025-03-14 01:12:57,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2025-03-14 01:12:57,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2025-03-14 01:12:57,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2025-03-14 01:12:57,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:12:57,300 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:57,302 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:12:57,302 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:12:57,442 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:12:57,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 395 places, 636 transitions, 1288 flow [2025-03-14 01:12:57,513 INFO L124 PetriNetUnfolderBase]: 275/714 cut-off events. [2025-03-14 01:12:57,513 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:12:57,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 714 events. 275/714 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2844 event pairs, 0 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 587. Up to 12 conditions per place. [2025-03-14 01:12:57,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 395 places, 636 transitions, 1288 flow [2025-03-14 01:12:57,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 395 places, 636 transitions, 1288 flow [2025-03-14 01:12:57,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:12:57,540 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;@19073af1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:12:57,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-14 01:12:57,542 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:12:57,543 INFO L124 PetriNetUnfolderBase]: 9/26 cut-off events. [2025-03-14 01:12:57,543 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:12:57,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:57,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:57,543 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-03-14 01:12:57,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:57,545 INFO L85 PathProgramCache]: Analyzing trace with hash -32641682, now seen corresponding path program 1 times [2025-03-14 01:12:57,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:57,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795581826] [2025-03-14 01:12:57,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:57,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:57,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 01:12:57,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 01:12:57,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:57,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:57,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:57,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795581826] [2025-03-14 01:12:57,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795581826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:57,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:57,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:12:57,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513100105] [2025-03-14 01:12:57,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:57,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:12:57,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:57,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:12:57,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:12:57,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 636 [2025-03-14 01:12:57,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 636 transitions, 1288 flow. Second operand has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:57,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:57,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 636 [2025-03-14 01:12:57,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:20,490 INFO L124 PetriNetUnfolderBase]: 174371/294669 cut-off events. [2025-03-14 01:13:20,490 INFO L125 PetriNetUnfolderBase]: For 772/772 co-relation queries the response was YES. [2025-03-14 01:13:20,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538022 conditions, 294669 events. 174371/294669 cut-off events. For 772/772 co-relation queries the response was YES. Maximal size of possible extension queue 4071. Compared 2879386 event pairs, 132336 based on Foata normal form. 140795/392431 useless extension candidates. Maximal degree in co-relation 515450. Up to 242895 conditions per place. [2025-03-14 01:13:22,276 INFO L140 encePairwiseOnDemand]: 448/636 looper letters, 253 selfloop transitions, 3 changer transitions 0/449 dead transitions. [2025-03-14 01:13:22,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 449 transitions, 1426 flow [2025-03-14 01:13:22,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:13:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:13:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1217 transitions. [2025-03-14 01:13:22,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4783805031446541 [2025-03-14 01:13:22,280 INFO L175 Difference]: Start difference. First operand has 395 places, 636 transitions, 1288 flow. Second operand 4 states and 1217 transitions. [2025-03-14 01:13:22,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 449 transitions, 1426 flow [2025-03-14 01:13:22,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 449 transitions, 1426 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:13:22,287 INFO L231 Difference]: Finished difference. Result has 396 places, 449 transitions, 920 flow [2025-03-14 01:13:22,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=920, PETRI_PLACES=396, PETRI_TRANSITIONS=449} [2025-03-14 01:13:22,289 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, 1 predicate places. [2025-03-14 01:13:22,289 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 449 transitions, 920 flow [2025-03-14 01:13:22,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:22,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:22,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:22,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:13:22,290 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-03-14 01:13:22,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:22,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1303763443, now seen corresponding path program 1 times [2025-03-14 01:13:22,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:22,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375206043] [2025-03-14 01:13:22,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:22,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:22,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 01:13:22,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 01:13:22,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:22,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:22,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:22,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375206043] [2025-03-14 01:13:22,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375206043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:13:22,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:13:22,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:13:22,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017918311] [2025-03-14 01:13:22,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:13:22,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:13:22,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:22,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:13:22,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:13:22,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 636 [2025-03-14 01:13:22,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 449 transitions, 920 flow. Second operand has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:22,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:22,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 636 [2025-03-14 01:13:22,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand