./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.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 f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:45:41,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:45:41,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:45:41,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:45:41,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:45:41,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:45:41,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:45:41,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:45:41,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:45:41,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:45:41,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:45:41,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:45:41,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:45:41,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:45:41,669 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:45:41,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:45:41,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:45:41,669 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:45:41,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:45:41,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:45:41,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:45:41,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:45:41,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:45:41,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:45:41,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:45:41,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:45:41,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:45:41,669 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:45:41,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:45:41,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:45:41,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:45:41,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:45:41,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:45:41,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:45:41,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:45:41,670 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:45:41,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:45:41,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:45:41,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:45:41,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:45:41,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:45:41,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:45:41,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:45:41,670 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 -> f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe [2025-02-06 04:45:42,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:45:42,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:45:42,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:45:42,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:45:42,085 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:45:42,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-02-06 04:45:43,225 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29f2e168b/4d4283a89e68461fb7113caffe9e7e53/FLAGd88681ac6 [2025-02-06 04:45:43,710 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:45:43,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-02-06 04:45:43,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29f2e168b/4d4283a89e68461fb7113caffe9e7e53/FLAGd88681ac6 [2025-02-06 04:45:43,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29f2e168b/4d4283a89e68461fb7113caffe9e7e53 [2025-02-06 04:45:43,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:45:43,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:45:43,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:45:43,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:45:43,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:45:43,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:45:43" (1/1) ... [2025-02-06 04:45:43,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e32cc29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:43, skipping insertion in model container [2025-02-06 04:45:43,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:45:43" (1/1) ... [2025-02-06 04:45:43,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:45:45,386 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/bounded_mpmc_check_full.i[193617,193630] [2025-02-06 04:45:45,387 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/bounded_mpmc_check_full.i[193693,193706] [2025-02-06 04:45:45,427 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/bounded_mpmc_check_full.i[196266,196279] [2025-02-06 04:45:45,428 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/bounded_mpmc_check_full.i[196373,196386] [2025-02-06 04:45:45,430 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/bounded_mpmc_check_full.i[196444,196457] [2025-02-06 04:45:45,430 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/bounded_mpmc_check_full.i[196555,196568] [2025-02-06 04:45:45,431 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/bounded_mpmc_check_full.i[196668,196681] [2025-02-06 04:45:45,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:45:45,439 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:45:45,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-02-06 04:45:45,599 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-02-06 04:45:45,599 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-02-06 04:45:45,601 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-02-06 04:45:45,601 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-02-06 04:45:45,601 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-02-06 04:45:45,601 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-02-06 04:45:45,602 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-02-06 04:45:45,602 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-02-06 04:45:45,603 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-02-06 04:45:45,604 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-02-06 04:45:45,604 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-02-06 04:45:45,605 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-02-06 04:45:45,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-02-06 04:45:45,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-02-06 04:45:45,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-02-06 04:45:45,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-02-06 04:45:45,607 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-02-06 04:45:45,608 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-02-06 04:45:45,608 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-02-06 04:45:45,608 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-02-06 04:45:45,608 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-02-06 04:45:45,609 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-02-06 04:45:45,609 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-02-06 04:45:45,609 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-02-06 04:45:45,609 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-02-06 04:45:45,610 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-02-06 04:45:45,611 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-02-06 04:45:45,611 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-02-06 04:45:45,611 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-02-06 04:45:45,612 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-02-06 04:45:45,612 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-02-06 04:45:45,612 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-02-06 04:45:45,612 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-02-06 04:45:45,613 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-02-06 04:45:45,613 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-02-06 04:45:45,613 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-02-06 04:45:45,613 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-02-06 04:45:45,614 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-02-06 04:45:45,614 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-02-06 04:45:45,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-02-06 04:45:45,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-02-06 04:45:45,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-02-06 04:45:45,616 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-02-06 04:45:45,616 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-02-06 04:45:45,617 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-02-06 04:45:45,617 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-02-06 04:45:45,618 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-02-06 04:45:45,619 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-02-06 04:45:45,619 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-02-06 04:45:45,619 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-02-06 04:45:45,620 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-02-06 04:45:45,620 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-02-06 04:45:45,620 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-02-06 04:45:45,620 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-02-06 04:45:45,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-02-06 04:45:45,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-02-06 04:45:45,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-02-06 04:45:45,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-02-06 04:45:45,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-02-06 04:45:45,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-02-06 04:45:45,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-02-06 04:45:45,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-02-06 04:45:45,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-02-06 04:45:45,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-02-06 04:45:45,623 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-02-06 04:45:45,623 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-02-06 04:45:45,623 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-02-06 04:45:45,623 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-02-06 04:45:45,626 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-02-06 04:45:45,626 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-02-06 04:45:45,626 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-02-06 04:45:45,626 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-02-06 04:45:45,627 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-02-06 04:45:45,627 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-02-06 04:45:45,628 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-02-06 04:45:45,628 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-02-06 04:45:45,628 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-02-06 04:45:45,629 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-02-06 04:45:45,629 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-02-06 04:45:45,629 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-02-06 04:45:45,630 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-02-06 04:45:45,630 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-02-06 04:45:45,631 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-02-06 04:45:45,631 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-02-06 04:45:45,632 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-02-06 04:45:45,632 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-02-06 04:45:45,632 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-02-06 04:45:45,632 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-02-06 04:45:45,633 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-02-06 04:45:45,633 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-02-06 04:45:45,633 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-02-06 04:45:45,633 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-02-06 04:45:45,634 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-02-06 04:45:45,634 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-02-06 04:45:45,635 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-02-06 04:45:45,635 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-02-06 04:45:45,636 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-02-06 04:45:45,637 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-02-06 04:45:45,637 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-02-06 04:45:45,678 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/bounded_mpmc_check_full.i[193617,193630] [2025-02-06 04:45:45,679 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/bounded_mpmc_check_full.i[193693,193706] [2025-02-06 04:45:45,686 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/bounded_mpmc_check_full.i[196266,196279] [2025-02-06 04:45:45,687 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/bounded_mpmc_check_full.i[196373,196386] [2025-02-06 04:45:45,688 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/bounded_mpmc_check_full.i[196444,196457] [2025-02-06 04:45:45,688 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/bounded_mpmc_check_full.i[196555,196568] [2025-02-06 04:45:45,689 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/bounded_mpmc_check_full.i[196668,196681] [2025-02-06 04:45:45,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:45:45,879 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:45:45,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:45 WrapperNode [2025-02-06 04:45:45,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:45:45,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:45:45,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:45:45,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:45:45,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:45" (1/1) ... [2025-02-06 04:45:45,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:45" (1/1) ... [2025-02-06 04:45:45,968 INFO L138 Inliner]: procedures = 914, calls = 950, calls flagged for inlining = 815, calls inlined = 57, statements flattened = 628 [2025-02-06 04:45:45,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:45:45,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:45:45,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:45:45,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:45:45,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:45" (1/1) ... [2025-02-06 04:45:45,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:45" (1/1) ... [2025-02-06 04:45:45,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:45" (1/1) ... [2025-02-06 04:45:46,019 INFO L175 MemorySlicer]: Split 65 memory accesses to 5 slices as follows [2, 8, 44, 2, 9]. 68 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 4, 6, 0, 5]. The 20 writes are split as follows [0, 3, 14, 1, 2]. [2025-02-06 04:45:46,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:45" (1/1) ... [2025-02-06 04:45:46,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:45" (1/1) ... [2025-02-06 04:45:46,041 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:45" (1/1) ... [2025-02-06 04:45:46,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:45" (1/1) ... [2025-02-06 04:45:46,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:45" (1/1) ... [2025-02-06 04:45:46,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:45" (1/1) ... [2025-02-06 04:45:46,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:45:46,058 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:45:46,058 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:45:46,058 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:45:46,059 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:45" (1/1) ... [2025-02-06 04:45:46,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:45:46,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:45:46,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:45:46,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:45:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:45:46,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:45:46,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 04:45:46,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 04:45:46,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:45:46,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-02-06 04:45:46,131 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 04:45:46,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 04:45:46,133 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:45:46,295 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:45:46,297 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:45:46,847 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-06 04:45:46,848 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-9: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-06 04:45:46,848 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483-18: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-06 04:45:46,849 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6036-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-02-06 04:45:46,850 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6036: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-02-06 04:45:46,850 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-06 04:45:46,850 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-9: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-06 04:45:46,850 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043: havoc main_~#r~0#1.base, main_~#r~0#1.offset; [2025-02-06 04:45:46,850 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6043-1: SUMMARY for call ULTIMATE.dealloc(main_~#r~0#1.base, main_~#r~0#1.offset); srcloc: null [2025-02-06 04:45:46,850 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-06 04:45:46,850 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-9: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-06 04:45:46,850 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-18: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-06 04:45:46,850 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-27: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-06 04:45:46,850 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2808: havoc vatomic32_await_eq_rlx_#t~ret172#1; [2025-02-06 04:45:46,946 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2483: havoc vatomic32_cmpxchg_rel_#t~ret123#1; [2025-02-06 04:45:46,946 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443: havoc vatomic32_read_acq_#t~ret117#1; [2025-02-06 04:45:46,946 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6019: havoc ~#xbo~0#1.base, ~#xbo~0#1.offset; [2025-02-06 04:45:46,946 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6019-1: SUMMARY for call ULTIMATE.dealloc(~#xbo~0#1.base, ~#xbo~0#1.offset); srcloc: null [2025-02-06 04:45:46,946 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc vatomic32_read_rlx_#t~ret116#1; [2025-02-06 04:45:46,947 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:45:46,947 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:45:47,307 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:45:47,307 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:45:47,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:45:47 BoogieIcfgContainer [2025-02-06 04:45:47,307 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:45:47,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:45:47,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:45:47,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:45:47,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:45:43" (1/3) ... [2025-02-06 04:45:47,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6c1607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:45:47, skipping insertion in model container [2025-02-06 04:45:47,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:45:45" (2/3) ... [2025-02-06 04:45:47,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6c1607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:45:47, skipping insertion in model container [2025-02-06 04:45:47,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:45:47" (3/3) ... [2025-02-06 04:45:47,316 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_mpmc_check_full.i [2025-02-06 04:45:47,329 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:45:47,331 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_mpmc_check_full.i that has 2 procedures, 137 locations, 1 initial locations, 23 loop locations, and 7 error locations. [2025-02-06 04:45:47,332 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:45:47,417 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 04:45:47,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 195 transitions, 397 flow [2025-02-06 04:45:47,543 INFO L124 PetriNetUnfolderBase]: 104/338 cut-off events. [2025-02-06 04:45:47,549 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:45:47,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 338 events. 104/338 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1100 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 169. Up to 6 conditions per place. [2025-02-06 04:45:47,556 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 195 transitions, 397 flow [2025-02-06 04:45:47,561 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 195 transitions, 397 flow [2025-02-06 04:45:47,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:45:47,574 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;@19b3cf0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:45:47,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 04:45:47,579 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:45:47,579 INFO L124 PetriNetUnfolderBase]: 3/10 cut-off events. [2025-02-06 04:45:47,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:45:47,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:47,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 04:45:47,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:45:47,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash 54974258, now seen corresponding path program 1 times [2025-02-06 04:45:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:47,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192249048] [2025-02-06 04:45:47,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:47,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:47,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 04:45:47,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 04:45:47,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:47,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:47,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:47,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192249048] [2025-02-06 04:45:47,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192249048] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:47,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:47,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:45:47,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105476806] [2025-02-06 04:45:47,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:47,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:45:47,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:47,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:45:47,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:45:47,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 195 [2025-02-06 04:45:47,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 195 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:47,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:47,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 195 [2025-02-06 04:45:47,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:48,390 INFO L124 PetriNetUnfolderBase]: 1169/2834 cut-off events. [2025-02-06 04:45:48,390 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:45:48,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4954 conditions, 2834 events. 1169/2834 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 16370 event pairs, 816 based on Foata normal form. 639/3007 useless extension candidates. Maximal degree in co-relation 4750. Up to 2106 conditions per place. [2025-02-06 04:45:48,404 INFO L140 encePairwiseOnDemand]: 148/195 looper letters, 89 selfloop transitions, 2 changer transitions 1/148 dead transitions. [2025-02-06 04:45:48,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 148 transitions, 487 flow [2025-02-06 04:45:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:45:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:45:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2025-02-06 04:45:48,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5264957264957265 [2025-02-06 04:45:48,414 INFO L175 Difference]: Start difference. First operand has 140 places, 195 transitions, 397 flow. Second operand 3 states and 308 transitions. [2025-02-06 04:45:48,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 148 transitions, 487 flow [2025-02-06 04:45:48,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 148 transitions, 487 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:45:48,421 INFO L231 Difference]: Finished difference. Result has 140 places, 147 transitions, 305 flow [2025-02-06 04:45:48,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=140, PETRI_TRANSITIONS=147} [2025-02-06 04:45:48,425 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, 0 predicate places. [2025-02-06 04:45:48,425 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 147 transitions, 305 flow [2025-02-06 04:45:48,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:48,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:48,426 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:48,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:45:48,426 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:45:48,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:48,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1361102373, now seen corresponding path program 1 times [2025-02-06 04:45:48,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:48,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362450527] [2025-02-06 04:45:48,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:48,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:48,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 04:45:48,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 04:45:48,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:48,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:48,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:48,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362450527] [2025-02-06 04:45:48,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362450527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:48,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:48,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:45:48,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975160524] [2025-02-06 04:45:48,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:48,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:45:48,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:48,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:45:48,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:45:48,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 195 [2025-02-06 04:45:48,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 147 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:48,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:48,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 195 [2025-02-06 04:45:48,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:48,869 INFO L124 PetriNetUnfolderBase]: 1149/2794 cut-off events. [2025-02-06 04:45:48,869 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:45:48,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4879 conditions, 2794 events. 1149/2794 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 16220 event pairs, 800 based on Foata normal form. 1/2334 useless extension candidates. Maximal degree in co-relation 4847. Up to 2068 conditions per place. [2025-02-06 04:45:48,879 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 89 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2025-02-06 04:45:48,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 145 transitions, 483 flow [2025-02-06 04:45:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:45:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:45:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-02-06 04:45:48,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4495726495726496 [2025-02-06 04:45:48,881 INFO L175 Difference]: Start difference. First operand has 140 places, 147 transitions, 305 flow. Second operand 3 states and 263 transitions. [2025-02-06 04:45:48,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 145 transitions, 483 flow [2025-02-06 04:45:48,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 145 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:45:48,884 INFO L231 Difference]: Finished difference. Result has 137 places, 145 transitions, 301 flow [2025-02-06 04:45:48,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=301, PETRI_PLACES=137, PETRI_TRANSITIONS=145} [2025-02-06 04:45:48,885 INFO L279 CegarLoopForPetriNet]: 140 programPoint places, -3 predicate places. [2025-02-06 04:45:48,885 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 145 transitions, 301 flow [2025-02-06 04:45:48,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:48,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:48,885 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:48,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:45:48,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:45:48,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:48,886 INFO L85 PathProgramCache]: Analyzing trace with hash 361209097, now seen corresponding path program 1 times [2025-02-06 04:45:48,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:48,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216031008] [2025-02-06 04:45:48,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:48,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:48,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:45:48,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:45:48,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:48,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:45:48,953 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:45:48,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 04:45:49,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 04:45:49,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:49,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:45:49,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:45:49,032 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:45:49,032 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-02-06 04:45:49,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-02-06 04:45:49,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-02-06 04:45:49,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-02-06 04:45:49,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-02-06 04:45:49,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-02-06 04:45:49,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-02-06 04:45:49,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-02-06 04:45:49,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:45:49,034 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 04:45:49,036 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:45:49,036 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 04:45:49,095 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:45:49,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 218 transitions, 452 flow [2025-02-06 04:45:49,155 INFO L124 PetriNetUnfolderBase]: 203/650 cut-off events. [2025-02-06 04:45:49,155 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 04:45:49,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 650 events. 203/650 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2845 event pairs, 0 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 340. Up to 12 conditions per place. [2025-02-06 04:45:49,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 218 transitions, 452 flow [2025-02-06 04:45:49,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 218 transitions, 452 flow [2025-02-06 04:45:49,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:45:49,162 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;@19b3cf0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:45:49,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 04:45:49,163 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:45:49,163 INFO L124 PetriNetUnfolderBase]: 3/10 cut-off events. [2025-02-06 04:45:49,163 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:45:49,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:49,163 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 04:45:49,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:45:49,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:49,164 INFO L85 PathProgramCache]: Analyzing trace with hash 61685170, now seen corresponding path program 1 times [2025-02-06 04:45:49,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:49,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731367644] [2025-02-06 04:45:49,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:49,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:49,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 04:45:49,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 04:45:49,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:49,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:49,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:49,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731367644] [2025-02-06 04:45:49,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731367644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:49,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:49,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:45:49,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178177368] [2025-02-06 04:45:49,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:49,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:45:49,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:49,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:45:49,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:45:49,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 218 [2025-02-06 04:45:49,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 218 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:49,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:49,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 218 [2025-02-06 04:45:49,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:54,230 INFO L124 PetriNetUnfolderBase]: 39743/67068 cut-off events. [2025-02-06 04:45:54,230 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-02-06 04:45:54,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123744 conditions, 67068 events. 39743/67068 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 510300 event pairs, 29648 based on Foata normal form. 11063/66254 useless extension candidates. Maximal degree in co-relation 94795. Up to 56575 conditions per place. [2025-02-06 04:45:54,570 INFO L140 encePairwiseOnDemand]: 170/218 looper letters, 111 selfloop transitions, 2 changer transitions 1/170 dead transitions. [2025-02-06 04:45:54,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 170 transitions, 584 flow [2025-02-06 04:45:54,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:45:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:45:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2025-02-06 04:45:54,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5061162079510704 [2025-02-06 04:45:54,572 INFO L175 Difference]: Start difference. First operand has 159 places, 218 transitions, 452 flow. Second operand 3 states and 331 transitions. [2025-02-06 04:45:54,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 170 transitions, 584 flow [2025-02-06 04:45:54,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 170 transitions, 584 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:45:54,576 INFO L231 Difference]: Finished difference. Result has 159 places, 169 transitions, 358 flow [2025-02-06 04:45:54,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=159, PETRI_TRANSITIONS=169} [2025-02-06 04:45:54,576 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 0 predicate places. [2025-02-06 04:45:54,576 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 169 transitions, 358 flow [2025-02-06 04:45:54,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:54,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:54,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:54,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:45:54,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:45:54,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:54,578 INFO L85 PathProgramCache]: Analyzing trace with hash -577364673, now seen corresponding path program 1 times [2025-02-06 04:45:54,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:54,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610416593] [2025-02-06 04:45:54,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:54,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:54,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 04:45:54,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 04:45:54,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:54,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:54,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:54,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610416593] [2025-02-06 04:45:54,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610416593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:54,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:54,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:45:54,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170355519] [2025-02-06 04:45:54,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:54,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:45:54,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:54,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:45:54,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:45:54,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 218 [2025-02-06 04:45:54,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 169 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:54,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:54,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 218 [2025-02-06 04:45:54,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:45:58,577 INFO L124 PetriNetUnfolderBase]: 39023/66022 cut-off events. [2025-02-06 04:45:58,577 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-02-06 04:45:58,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121657 conditions, 66022 events. 39023/66022 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 504351 event pairs, 29072 based on Foata normal form. 1/54291 useless extension candidates. Maximal degree in co-relation 121624. Up to 55531 conditions per place. [2025-02-06 04:45:58,981 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 111 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-02-06 04:45:58,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 167 transitions, 580 flow [2025-02-06 04:45:58,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:45:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:45:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2025-02-06 04:45:58,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43577981651376146 [2025-02-06 04:45:58,983 INFO L175 Difference]: Start difference. First operand has 159 places, 169 transitions, 358 flow. Second operand 3 states and 285 transitions. [2025-02-06 04:45:58,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 167 transitions, 580 flow [2025-02-06 04:45:58,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 167 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:45:58,986 INFO L231 Difference]: Finished difference. Result has 156 places, 167 transitions, 354 flow [2025-02-06 04:45:58,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=156, PETRI_TRANSITIONS=167} [2025-02-06 04:45:58,989 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -3 predicate places. [2025-02-06 04:45:58,989 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 167 transitions, 354 flow [2025-02-06 04:45:58,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:58,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:45:58,989 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:45:58,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:45:58,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:45:58,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:45:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash -7592781, now seen corresponding path program 1 times [2025-02-06 04:45:58,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:45:58,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988866455] [2025-02-06 04:45:58,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:45:58,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:45:59,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 04:45:59,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 04:45:59,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:45:59,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:45:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:45:59,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:45:59,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988866455] [2025-02-06 04:45:59,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988866455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:45:59,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:45:59,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:45:59,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792784652] [2025-02-06 04:45:59,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:45:59,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:45:59,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:45:59,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:45:59,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:45:59,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 218 [2025-02-06 04:45:59,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 167 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:45:59,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:45:59,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 218 [2025-02-06 04:45:59,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:04,371 INFO L124 PetriNetUnfolderBase]: 38325/69786 cut-off events. [2025-02-06 04:46:04,372 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-02-06 04:46:04,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124434 conditions, 69786 events. 38325/69786 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 1037. Compared 597412 event pairs, 1 based on Foata normal form. 0/58046 useless extension candidates. Maximal degree in co-relation 124401. Up to 52790 conditions per place. [2025-02-06 04:46:04,652 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 211 selfloop transitions, 4 changer transitions 0/268 dead transitions. [2025-02-06 04:46:04,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 268 transitions, 984 flow [2025-02-06 04:46:04,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:46:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:46:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2025-02-06 04:46:04,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46605504587155966 [2025-02-06 04:46:04,654 INFO L175 Difference]: Start difference. First operand has 156 places, 167 transitions, 354 flow. Second operand 5 states and 508 transitions. [2025-02-06 04:46:04,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 268 transitions, 984 flow [2025-02-06 04:46:04,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 268 transitions, 976 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 04:46:04,660 INFO L231 Difference]: Finished difference. Result has 156 places, 167 transitions, 356 flow [2025-02-06 04:46:04,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=156, PETRI_TRANSITIONS=167} [2025-02-06 04:46:04,661 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -3 predicate places. [2025-02-06 04:46:04,661 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 167 transitions, 356 flow [2025-02-06 04:46:04,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:04,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:04,661 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-06 04:46:04,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:46:04,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:46:04,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1172128742, now seen corresponding path program 1 times [2025-02-06 04:46:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:04,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94268646] [2025-02-06 04:46:04,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:04,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:04,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 04:46:04,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 04:46:04,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:04,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:04,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:04,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94268646] [2025-02-06 04:46:04,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94268646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:04,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:46:04,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:46:04,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731886125] [2025-02-06 04:46:04,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:04,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:46:04,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:04,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:46:04,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:46:04,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 218 [2025-02-06 04:46:04,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 167 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:04,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:04,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 218 [2025-02-06 04:46:04,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:05,340 INFO L124 PetriNetUnfolderBase]: 4733/9317 cut-off events. [2025-02-06 04:46:05,340 INFO L125 PetriNetUnfolderBase]: For 1209/1209 co-relation queries the response was YES. [2025-02-06 04:46:05,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17945 conditions, 9317 events. 4733/9317 cut-off events. For 1209/1209 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 60244 event pairs, 2384 based on Foata normal form. 0/7879 useless extension candidates. Maximal degree in co-relation 10614. Up to 5655 conditions per place. [2025-02-06 04:46:05,363 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 156 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2025-02-06 04:46:05,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 211 transitions, 764 flow [2025-02-06 04:46:05,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:46:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:46:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-02-06 04:46:05,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5076452599388379 [2025-02-06 04:46:05,365 INFO L175 Difference]: Start difference. First operand has 156 places, 167 transitions, 356 flow. Second operand 3 states and 332 transitions. [2025-02-06 04:46:05,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 211 transitions, 764 flow [2025-02-06 04:46:05,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 211 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:46:05,368 INFO L231 Difference]: Finished difference. Result has 158 places, 168 transitions, 366 flow [2025-02-06 04:46:05,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=158, PETRI_TRANSITIONS=168} [2025-02-06 04:46:05,369 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -1 predicate places. [2025-02-06 04:46:05,369 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 168 transitions, 366 flow [2025-02-06 04:46:05,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:05,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:05,369 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:05,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:46:05,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:46:05,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:05,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1219061360, now seen corresponding path program 1 times [2025-02-06 04:46:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:05,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761824490] [2025-02-06 04:46:05,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:05,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:05,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 04:46:05,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 04:46:05,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:05,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:05,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:05,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761824490] [2025-02-06 04:46:05,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761824490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:05,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:46:05,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:46:05,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913484786] [2025-02-06 04:46:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:05,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:46:05,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:05,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:46:05,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:46:05,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 218 [2025-02-06 04:46:05,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 168 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:05,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:05,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 218 [2025-02-06 04:46:05,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:06,688 INFO L124 PetriNetUnfolderBase]: 7958/14327 cut-off events. [2025-02-06 04:46:06,688 INFO L125 PetriNetUnfolderBase]: For 5091/5091 co-relation queries the response was YES. [2025-02-06 04:46:06,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28955 conditions, 14327 events. 7958/14327 cut-off events. For 5091/5091 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 90260 event pairs, 3813 based on Foata normal form. 0/12188 useless extension candidates. Maximal degree in co-relation 13863. Up to 7667 conditions per place. [2025-02-06 04:46:06,729 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 213 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-02-06 04:46:06,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 268 transitions, 1017 flow [2025-02-06 04:46:06,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:46:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:46:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2025-02-06 04:46:06,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.591743119266055 [2025-02-06 04:46:06,731 INFO L175 Difference]: Start difference. First operand has 158 places, 168 transitions, 366 flow. Second operand 3 states and 387 transitions. [2025-02-06 04:46:06,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 268 transitions, 1017 flow [2025-02-06 04:46:06,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 268 transitions, 1013 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:46:06,735 INFO L231 Difference]: Finished difference. Result has 160 places, 169 transitions, 376 flow [2025-02-06 04:46:06,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=160, PETRI_TRANSITIONS=169} [2025-02-06 04:46:06,736 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 1 predicate places. [2025-02-06 04:46:06,736 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 169 transitions, 376 flow [2025-02-06 04:46:06,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:06,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:06,737 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:06,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:46:06,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:46:06,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:06,737 INFO L85 PathProgramCache]: Analyzing trace with hash -126539821, now seen corresponding path program 1 times [2025-02-06 04:46:06,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:06,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192841191] [2025-02-06 04:46:06,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:06,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:06,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 04:46:06,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 04:46:06,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:06,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:06,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:06,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192841191] [2025-02-06 04:46:06,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192841191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:06,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:46:06,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:46:06,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60916165] [2025-02-06 04:46:06,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:06,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:46:06,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:06,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:46:06,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:46:06,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 218 [2025-02-06 04:46:06,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 169 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:06,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:06,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 218 [2025-02-06 04:46:06,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:08,844 INFO L124 PetriNetUnfolderBase]: 13064/22808 cut-off events. [2025-02-06 04:46:08,844 INFO L125 PetriNetUnfolderBase]: For 7406/7406 co-relation queries the response was YES. [2025-02-06 04:46:08,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47534 conditions, 22808 events. 13064/22808 cut-off events. For 7406/7406 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 147818 event pairs, 6010 based on Foata normal form. 0/19699 useless extension candidates. Maximal degree in co-relation 36102. Up to 12692 conditions per place. [2025-02-06 04:46:08,915 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 212 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2025-02-06 04:46:08,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 267 transitions, 1024 flow [2025-02-06 04:46:08,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:46:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:46:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2025-02-06 04:46:08,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5886850152905199 [2025-02-06 04:46:08,917 INFO L175 Difference]: Start difference. First operand has 160 places, 169 transitions, 376 flow. Second operand 3 states and 385 transitions. [2025-02-06 04:46:08,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 267 transitions, 1024 flow [2025-02-06 04:46:08,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 267 transitions, 1020 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:46:08,926 INFO L231 Difference]: Finished difference. Result has 162 places, 170 transitions, 386 flow [2025-02-06 04:46:08,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=162, PETRI_TRANSITIONS=170} [2025-02-06 04:46:08,927 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 3 predicate places. [2025-02-06 04:46:08,927 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 170 transitions, 386 flow [2025-02-06 04:46:08,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:08,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:08,927 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:08,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:46:08,934 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:46:08,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:08,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1665221384, now seen corresponding path program 1 times [2025-02-06 04:46:08,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:08,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837066791] [2025-02-06 04:46:08,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:08,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:08,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 04:46:08,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 04:46:08,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:08,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:09,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:09,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837066791] [2025-02-06 04:46:09,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837066791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:09,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:46:09,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:46:09,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585811726] [2025-02-06 04:46:09,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:09,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:46:09,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:09,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:46:09,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:46:09,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 218 [2025-02-06 04:46:09,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 170 transitions, 386 flow. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:09,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:09,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 218 [2025-02-06 04:46:09,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:11,728 INFO L124 PetriNetUnfolderBase]: 14912/26441 cut-off events. [2025-02-06 04:46:11,728 INFO L125 PetriNetUnfolderBase]: For 8875/8875 co-relation queries the response was YES. [2025-02-06 04:46:11,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55533 conditions, 26441 events. 14912/26441 cut-off events. For 8875/8875 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 178938 event pairs, 10045 based on Foata normal form. 0/23252 useless extension candidates. Maximal degree in co-relation 43017. Up to 20453 conditions per place. [2025-02-06 04:46:11,819 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 282 selfloop transitions, 4 changer transitions 0/339 dead transitions. [2025-02-06 04:46:11,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 339 transitions, 1354 flow [2025-02-06 04:46:11,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:46:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:46:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2025-02-06 04:46:11,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5860091743119266 [2025-02-06 04:46:11,820 INFO L175 Difference]: Start difference. First operand has 162 places, 170 transitions, 386 flow. Second operand 4 states and 511 transitions. [2025-02-06 04:46:11,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 339 transitions, 1354 flow [2025-02-06 04:46:11,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 339 transitions, 1348 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:46:11,829 INFO L231 Difference]: Finished difference. Result has 166 places, 173 transitions, 412 flow [2025-02-06 04:46:11,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=412, PETRI_PLACES=166, PETRI_TRANSITIONS=173} [2025-02-06 04:46:11,830 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 7 predicate places. [2025-02-06 04:46:11,830 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 173 transitions, 412 flow [2025-02-06 04:46:11,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:11,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:11,831 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:11,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:46:11,831 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:46:11,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2043629589, now seen corresponding path program 1 times [2025-02-06 04:46:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:11,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249740492] [2025-02-06 04:46:11,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:11,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 04:46:11,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 04:46:11,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:11,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:11,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:11,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249740492] [2025-02-06 04:46:11,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249740492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:11,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:46:11,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:46:11,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358362300] [2025-02-06 04:46:11,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:11,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:46:11,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:11,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:46:11,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:46:11,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 218 [2025-02-06 04:46:11,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 173 transitions, 412 flow. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:11,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:11,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 218 [2025-02-06 04:46:11,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:14,146 INFO L124 PetriNetUnfolderBase]: 16994/30011 cut-off events. [2025-02-06 04:46:14,146 INFO L125 PetriNetUnfolderBase]: For 14161/14161 co-relation queries the response was YES. [2025-02-06 04:46:14,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67478 conditions, 30011 events. 16994/30011 cut-off events. For 14161/14161 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 203993 event pairs, 11677 based on Foata normal form. 0/27008 useless extension candidates. Maximal degree in co-relation 56050. Up to 23381 conditions per place. [2025-02-06 04:46:14,275 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 285 selfloop transitions, 4 changer transitions 0/342 dead transitions. [2025-02-06 04:46:14,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 342 transitions, 1416 flow [2025-02-06 04:46:14,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:46:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:46:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2025-02-06 04:46:14,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5814220183486238 [2025-02-06 04:46:14,277 INFO L175 Difference]: Start difference. First operand has 166 places, 173 transitions, 412 flow. Second operand 4 states and 507 transitions. [2025-02-06 04:46:14,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 342 transitions, 1416 flow [2025-02-06 04:46:14,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 342 transitions, 1410 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:46:14,297 INFO L231 Difference]: Finished difference. Result has 170 places, 176 transitions, 438 flow [2025-02-06 04:46:14,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=438, PETRI_PLACES=170, PETRI_TRANSITIONS=176} [2025-02-06 04:46:14,298 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 11 predicate places. [2025-02-06 04:46:14,298 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 176 transitions, 438 flow [2025-02-06 04:46:14,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:14,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:14,298 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:14,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:46:14,298 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:46:14,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash -775744256, now seen corresponding path program 1 times [2025-02-06 04:46:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:14,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376322245] [2025-02-06 04:46:14,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:14,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:14,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 04:46:14,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 04:46:14,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:14,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:14,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:14,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376322245] [2025-02-06 04:46:14,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376322245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:14,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:46:14,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:46:14,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705267682] [2025-02-06 04:46:14,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:14,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:46:14,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:14,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:46:14,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:46:14,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 218 [2025-02-06 04:46:14,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 176 transitions, 438 flow. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:14,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:14,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 218 [2025-02-06 04:46:14,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:46:16,959 INFO L124 PetriNetUnfolderBase]: 19094/33617 cut-off events. [2025-02-06 04:46:16,959 INFO L125 PetriNetUnfolderBase]: For 17978/17978 co-relation queries the response was YES. [2025-02-06 04:46:17,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80992 conditions, 33617 events. 19094/33617 cut-off events. For 17978/17978 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 232754 event pairs, 13543 based on Foata normal form. 0/30842 useless extension candidates. Maximal degree in co-relation 67750. Up to 26669 conditions per place. [2025-02-06 04:46:17,118 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 294 selfloop transitions, 4 changer transitions 0/351 dead transitions. [2025-02-06 04:46:17,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 351 transitions, 1488 flow [2025-02-06 04:46:17,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:46:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:46:17,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2025-02-06 04:46:17,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5860091743119266 [2025-02-06 04:46:17,120 INFO L175 Difference]: Start difference. First operand has 170 places, 176 transitions, 438 flow. Second operand 4 states and 511 transitions. [2025-02-06 04:46:17,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 351 transitions, 1488 flow [2025-02-06 04:46:17,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 351 transitions, 1482 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 04:46:17,205 INFO L231 Difference]: Finished difference. Result has 174 places, 179 transitions, 470 flow [2025-02-06 04:46:17,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=470, PETRI_PLACES=174, PETRI_TRANSITIONS=179} [2025-02-06 04:46:17,207 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 15 predicate places. [2025-02-06 04:46:17,207 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 179 transitions, 470 flow [2025-02-06 04:46:17,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:17,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:46:17,208 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:46:17,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:46:17,208 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-02-06 04:46:17,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:46:17,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1804058132, now seen corresponding path program 1 times [2025-02-06 04:46:17,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:46:17,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077419192] [2025-02-06 04:46:17,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:46:17,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:46:17,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 04:46:17,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 04:46:17,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:46:17,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:46:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:46:17,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:46:17,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077419192] [2025-02-06 04:46:17,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077419192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:46:17,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:46:17,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:46:17,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633218288] [2025-02-06 04:46:17,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:46:17,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:46:17,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:46:17,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:46:17,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:46:17,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 218 [2025-02-06 04:46:17,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 179 transitions, 470 flow. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:46:17,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:46:17,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 218 [2025-02-06 04:46:17,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand