./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/hclhlock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:50:55,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:50:55,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:50:55,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:50:55,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:50:55,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:50:55,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:50:55,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:50:55,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:50:55,139 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:50:55,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:50:55,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:50:55,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:50:55,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:50:55,140 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:50:55,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:50:55,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:50:55,141 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:50:55,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:50:55,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:50:55,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:50:55,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:50:55,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:50:55,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:50:55,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:50:55,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:50:55,142 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:50:55,142 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:50:55,142 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:50:55,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:50:55,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:50:55,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:50:55,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:50:55,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:50:55,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:50:55,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:50:55,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:50:55,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:50:55,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:50:55,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:50:55,144 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:50:55,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:50:55,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:50:55,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:50:55,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:50:55,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:50:55,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:50:55,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:50:55,145 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 [2025-01-09 16:50:55,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:50:55,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:50:55,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:50:55,423 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:50:55,423 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:50:55,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/hclhlock.i [2025-01-09 16:50:56,686 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4bc08195/5bbc9bf466d14ace97be789f9783122e/FLAGb9b512a1b [2025-01-09 16:50:57,333 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:50:57,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i [2025-01-09 16:50:57,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4bc08195/5bbc9bf466d14ace97be789f9783122e/FLAGb9b512a1b [2025-01-09 16:50:57,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4bc08195/5bbc9bf466d14ace97be789f9783122e [2025-01-09 16:50:57,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:50:57,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:50:57,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:50:57,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:50:57,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:50:57,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:50:57" (1/1) ... [2025-01-09 16:50:57,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1954c641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:57, skipping insertion in model container [2025-01-09 16:50:57,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:50:57" (1/1) ... [2025-01-09 16:50:57,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:50:58,980 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172094,172107] [2025-01-09 16:50:58,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172145,172158] [2025-01-09 16:50:58,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172202,172215] [2025-01-09 16:50:58,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172763,172776] [2025-01-09 16:50:58,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172814,172827] [2025-01-09 16:50:59,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174060,174073] [2025-01-09 16:50:59,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174118,174131] [2025-01-09 16:50:59,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174622,174635] [2025-01-09 16:50:59,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174679,174692] [2025-01-09 16:50:59,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174746,174759] [2025-01-09 16:50:59,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175274,175287] [2025-01-09 16:50:59,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175341,175354] [2025-01-09 16:50:59,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175944,175957] [2025-01-09 16:50:59,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198494,198507] [2025-01-09 16:50:59,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198561,198574] [2025-01-09 16:50:59,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:50:59,191 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:50:59,307 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-01-09 16:50:59,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-01-09 16:50:59,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-01-09 16:50:59,310 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-01-09 16:50:59,310 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-01-09 16:50:59,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-01-09 16:50:59,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-01-09 16:50:59,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-01-09 16:50:59,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-01-09 16:50:59,316 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-01-09 16:50:59,316 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-01-09 16:50:59,317 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-01-09 16:50:59,317 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-01-09 16:50:59,317 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-01-09 16:50:59,317 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-01-09 16:50:59,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-01-09 16:50:59,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-01-09 16:50:59,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-01-09 16:50:59,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-01-09 16:50:59,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-01-09 16:50:59,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-01-09 16:50:59,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-01-09 16:50:59,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-01-09 16:50:59,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-01-09 16:50:59,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-01-09 16:50:59,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-01-09 16:50:59,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-01-09 16:50:59,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-01-09 16:50:59,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-01-09 16:50:59,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-01-09 16:50:59,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-01-09 16:50:59,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-01-09 16:50:59,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-01-09 16:50:59,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-01-09 16:50:59,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-01-09 16:50:59,323 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-01-09 16:50:59,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-01-09 16:50:59,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-01-09 16:50:59,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-01-09 16:50:59,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-01-09 16:50:59,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-01-09 16:50:59,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-01-09 16:50:59,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-01-09 16:50:59,326 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-01-09 16:50:59,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-01-09 16:50:59,327 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-01-09 16:50:59,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-01-09 16:50:59,328 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-01-09 16:50:59,329 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-01-09 16:50:59,330 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-01-09 16:50:59,331 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-01-09 16:50:59,331 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-01-09 16:50:59,331 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-01-09 16:50:59,332 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-01-09 16:50:59,333 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-01-09 16:50:59,333 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-01-09 16:50:59,333 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-01-09 16:50:59,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-01-09 16:50:59,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-01-09 16:50:59,334 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-01-09 16:50:59,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-01-09 16:50:59,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-01-09 16:50:59,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-01-09 16:50:59,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-01-09 16:50:59,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-01-09 16:50:59,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-01-09 16:50:59,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-01-09 16:50:59,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-01-09 16:50:59,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-01-09 16:50:59,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-01-09 16:50:59,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-01-09 16:50:59,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-01-09 16:50:59,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-01-09 16:50:59,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-01-09 16:50:59,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-01-09 16:50:59,343 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-01-09 16:50:59,343 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-01-09 16:50:59,343 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-01-09 16:50:59,343 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-01-09 16:50:59,344 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-01-09 16:50:59,345 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-01-09 16:50:59,345 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-01-09 16:50:59,345 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-01-09 16:50:59,346 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-01-09 16:50:59,346 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-01-09 16:50:59,346 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-01-09 16:50:59,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-01-09 16:50:59,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-01-09 16:50:59,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-01-09 16:50:59,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-01-09 16:50:59,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-01-09 16:50:59,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-01-09 16:50:59,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-01-09 16:50:59,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-01-09 16:50:59,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-01-09 16:50:59,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-01-09 16:50:59,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-01-09 16:50:59,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-01-09 16:50:59,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-01-09 16:50:59,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-01-09 16:50:59,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172094,172107] [2025-01-09 16:50:59,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172145,172158] [2025-01-09 16:50:59,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172202,172215] [2025-01-09 16:50:59,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172763,172776] [2025-01-09 16:50:59,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172814,172827] [2025-01-09 16:50:59,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174060,174073] [2025-01-09 16:50:59,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174118,174131] [2025-01-09 16:50:59,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174622,174635] [2025-01-09 16:50:59,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174679,174692] [2025-01-09 16:50:59,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174746,174759] [2025-01-09 16:50:59,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175274,175287] [2025-01-09 16:50:59,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175341,175354] [2025-01-09 16:50:59,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175944,175957] [2025-01-09 16:50:59,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198494,198507] [2025-01-09 16:50:59,421 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198561,198574] [2025-01-09 16:50:59,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:50:59,750 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:50:59,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59 WrapperNode [2025-01-09 16:50:59,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:50:59,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:50:59,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:50:59,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:50:59,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59" (1/1) ... [2025-01-09 16:50:59,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59" (1/1) ... [2025-01-09 16:50:59,928 INFO L138 Inliner]: procedures = 921, calls = 957, calls flagged for inlining = 833, calls inlined = 67, statements flattened = 799 [2025-01-09 16:50:59,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:50:59,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:50:59,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:50:59,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:50:59,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59" (1/1) ... [2025-01-09 16:50:59,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59" (1/1) ... [2025-01-09 16:50:59,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59" (1/1) ... [2025-01-09 16:50:59,998 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-01-09 16:50:59,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59" (1/1) ... [2025-01-09 16:50:59,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59" (1/1) ... [2025-01-09 16:51:00,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59" (1/1) ... [2025-01-09 16:51:00,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59" (1/1) ... [2025-01-09 16:51:00,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59" (1/1) ... [2025-01-09 16:51:00,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59" (1/1) ... [2025-01-09 16:51:00,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59" (1/1) ... [2025-01-09 16:51:00,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:51:00,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:51:00,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:51:00,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:51:00,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59" (1/1) ... [2025-01-09 16:51:00,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:51:00,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:51:00,112 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:51:00,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:51:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:51:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:51:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 16:51:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 16:51:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:51:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 16:51:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 16:51:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 16:51:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 16:51:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:51:00,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:51:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-01-09 16:51:00,136 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-01-09 16:51:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 16:51:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 16:51:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 16:51:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 16:51:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 16:51:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:51:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:51:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 16:51:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 16:51:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 16:51:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 16:51:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 16:51:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 16:51:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 16:51:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:51:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:51:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:51:00,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 16:51:00,139 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:51:00,317 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:51:00,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:51:01,360 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:51:01,360 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:51:01,839 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:51:01,841 INFO L312 CfgBuilder]: Removed 53 assume(true) statements. [2025-01-09 16:51:01,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:51:01 BoogieIcfgContainer [2025-01-09 16:51:01,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:51:01,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:51:01,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:51:01,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:51:01,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:50:57" (1/3) ... [2025-01-09 16:51:01,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5ba121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:51:01, skipping insertion in model container [2025-01-09 16:51:01,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:50:59" (2/3) ... [2025-01-09 16:51:01,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5ba121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:51:01, skipping insertion in model container [2025-01-09 16:51:01,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:51:01" (3/3) ... [2025-01-09 16:51:01,853 INFO L128 eAbstractionObserver]: Analyzing ICFG hclhlock.i [2025-01-09 16:51:01,868 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:51:01,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hclhlock.i that has 2 procedures, 243 locations, 1 initial locations, 60 loop locations, and 17 error locations. [2025-01-09 16:51:01,870 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:51:02,082 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 16:51:02,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 383 transitions, 773 flow [2025-01-09 16:51:02,213 INFO L124 PetriNetUnfolderBase]: 151/413 cut-off events. [2025-01-09 16:51:02,215 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:51:02,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 413 events. 151/413 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1249 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 314. Up to 6 conditions per place. [2025-01-09 16:51:02,223 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 383 transitions, 773 flow [2025-01-09 16:51:02,231 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 383 transitions, 773 flow [2025-01-09 16:51:02,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:51:02,249 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;@79ad5b6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:51:02,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-01-09 16:51:02,258 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:51:02,258 INFO L124 PetriNetUnfolderBase]: 7/25 cut-off events. [2025-01-09 16:51:02,259 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:51:02,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:02,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:02,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 16:51:02,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:02,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1441606959, now seen corresponding path program 1 times [2025-01-09 16:51:02,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:02,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762834345] [2025-01-09 16:51:02,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:02,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:02,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:51:02,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:51:02,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:02,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:02,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:02,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762834345] [2025-01-09 16:51:02,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762834345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:02,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:02,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:51:02,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107196924] [2025-01-09 16:51:02,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:02,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:51:02,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:02,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:51:02,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:51:02,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 383 [2025-01-09 16:51:02,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 383 transitions, 773 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:02,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:02,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 383 [2025-01-09 16:51:02,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:03,443 INFO L124 PetriNetUnfolderBase]: 945/2636 cut-off events. [2025-01-09 16:51:03,443 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:51:03,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4369 conditions, 2636 events. 945/2636 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17846 event pairs, 696 based on Foata normal form. 1465/3689 useless extension candidates. Maximal degree in co-relation 4259. Up to 1717 conditions per place. [2025-01-09 16:51:03,465 INFO L140 encePairwiseOnDemand]: 273/383 looper letters, 141 selfloop transitions, 3 changer transitions 0/274 dead transitions. [2025-01-09 16:51:03,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 274 transitions, 843 flow [2025-01-09 16:51:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:51:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:51:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 775 transitions. [2025-01-09 16:51:03,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5058746736292428 [2025-01-09 16:51:03,483 INFO L175 Difference]: Start difference. First operand has 246 places, 383 transitions, 773 flow. Second operand 4 states and 775 transitions. [2025-01-09 16:51:03,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 274 transitions, 843 flow [2025-01-09 16:51:03,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 274 transitions, 843 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:51:03,499 INFO L231 Difference]: Finished difference. Result has 247 places, 274 transitions, 561 flow [2025-01-09 16:51:03,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=561, PETRI_PLACES=247, PETRI_TRANSITIONS=274} [2025-01-09 16:51:03,503 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 1 predicate places. [2025-01-09 16:51:03,504 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 274 transitions, 561 flow [2025-01-09 16:51:03,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:03,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:03,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:03,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:51:03,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 16:51:03,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:03,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1890197549, now seen corresponding path program 1 times [2025-01-09 16:51:03,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:03,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702691858] [2025-01-09 16:51:03,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:03,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:03,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:51:03,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:51:03,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:03,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:03,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:03,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702691858] [2025-01-09 16:51:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702691858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:03,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:51:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49476941] [2025-01-09 16:51:03,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:03,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:51:03,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:03,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:51:03,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:51:03,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 383 [2025-01-09 16:51:03,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 274 transitions, 561 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:03,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:03,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 383 [2025-01-09 16:51:03,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:04,250 INFO L124 PetriNetUnfolderBase]: 945/2634 cut-off events. [2025-01-09 16:51:04,251 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:51:04,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4371 conditions, 2634 events. 945/2634 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17841 event pairs, 696 based on Foata normal form. 1/2225 useless extension candidates. Maximal degree in co-relation 4324. Up to 1717 conditions per place. [2025-01-09 16:51:04,262 INFO L140 encePairwiseOnDemand]: 379/383 looper letters, 141 selfloop transitions, 3 changer transitions 0/272 dead transitions. [2025-01-09 16:51:04,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 272 transitions, 845 flow [2025-01-09 16:51:04,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:51:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:51:04,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 669 transitions. [2025-01-09 16:51:04,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4366840731070496 [2025-01-09 16:51:04,265 INFO L175 Difference]: Start difference. First operand has 247 places, 274 transitions, 561 flow. Second operand 4 states and 669 transitions. [2025-01-09 16:51:04,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 272 transitions, 845 flow [2025-01-09 16:51:04,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 272 transitions, 839 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:51:04,270 INFO L231 Difference]: Finished difference. Result has 245 places, 272 transitions, 557 flow [2025-01-09 16:51:04,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=557, PETRI_PLACES=245, PETRI_TRANSITIONS=272} [2025-01-09 16:51:04,271 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -1 predicate places. [2025-01-09 16:51:04,271 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 272 transitions, 557 flow [2025-01-09 16:51:04,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:04,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:04,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:04,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:51:04,272 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 16:51:04,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash -291513120, now seen corresponding path program 1 times [2025-01-09 16:51:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:04,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040964083] [2025-01-09 16:51:04,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:04,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:51:04,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:51:04,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:04,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:04,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:04,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040964083] [2025-01-09 16:51:04,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040964083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:04,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:04,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:51:04,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136600704] [2025-01-09 16:51:04,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:04,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:51:04,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:04,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:51:04,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:51:04,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 383 [2025-01-09 16:51:04,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 272 transitions, 557 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:04,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:04,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 383 [2025-01-09 16:51:04,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:04,878 INFO L124 PetriNetUnfolderBase]: 945/2637 cut-off events. [2025-01-09 16:51:04,878 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:51:04,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4377 conditions, 2637 events. 945/2637 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17864 event pairs, 696 based on Foata normal form. 0/2227 useless extension candidates. Maximal degree in co-relation 4330. Up to 1724 conditions per place. [2025-01-09 16:51:04,890 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 145 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2025-01-09 16:51:04,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 275 transitions, 857 flow [2025-01-09 16:51:04,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:51:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:51:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2025-01-09 16:51:04,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4734551784160139 [2025-01-09 16:51:04,893 INFO L175 Difference]: Start difference. First operand has 245 places, 272 transitions, 557 flow. Second operand 3 states and 544 transitions. [2025-01-09 16:51:04,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 275 transitions, 857 flow [2025-01-09 16:51:04,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 275 transitions, 851 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:51:04,903 INFO L231 Difference]: Finished difference. Result has 245 places, 273 transitions, 563 flow [2025-01-09 16:51:04,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=245, PETRI_TRANSITIONS=273} [2025-01-09 16:51:04,905 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -1 predicate places. [2025-01-09 16:51:04,905 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 273 transitions, 563 flow [2025-01-09 16:51:04,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:04,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:04,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:04,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:51:04,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 16:51:04,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:04,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1777619274, now seen corresponding path program 1 times [2025-01-09 16:51:04,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:04,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516196522] [2025-01-09 16:51:04,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:04,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:04,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:51:04,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:51:04,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:04,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:05,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:05,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:05,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516196522] [2025-01-09 16:51:05,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516196522] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:51:05,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307974086] [2025-01-09 16:51:05,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:05,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:51:05,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:51:05,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:51:05,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:51:05,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:51:05,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:51:05,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:05,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:05,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:51:05,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:51:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:05,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:51:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:05,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307974086] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:51:05,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:51:05,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 16:51:05,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196817634] [2025-01-09 16:51:05,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:51:05,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:51:05,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:05,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:51:05,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:51:05,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 383 [2025-01-09 16:51:05,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 273 transitions, 563 flow. Second operand has 7 states, 7 states have (on average 134.42857142857142) internal successors, (941), 7 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:05,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:05,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 383 [2025-01-09 16:51:05,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:06,018 INFO L124 PetriNetUnfolderBase]: 945/2640 cut-off events. [2025-01-09 16:51:06,018 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:51:06,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4387 conditions, 2640 events. 945/2640 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17864 event pairs, 696 based on Foata normal form. 1/2231 useless extension candidates. Maximal degree in co-relation 4363. Up to 1722 conditions per place. [2025-01-09 16:51:06,028 INFO L140 encePairwiseOnDemand]: 379/383 looper letters, 145 selfloop transitions, 5 changer transitions 0/278 dead transitions. [2025-01-09 16:51:06,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 278 transitions, 875 flow [2025-01-09 16:51:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:51:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:51:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 811 transitions. [2025-01-09 16:51:06,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42349869451697125 [2025-01-09 16:51:06,034 INFO L175 Difference]: Start difference. First operand has 245 places, 273 transitions, 563 flow. Second operand 5 states and 811 transitions. [2025-01-09 16:51:06,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 278 transitions, 875 flow [2025-01-09 16:51:06,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 278 transitions, 873 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:51:06,038 INFO L231 Difference]: Finished difference. Result has 250 places, 275 transitions, 587 flow [2025-01-09 16:51:06,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=587, PETRI_PLACES=250, PETRI_TRANSITIONS=275} [2025-01-09 16:51:06,039 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 4 predicate places. [2025-01-09 16:51:06,039 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 275 transitions, 587 flow [2025-01-09 16:51:06,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 134.42857142857142) internal successors, (941), 7 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:06,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:06,040 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:06,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:51:06,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:51:06,245 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 16:51:06,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:06,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1843165920, now seen corresponding path program 2 times [2025-01-09 16:51:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:06,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485467656] [2025-01-09 16:51:06,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:51:06,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:06,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-09 16:51:06,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 19 statements. [2025-01-09 16:51:06,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:51:06,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:51:06,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:06,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485467656] [2025-01-09 16:51:06,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485467656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:06,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:06,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:51:06,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649225694] [2025-01-09 16:51:06,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:06,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:51:06,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:06,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:51:06,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:51:06,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 383 [2025-01-09 16:51:06,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 275 transitions, 587 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:06,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:06,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 383 [2025-01-09 16:51:06,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:06,887 INFO L124 PetriNetUnfolderBase]: 945/2638 cut-off events. [2025-01-09 16:51:06,887 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 16:51:06,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4396 conditions, 2638 events. 945/2638 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17815 event pairs, 696 based on Foata normal form. 1/2230 useless extension candidates. Maximal degree in co-relation 4348. Up to 1724 conditions per place. [2025-01-09 16:51:06,899 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 145 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-01-09 16:51:06,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 273 transitions, 877 flow [2025-01-09 16:51:06,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:51:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:51:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2025-01-09 16:51:06,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46823324630113144 [2025-01-09 16:51:06,902 INFO L175 Difference]: Start difference. First operand has 250 places, 275 transitions, 587 flow. Second operand 3 states and 538 transitions. [2025-01-09 16:51:06,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 273 transitions, 877 flow [2025-01-09 16:51:06,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 273 transitions, 871 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:51:06,907 INFO L231 Difference]: Finished difference. Result has 249 places, 273 transitions, 581 flow [2025-01-09 16:51:06,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=249, PETRI_TRANSITIONS=273} [2025-01-09 16:51:06,908 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 3 predicate places. [2025-01-09 16:51:06,908 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 273 transitions, 581 flow [2025-01-09 16:51:06,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:06,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:06,909 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-01-09 16:51:06,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:51:06,909 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 16:51:06,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1399088079, now seen corresponding path program 1 times [2025-01-09 16:51:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:06,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395830555] [2025-01-09 16:51:06,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:06,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:06,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:51:06,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:51:06,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:06,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:51:07,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:07,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395830555] [2025-01-09 16:51:07,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395830555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:07,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:07,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:51:07,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246886163] [2025-01-09 16:51:07,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:07,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:51:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:07,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:51:07,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:51:07,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 383 [2025-01-09 16:51:07,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 273 transitions, 581 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:07,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:07,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 383 [2025-01-09 16:51:07,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:07,711 INFO L124 PetriNetUnfolderBase]: 945/2636 cut-off events. [2025-01-09 16:51:07,711 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:51:07,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4394 conditions, 2636 events. 945/2636 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17808 event pairs, 696 based on Foata normal form. 1/2230 useless extension candidates. Maximal degree in co-relation 4351. Up to 1724 conditions per place. [2025-01-09 16:51:07,724 INFO L140 encePairwiseOnDemand]: 378/383 looper letters, 143 selfloop transitions, 4 changer transitions 0/271 dead transitions. [2025-01-09 16:51:07,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 271 transitions, 871 flow [2025-01-09 16:51:07,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:51:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:51:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 665 transitions. [2025-01-09 16:51:07,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43407310704960833 [2025-01-09 16:51:07,728 INFO L175 Difference]: Start difference. First operand has 249 places, 273 transitions, 581 flow. Second operand 4 states and 665 transitions. [2025-01-09 16:51:07,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 271 transitions, 871 flow [2025-01-09 16:51:07,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 271 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:51:07,733 INFO L231 Difference]: Finished difference. Result has 248 places, 271 transitions, 581 flow [2025-01-09 16:51:07,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=581, PETRI_PLACES=248, PETRI_TRANSITIONS=271} [2025-01-09 16:51:07,734 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 2 predicate places. [2025-01-09 16:51:07,735 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 271 transitions, 581 flow [2025-01-09 16:51:07,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:07,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:07,735 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] [2025-01-09 16:51:07,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:51:07,736 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 16:51:07,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:07,736 INFO L85 PathProgramCache]: Analyzing trace with hash 712434479, now seen corresponding path program 1 times [2025-01-09 16:51:07,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:07,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050979781] [2025-01-09 16:51:07,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:07,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:07,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:51:07,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:51:07,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:07,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:51:07,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:07,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050979781] [2025-01-09 16:51:07,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050979781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:07,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:07,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:51:07,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687815431] [2025-01-09 16:51:07,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:07,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:51:07,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:07,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:51:07,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:51:07,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 383 [2025-01-09 16:51:07,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 271 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:07,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:07,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 383 [2025-01-09 16:51:07,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:08,311 INFO L124 PetriNetUnfolderBase]: 948/2659 cut-off events. [2025-01-09 16:51:08,311 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 16:51:08,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4434 conditions, 2659 events. 948/2659 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17843 event pairs, 696 based on Foata normal form. 1/2253 useless extension candidates. Maximal degree in co-relation 4388. Up to 1734 conditions per place. [2025-01-09 16:51:08,322 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 156 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-01-09 16:51:08,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 282 transitions, 927 flow [2025-01-09 16:51:08,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:51:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:51:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2025-01-09 16:51:08,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4804177545691906 [2025-01-09 16:51:08,325 INFO L175 Difference]: Start difference. First operand has 248 places, 271 transitions, 581 flow. Second operand 3 states and 552 transitions. [2025-01-09 16:51:08,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 282 transitions, 927 flow [2025-01-09 16:51:08,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 282 transitions, 911 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:51:08,330 INFO L231 Difference]: Finished difference. Result has 248 places, 272 transitions, 585 flow [2025-01-09 16:51:08,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=585, PETRI_PLACES=248, PETRI_TRANSITIONS=272} [2025-01-09 16:51:08,332 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 2 predicate places. [2025-01-09 16:51:08,333 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 272 transitions, 585 flow [2025-01-09 16:51:08,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:08,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:08,333 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:08,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:51:08,334 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 16:51:08,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:08,335 INFO L85 PathProgramCache]: Analyzing trace with hash 456556182, now seen corresponding path program 1 times [2025-01-09 16:51:08,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:08,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093451064] [2025-01-09 16:51:08,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:08,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:08,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 16:51:08,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:51:08,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:08,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:51:08,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:08,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093451064] [2025-01-09 16:51:08,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093451064] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:51:08,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26585875] [2025-01-09 16:51:08,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:08,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:51:08,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:51:08,516 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:51:08,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:51:08,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 16:51:08,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 16:51:08,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:08,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:08,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:51:08,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:51:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:51:08,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:51:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:51:08,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26585875] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:51:08,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:51:08,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2025-01-09 16:51:08,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448641682] [2025-01-09 16:51:08,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:51:08,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:51:08,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:08,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:51:08,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:51:08,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 383 [2025-01-09 16:51:08,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 272 transitions, 585 flow. Second operand has 9 states, 9 states have (on average 136.44444444444446) internal successors, (1228), 9 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:08,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:08,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 383 [2025-01-09 16:51:08,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:09,627 INFO L124 PetriNetUnfolderBase]: 951/2683 cut-off events. [2025-01-09 16:51:09,627 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 16:51:09,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4469 conditions, 2683 events. 951/2683 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17712 event pairs, 696 based on Foata normal form. 2/2278 useless extension candidates. Maximal degree in co-relation 4422. Up to 1723 conditions per place. [2025-01-09 16:51:09,644 INFO L140 encePairwiseOnDemand]: 379/383 looper letters, 165 selfloop transitions, 5 changer transitions 0/294 dead transitions. [2025-01-09 16:51:09,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 294 transitions, 971 flow [2025-01-09 16:51:09,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:51:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:51:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 829 transitions. [2025-01-09 16:51:09,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43289817232375977 [2025-01-09 16:51:09,647 INFO L175 Difference]: Start difference. First operand has 248 places, 272 transitions, 585 flow. Second operand 5 states and 829 transitions. [2025-01-09 16:51:09,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 294 transitions, 971 flow [2025-01-09 16:51:09,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 294 transitions, 969 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:51:09,691 INFO L231 Difference]: Finished difference. Result has 254 places, 274 transitions, 613 flow [2025-01-09 16:51:09,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=613, PETRI_PLACES=254, PETRI_TRANSITIONS=274} [2025-01-09 16:51:09,692 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 8 predicate places. [2025-01-09 16:51:09,692 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 274 transitions, 613 flow [2025-01-09 16:51:09,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 136.44444444444446) internal successors, (1228), 9 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:09,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:09,693 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, 1, 1] [2025-01-09 16:51:09,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:51:09,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:51:09,894 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 16:51:09,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:09,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1897442148, now seen corresponding path program 2 times [2025-01-09 16:51:09,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:09,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145666854] [2025-01-09 16:51:09,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:51:09,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:09,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-01-09 16:51:10,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 16:51:10,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:51:10,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 16:51:10,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:10,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145666854] [2025-01-09 16:51:10,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145666854] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:51:10,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660173336] [2025-01-09 16:51:10,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:51:10,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:51:10,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:51:10,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:51:10,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:51:10,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-01-09 16:51:10,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 16:51:10,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:51:10,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:10,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 16:51:10,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:51:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 16:51:10,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:51:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 16:51:11,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660173336] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:51:11,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:51:11,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-01-09 16:51:11,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895550022] [2025-01-09 16:51:11,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:51:11,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:51:11,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:11,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:51:11,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:51:11,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 383 [2025-01-09 16:51:11,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 274 transitions, 613 flow. Second operand has 14 states, 14 states have (on average 131.71428571428572) internal successors, (1844), 14 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:11,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:11,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 383 [2025-01-09 16:51:11,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:12,961 INFO L124 PetriNetUnfolderBase]: 953/2719 cut-off events. [2025-01-09 16:51:12,961 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 16:51:12,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4558 conditions, 2719 events. 953/2719 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17894 event pairs, 696 based on Foata normal form. 2/2306 useless extension candidates. Maximal degree in co-relation 4509. Up to 1723 conditions per place. [2025-01-09 16:51:12,975 INFO L140 encePairwiseOnDemand]: 372/383 looper letters, 173 selfloop transitions, 27 changer transitions 0/322 dead transitions. [2025-01-09 16:51:12,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 322 transitions, 1129 flow [2025-01-09 16:51:12,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:51:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 16:51:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2504 transitions. [2025-01-09 16:51:12,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3632143893240499 [2025-01-09 16:51:12,984 INFO L175 Difference]: Start difference. First operand has 254 places, 274 transitions, 613 flow. Second operand 18 states and 2504 transitions. [2025-01-09 16:51:12,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 322 transitions, 1129 flow [2025-01-09 16:51:12,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 322 transitions, 1121 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-09 16:51:12,992 INFO L231 Difference]: Finished difference. Result has 280 places, 298 transitions, 790 flow [2025-01-09 16:51:12,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=790, PETRI_PLACES=280, PETRI_TRANSITIONS=298} [2025-01-09 16:51:12,994 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 34 predicate places. [2025-01-09 16:51:12,994 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 298 transitions, 790 flow [2025-01-09 16:51:12,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 131.71428571428572) internal successors, (1844), 14 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:12,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:12,996 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, 1, 1] [2025-01-09 16:51:13,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:51:13,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:51:13,197 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 16:51:13,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:13,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1582766253, now seen corresponding path program 1 times [2025-01-09 16:51:13,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:13,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145604963] [2025-01-09 16:51:13,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:13,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:13,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 16:51:13,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 16:51:13,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:13,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 16:51:13,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:13,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145604963] [2025-01-09 16:51:13,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145604963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:13,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:13,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:51:13,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308711448] [2025-01-09 16:51:13,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:13,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:51:13,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:13,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:51:13,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:51:13,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 383 [2025-01-09 16:51:13,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 298 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:13,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:13,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 383 [2025-01-09 16:51:13,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:13,979 INFO L124 PetriNetUnfolderBase]: 945/2691 cut-off events. [2025-01-09 16:51:13,979 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-01-09 16:51:13,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4572 conditions, 2691 events. 945/2691 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 17782 event pairs, 696 based on Foata normal form. 4/2288 useless extension candidates. Maximal degree in co-relation 4512. Up to 1757 conditions per place. [2025-01-09 16:51:13,992 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 161 selfloop transitions, 6 changer transitions 0/288 dead transitions. [2025-01-09 16:51:13,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 288 transitions, 1080 flow [2025-01-09 16:51:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:51:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:51:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2025-01-09 16:51:13,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46475195822454307 [2025-01-09 16:51:13,995 INFO L175 Difference]: Start difference. First operand has 280 places, 298 transitions, 790 flow. Second operand 3 states and 534 transitions. [2025-01-09 16:51:13,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 288 transitions, 1080 flow [2025-01-09 16:51:13,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 288 transitions, 1057 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-09 16:51:14,001 INFO L231 Difference]: Finished difference. Result has 273 places, 288 transitions, 735 flow [2025-01-09 16:51:14,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=383, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=735, PETRI_PLACES=273, PETRI_TRANSITIONS=288} [2025-01-09 16:51:14,002 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 27 predicate places. [2025-01-09 16:51:14,003 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 288 transitions, 735 flow [2025-01-09 16:51:14,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:14,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:14,003 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, 1, 1] [2025-01-09 16:51:14,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:51:14,003 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-01-09 16:51:14,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:14,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1816306657, now seen corresponding path program 1 times [2025-01-09 16:51:14,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:14,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318594028] [2025-01-09 16:51:14,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:14,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:14,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 16:51:14,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 16:51:14,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:14,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:51:14,170 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:51:14,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 16:51:14,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 16:51:14,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:14,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:51:14,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:51:14,329 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:51:14,330 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-01-09 16:51:14,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2025-01-09 16:51:14,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2025-01-09 16:51:14,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2025-01-09 16:51:14,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2025-01-09 16:51:14,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2025-01-09 16:51:14,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2025-01-09 16:51:14,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2025-01-09 16:51:14,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2025-01-09 16:51:14,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2025-01-09 16:51:14,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2025-01-09 16:51:14,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2025-01-09 16:51:14,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2025-01-09 16:51:14,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2025-01-09 16:51:14,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2025-01-09 16:51:14,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2025-01-09 16:51:14,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2025-01-09 16:51:14,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2025-01-09 16:51:14,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2025-01-09 16:51:14,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2025-01-09 16:51:14,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2025-01-09 16:51:14,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2025-01-09 16:51:14,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2025-01-09 16:51:14,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2025-01-09 16:51:14,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2025-01-09 16:51:14,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2025-01-09 16:51:14,334 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2025-01-09 16:51:14,334 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2025-01-09 16:51:14,334 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2025-01-09 16:51:14,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:51:14,334 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:14,336 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:51:14,336 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:51:14,484 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:51:14,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 427 places, 668 transitions, 1352 flow [2025-01-09 16:51:14,588 INFO L124 PetriNetUnfolderBase]: 275/750 cut-off events. [2025-01-09 16:51:14,589 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 16:51:14,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 750 events. 275/750 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3121 event pairs, 0 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 617. Up to 12 conditions per place. [2025-01-09 16:51:14,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 427 places, 668 transitions, 1352 flow [2025-01-09 16:51:14,624 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 427 places, 668 transitions, 1352 flow [2025-01-09 16:51:14,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:51:14,626 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;@79ad5b6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:51:14,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-01-09 16:51:14,669 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:51:14,669 INFO L124 PetriNetUnfolderBase]: 7/25 cut-off events. [2025-01-09 16:51:14,669 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:51:14,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:14,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:14,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2025-01-09 16:51:14,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1054639981, now seen corresponding path program 1 times [2025-01-09 16:51:14,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:14,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005588263] [2025-01-09 16:51:14,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:14,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:14,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:51:14,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:51:14,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:14,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:14,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:14,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005588263] [2025-01-09 16:51:14,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005588263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:14,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:14,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:51:14,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068734378] [2025-01-09 16:51:14,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:14,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:51:14,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:14,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:51:14,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:51:14,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 668 [2025-01-09 16:51:14,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 668 transitions, 1352 flow. Second operand has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:14,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:14,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 668 [2025-01-09 16:51:14,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:40,176 INFO L124 PetriNetUnfolderBase]: 174468/306804 cut-off events. [2025-01-09 16:51:40,176 INFO L125 PetriNetUnfolderBase]: For 772/772 co-relation queries the response was YES. [2025-01-09 16:51:40,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550245 conditions, 306804 events. 174468/306804 cut-off events. For 772/772 co-relation queries the response was YES. Maximal size of possible extension queue 4495. Compared 3202094 event pairs, 132370 based on Foata normal form. 178829/442107 useless extension candidates. Maximal degree in co-relation 527136. Up to 242983 conditions per place. [2025-01-09 16:51:42,207 INFO L140 encePairwiseOnDemand]: 480/668 looper letters, 253 selfloop transitions, 3 changer transitions 0/481 dead transitions. [2025-01-09 16:51:42,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 481 transitions, 1490 flow [2025-01-09 16:51:42,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:51:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:51:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1345 transitions. [2025-01-09 16:51:42,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5033682634730539 [2025-01-09 16:51:42,212 INFO L175 Difference]: Start difference. First operand has 427 places, 668 transitions, 1352 flow. Second operand 4 states and 1345 transitions. [2025-01-09 16:51:42,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 481 transitions, 1490 flow [2025-01-09 16:51:42,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 481 transitions, 1490 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:51:42,220 INFO L231 Difference]: Finished difference. Result has 428 places, 481 transitions, 984 flow [2025-01-09 16:51:42,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=668, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=984, PETRI_PLACES=428, PETRI_TRANSITIONS=481} [2025-01-09 16:51:42,222 INFO L279 CegarLoopForPetriNet]: 427 programPoint places, 1 predicate places. [2025-01-09 16:51:42,223 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 481 transitions, 984 flow [2025-01-09 16:51:42,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:42,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:42,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:42,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:51:42,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2025-01-09 16:51:42,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:42,224 INFO L85 PathProgramCache]: Analyzing trace with hash -103190199, now seen corresponding path program 1 times [2025-01-09 16:51:42,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:42,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125487586] [2025-01-09 16:51:42,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:42,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:42,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:51:42,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:51:42,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:42,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:42,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:42,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:42,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125487586] [2025-01-09 16:51:42,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125487586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:42,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:42,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:51:42,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712046255] [2025-01-09 16:51:42,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:42,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:51:42,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:42,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:51:42,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:51:42,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 668 [2025-01-09 16:51:42,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 481 transitions, 984 flow. Second operand has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:42,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:42,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 668 [2025-01-09 16:51:42,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand