./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/libvsync/hclhlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/libvsync/hclhlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:34:59,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:34:59,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:34:59,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:34:59,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:34:59,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:34:59,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:34:59,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:34:59,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:34:59,867 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:34:59,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:34:59,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:34:59,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:34:59,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:34:59,868 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:34:59,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:34:59,868 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:34:59,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:34:59,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:34:59,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:34:59,869 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:34:59,869 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:34:59,869 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:34:59,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:34:59,869 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:34:59,869 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:34:59,869 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:34:59,869 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:34:59,869 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:34:59,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:34:59,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:34:59,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:34:59,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:34:59,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:34:59,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:34:59,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:34:59,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:34:59,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:34:59,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:34:59,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:34:59,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:34:59,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:34:59,871 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 [2025-03-17 14:35:00,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:35:00,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:35:00,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:35:00,178 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:35:00,178 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:35:00,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/hclhlock.i [2025-03-17 14:35:01,232 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86c51cf2/aad5802cdb6e4653bbb553e1ba857830/FLAGa82d3f602 [2025-03-17 14:35:01,602 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:35:01,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i [2025-03-17 14:35:01,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86c51cf2/aad5802cdb6e4653bbb553e1ba857830/FLAGa82d3f602 [2025-03-17 14:35:01,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86c51cf2/aad5802cdb6e4653bbb553e1ba857830 [2025-03-17 14:35:01,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:35:01,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:35:01,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:35:01,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:35:01,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:35:01,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:35:01" (1/1) ... [2025-03-17 14:35:01,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161d3f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:01, skipping insertion in model container [2025-03-17 14:35:01,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:35:01" (1/1) ... [2025-03-17 14:35:01,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:35:03,065 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:35:03,070 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:35:03,070 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:35:03,078 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:35:03,079 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:35:03,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:35:03,386 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:35:03,456 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-17 14:35:03,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-17 14:35:03,458 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-17 14:35:03,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-17 14:35:03,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-17 14:35:03,459 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-17 14:35:03,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-17 14:35:03,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-17 14:35:03,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-17 14:35:03,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-17 14:35:03,460 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-17 14:35:03,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-17 14:35:03,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-17 14:35:03,461 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-17 14:35:03,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-17 14:35:03,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-17 14:35:03,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-17 14:35:03,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-17 14:35:03,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-17 14:35:03,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-17 14:35:03,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-17 14:35:03,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-17 14:35:03,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-17 14:35:03,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-17 14:35:03,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-17 14:35:03,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-17 14:35:03,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-17 14:35:03,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-17 14:35:03,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-17 14:35:03,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-17 14:35:03,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-17 14:35:03,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-17 14:35:03,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-17 14:35:03,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-17 14:35:03,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-17 14:35:03,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-17 14:35:03,465 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-17 14:35:03,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-17 14:35:03,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-17 14:35:03,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-17 14:35:03,467 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-17 14:35:03,468 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-17 14:35:03,468 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-17 14:35:03,471 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-17 14:35:03,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-17 14:35:03,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-17 14:35:03,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-17 14:35:03,473 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-17 14:35:03,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-17 14:35:03,474 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-17 14:35:03,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-17 14:35:03,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-17 14:35:03,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-17 14:35:03,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-17 14:35:03,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-17 14:35:03,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-17 14:35:03,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-17 14:35:03,477 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-17 14:35:03,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-17 14:35:03,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-17 14:35:03,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-17 14:35:03,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-17 14:35:03,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-17 14:35:03,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-17 14:35:03,481 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-17 14:35:03,482 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-17 14:35:03,482 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-17 14:35:03,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-17 14:35:03,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-17 14:35:03,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-17 14:35:03,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-17 14:35:03,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-17 14:35:03,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-17 14:35:03,485 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-17 14:35:03,485 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-17 14:35:03,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-17 14:35:03,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-17 14:35:03,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-17 14:35:03,486 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-17 14:35:03,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-17 14:35:03,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-17 14:35:03,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-17 14:35:03,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-17 14:35:03,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-17 14:35:03,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-17 14:35:03,487 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-17 14:35:03,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-17 14:35:03,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-17 14:35:03,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-17 14:35:03,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-17 14:35:03,488 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-17 14:35:03,489 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-17 14:35:03,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-17 14:35:03,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-17 14:35:03,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-17 14:35:03,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-17 14:35:03,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-17 14:35:03,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-17 14:35:03,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-17 14:35:03,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-17 14:35:03,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:35:03,711 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:35:03,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:03 WrapperNode [2025-03-17 14:35:03,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:35:03,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:35:03,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:35:03,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:35:03,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:03" (1/1) ... [2025-03-17 14:35:03,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:03" (1/1) ... [2025-03-17 14:35:03,810 INFO L138 Inliner]: procedures = 921, calls = 972, calls flagged for inlining = 848, calls inlined = 84, statements flattened = 850 [2025-03-17 14:35:03,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:35:03,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:35:03,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:35:03,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:35:03,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:03" (1/1) ... [2025-03-17 14:35:03,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:03" (1/1) ... [2025-03-17 14:35:03,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:03" (1/1) ... [2025-03-17 14:35:03,861 INFO L175 MemorySlicer]: Split 50 memory accesses to 4 slices as follows [2, 28, 2, 18]. 56 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 7, 0, 6]. The 15 writes are split as follows [0, 9, 1, 5]. [2025-03-17 14:35:03,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:03" (1/1) ... [2025-03-17 14:35:03,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:03" (1/1) ... [2025-03-17 14:35:03,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:03" (1/1) ... [2025-03-17 14:35:03,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:03" (1/1) ... [2025-03-17 14:35:03,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:03" (1/1) ... [2025-03-17 14:35:03,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:03" (1/1) ... [2025-03-17 14:35:03,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:35:03,900 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:35:03,900 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:35:03,900 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:35:03,901 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:03" (1/1) ... [2025-03-17 14:35:03,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:35:03,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:35:03,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:35:03,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:35:03,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-17 14:35:03,943 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:35:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 14:35:03,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 14:35:03,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 14:35:03,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 14:35:03,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:35:03,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:35:03,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:35:03,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 14:35:03,945 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:35:04,084 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:35:04,086 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:35:04,796 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-17 14:35:04,796 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-10: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-17 14:35:04,796 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-20: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-17 14:35:04,797 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-30: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-17 14:35:04,797 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-17 14:35:04,797 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-10: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-17 14:35:04,797 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-17 14:35:04,797 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290-10: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-17 14:35:04,797 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-03-17 14:35:04,797 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-03-17 14:35:04,980 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-17 14:35:04,981 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-17 14:35:04,981 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:35:04,982 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:35:05,382 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:35:05,383 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:35:05,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:35:05 BoogieIcfgContainer [2025-03-17 14:35:05,383 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:35:05,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:35:05,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:35:05,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:35:05,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:35:01" (1/3) ... [2025-03-17 14:35:05,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47589ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:35:05, skipping insertion in model container [2025-03-17 14:35:05,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:35:03" (2/3) ... [2025-03-17 14:35:05,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47589ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:35:05, skipping insertion in model container [2025-03-17 14:35:05,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:35:05" (3/3) ... [2025-03-17 14:35:05,393 INFO L128 eAbstractionObserver]: Analyzing ICFG hclhlock.i [2025-03-17 14:35:05,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:35:05,407 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hclhlock.i that has 2 procedures, 338 locations, 1 initial locations, 42 loop locations, and 88 error locations. [2025-03-17 14:35:05,407 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:35:05,580 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 14:35:05,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 341 places, 495 transitions, 997 flow [2025-03-17 14:35:05,713 INFO L124 PetriNetUnfolderBase]: 170/537 cut-off events. [2025-03-17 14:35:05,714 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:35:05,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 537 events. 170/537 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2056 event pairs, 0 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 402. Up to 8 conditions per place. [2025-03-17 14:35:05,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 341 places, 495 transitions, 997 flow [2025-03-17 14:35:05,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 341 places, 495 transitions, 997 flow [2025-03-17 14:35:05,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:35:05,748 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=None, 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;@13265dab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:35:05,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 154 error locations. [2025-03-17 14:35:05,754 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:35:05,754 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-03-17 14:35:05,754 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:35:05,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:05,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 14:35:05,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:05,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash 80681, now seen corresponding path program 1 times [2025-03-17 14:35:05,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:05,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932887703] [2025-03-17 14:35:05,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:05,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:05,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:35:05,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:35:05,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:05,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:35:06,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:06,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932887703] [2025-03-17 14:35:06,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932887703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:06,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:06,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:35:06,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137826892] [2025-03-17 14:35:06,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:06,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:35:06,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:06,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:35:06,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:35:06,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:06,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 495 transitions, 997 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:06,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:06,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:06,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:06,798 INFO L124 PetriNetUnfolderBase]: 1543/4159 cut-off events. [2025-03-17 14:35:06,798 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:35:06,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7068 conditions, 4159 events. 1543/4159 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31349 event pairs, 1240 based on Foata normal form. 1590/4957 useless extension candidates. Maximal degree in co-relation 6922. Up to 2900 conditions per place. [2025-03-17 14:35:06,851 INFO L140 encePairwiseOnDemand]: 360/495 looper letters, 190 selfloop transitions, 4 changer transitions 0/347 dead transitions. [2025-03-17 14:35:06,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 347 transitions, 1089 flow [2025-03-17 14:35:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:35:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:35:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-03-17 14:35:06,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5279461279461279 [2025-03-17 14:35:06,869 INFO L175 Difference]: Start difference. First operand has 341 places, 495 transitions, 997 flow. Second operand 3 states and 784 transitions. [2025-03-17 14:35:06,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 347 transitions, 1089 flow [2025-03-17 14:35:06,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 347 transitions, 1089 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:35:06,883 INFO L231 Difference]: Finished difference. Result has 319 places, 347 transitions, 709 flow [2025-03-17 14:35:06,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=709, PETRI_PLACES=319, PETRI_TRANSITIONS=347} [2025-03-17 14:35:06,887 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -22 predicate places. [2025-03-17 14:35:06,887 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 347 transitions, 709 flow [2025-03-17 14:35:06,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:06,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:06,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 14:35:06,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:35:06,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:06,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:06,889 INFO L85 PathProgramCache]: Analyzing trace with hash 80682, now seen corresponding path program 1 times [2025-03-17 14:35:06,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:06,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535490713] [2025-03-17 14:35:06,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:06,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:06,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:35:06,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:35:06,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:06,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:35:07,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:07,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535490713] [2025-03-17 14:35:07,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535490713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:07,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:07,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:35:07,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839821678] [2025-03-17 14:35:07,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:07,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:35:07,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:07,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:35:07,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:35:07,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:07,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 347 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:07,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:07,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:07,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:07,693 INFO L124 PetriNetUnfolderBase]: 1543/4158 cut-off events. [2025-03-17 14:35:07,693 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:35:07,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7071 conditions, 4158 events. 1543/4158 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31336 event pairs, 1240 based on Foata normal form. 0/3368 useless extension candidates. Maximal degree in co-relation 7046. Up to 2901 conditions per place. [2025-03-17 14:35:07,708 INFO L140 encePairwiseOnDemand]: 492/495 looper letters, 191 selfloop transitions, 2 changer transitions 0/346 dead transitions. [2025-03-17 14:35:07,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 346 transitions, 1093 flow [2025-03-17 14:35:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:35:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:35:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 653 transitions. [2025-03-17 14:35:07,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43973063973063975 [2025-03-17 14:35:07,710 INFO L175 Difference]: Start difference. First operand has 319 places, 347 transitions, 709 flow. Second operand 3 states and 653 transitions. [2025-03-17 14:35:07,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 346 transitions, 1093 flow [2025-03-17 14:35:07,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 346 transitions, 1085 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:35:07,715 INFO L231 Difference]: Finished difference. Result has 318 places, 346 transitions, 703 flow [2025-03-17 14:35:07,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=703, PETRI_PLACES=318, PETRI_TRANSITIONS=346} [2025-03-17 14:35:07,716 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -23 predicate places. [2025-03-17 14:35:07,716 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 346 transitions, 703 flow [2025-03-17 14:35:07,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:07,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:07,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:35:07,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:35:07,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:07,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:07,718 INFO L85 PathProgramCache]: Analyzing trace with hash 77606220, now seen corresponding path program 1 times [2025-03-17 14:35:07,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:07,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553707875] [2025-03-17 14:35:07,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:07,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:07,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:35:07,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:35:07,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:07,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:35:07,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:07,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553707875] [2025-03-17 14:35:07,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553707875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:07,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:07,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:35:07,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511608102] [2025-03-17 14:35:07,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:07,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:35:07,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:07,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:35:07,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:35:07,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:07,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 346 transitions, 703 flow. Second operand has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:07,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:07,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:07,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:08,545 INFO L124 PetriNetUnfolderBase]: 1543/4156 cut-off events. [2025-03-17 14:35:08,546 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:35:08,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7065 conditions, 4156 events. 1543/4156 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31335 event pairs, 1240 based on Foata normal form. 0/3367 useless extension candidates. Maximal degree in co-relation 7053. Up to 2891 conditions per place. [2025-03-17 14:35:08,562 INFO L140 encePairwiseOnDemand]: 487/495 looper letters, 185 selfloop transitions, 6 changer transitions 0/344 dead transitions. [2025-03-17 14:35:08,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 344 transitions, 1081 flow [2025-03-17 14:35:08,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:35:08,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:35:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 958 transitions. [2025-03-17 14:35:08,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38707070707070707 [2025-03-17 14:35:08,568 INFO L175 Difference]: Start difference. First operand has 318 places, 346 transitions, 703 flow. Second operand 5 states and 958 transitions. [2025-03-17 14:35:08,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 344 transitions, 1081 flow [2025-03-17 14:35:08,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 344 transitions, 1077 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:35:08,573 INFO L231 Difference]: Finished difference. Result has 318 places, 344 transitions, 707 flow [2025-03-17 14:35:08,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=707, PETRI_PLACES=318, PETRI_TRANSITIONS=344} [2025-03-17 14:35:08,574 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -23 predicate places. [2025-03-17 14:35:08,574 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 344 transitions, 707 flow [2025-03-17 14:35:08,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:08,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:08,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:35:08,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:35:08,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:08,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:08,576 INFO L85 PathProgramCache]: Analyzing trace with hash 77606221, now seen corresponding path program 1 times [2025-03-17 14:35:08,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:08,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226375485] [2025-03-17 14:35:08,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:08,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:08,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:35:08,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:35:08,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:08,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:35:08,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:08,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226375485] [2025-03-17 14:35:08,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226375485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:08,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:08,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:35:08,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906345330] [2025-03-17 14:35:08,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:08,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:35:08,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:08,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:35:08,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:35:08,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:08,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 344 transitions, 707 flow. Second operand has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:08,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:08,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:08,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:09,518 INFO L124 PetriNetUnfolderBase]: 1543/4155 cut-off events. [2025-03-17 14:35:09,519 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:35:09,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7067 conditions, 4155 events. 1543/4155 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31304 event pairs, 1240 based on Foata normal form. 0/3367 useless extension candidates. Maximal degree in co-relation 7037. Up to 2891 conditions per place. [2025-03-17 14:35:09,539 INFO L140 encePairwiseOnDemand]: 490/495 looper letters, 186 selfloop transitions, 4 changer transitions 0/343 dead transitions. [2025-03-17 14:35:09,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 343 transitions, 1085 flow [2025-03-17 14:35:09,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:35:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:35:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 956 transitions. [2025-03-17 14:35:09,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38626262626262625 [2025-03-17 14:35:09,542 INFO L175 Difference]: Start difference. First operand has 318 places, 344 transitions, 707 flow. Second operand 5 states and 956 transitions. [2025-03-17 14:35:09,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 343 transitions, 1085 flow [2025-03-17 14:35:09,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 343 transitions, 1073 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:35:09,547 INFO L231 Difference]: Finished difference. Result has 317 places, 343 transitions, 701 flow [2025-03-17 14:35:09,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=701, PETRI_PLACES=317, PETRI_TRANSITIONS=343} [2025-03-17 14:35:09,549 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -24 predicate places. [2025-03-17 14:35:09,549 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 343 transitions, 701 flow [2025-03-17 14:35:09,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:09,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:09,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:09,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:35:09,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:09,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:09,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1276705522, now seen corresponding path program 1 times [2025-03-17 14:35:09,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:09,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765372510] [2025-03-17 14:35:09,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:09,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:09,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:35:09,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:35:09,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:09,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:35:09,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:09,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765372510] [2025-03-17 14:35:09,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765372510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:09,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:09,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:35:09,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451074643] [2025-03-17 14:35:09,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:09,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:35:09,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:09,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:35:09,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:35:09,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:09,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 343 transitions, 701 flow. Second operand has 6 states, 6 states have (on average 154.16666666666666) internal successors, (925), 6 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:09,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:09,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:09,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:10,625 INFO L124 PetriNetUnfolderBase]: 1543/4154 cut-off events. [2025-03-17 14:35:10,625 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:35:10,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7063 conditions, 4154 events. 1543/4154 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31312 event pairs, 1240 based on Foata normal form. 0/3368 useless extension candidates. Maximal degree in co-relation 7037. Up to 2891 conditions per place. [2025-03-17 14:35:10,636 INFO L140 encePairwiseOnDemand]: 488/495 looper letters, 183 selfloop transitions, 6 changer transitions 0/342 dead transitions. [2025-03-17 14:35:10,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 342 transitions, 1077 flow [2025-03-17 14:35:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:35:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:35:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1108 transitions. [2025-03-17 14:35:10,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37306397306397304 [2025-03-17 14:35:10,639 INFO L175 Difference]: Start difference. First operand has 317 places, 343 transitions, 701 flow. Second operand 6 states and 1108 transitions. [2025-03-17 14:35:10,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 342 transitions, 1077 flow [2025-03-17 14:35:10,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 342 transitions, 1069 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:35:10,643 INFO L231 Difference]: Finished difference. Result has 317 places, 342 transitions, 703 flow [2025-03-17 14:35:10,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=703, PETRI_PLACES=317, PETRI_TRANSITIONS=342} [2025-03-17 14:35:10,644 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -24 predicate places. [2025-03-17 14:35:10,644 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 342 transitions, 703 flow [2025-03-17 14:35:10,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.16666666666666) internal successors, (925), 6 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:10,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:10,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:10,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:35:10,645 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:10,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:10,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1892171607, now seen corresponding path program 1 times [2025-03-17 14:35:10,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:10,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539099774] [2025-03-17 14:35:10,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:10,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:10,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:35:10,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:35:10,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:10,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:35:10,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:10,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539099774] [2025-03-17 14:35:10,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539099774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:10,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:10,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:35:10,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088443282] [2025-03-17 14:35:10,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:10,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:35:10,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:10,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:35:10,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:35:10,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:10,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 342 transitions, 703 flow. Second operand has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:10,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:10,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:10,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:11,136 INFO L124 PetriNetUnfolderBase]: 1543/4151 cut-off events. [2025-03-17 14:35:11,136 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:35:11,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7061 conditions, 4151 events. 1543/4151 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31235 event pairs, 1240 based on Foata normal form. 1/3365 useless extension candidates. Maximal degree in co-relation 7033. Up to 2881 conditions per place. [2025-03-17 14:35:11,146 INFO L140 encePairwiseOnDemand]: 491/495 looper letters, 185 selfloop transitions, 3 changer transitions 0/339 dead transitions. [2025-03-17 14:35:11,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 339 transitions, 1073 flow [2025-03-17 14:35:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:35:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:35:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 801 transitions. [2025-03-17 14:35:11,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40454545454545454 [2025-03-17 14:35:11,151 INFO L175 Difference]: Start difference. First operand has 317 places, 342 transitions, 703 flow. Second operand 4 states and 801 transitions. [2025-03-17 14:35:11,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 339 transitions, 1073 flow [2025-03-17 14:35:11,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 339 transitions, 1061 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 14:35:11,155 INFO L231 Difference]: Finished difference. Result has 312 places, 339 transitions, 691 flow [2025-03-17 14:35:11,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=691, PETRI_PLACES=312, PETRI_TRANSITIONS=339} [2025-03-17 14:35:11,156 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -29 predicate places. [2025-03-17 14:35:11,156 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 339 transitions, 691 flow [2025-03-17 14:35:11,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:11,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:11,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:11,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:35:11,157 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:11,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1617129972, now seen corresponding path program 1 times [2025-03-17 14:35:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:11,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465919210] [2025-03-17 14:35:11,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:11,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:35:11,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:35:11,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:11,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:35:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465919210] [2025-03-17 14:35:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465919210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:11,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:11,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:35:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670933219] [2025-03-17 14:35:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:11,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:35:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:11,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:35:11,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:35:11,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:11,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 339 transitions, 691 flow. Second operand has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:11,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:11,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:11,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:11,607 INFO L124 PetriNetUnfolderBase]: 1543/4148 cut-off events. [2025-03-17 14:35:11,607 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 14:35:11,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7054 conditions, 4148 events. 1543/4148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31253 event pairs, 1240 based on Foata normal form. 1/3363 useless extension candidates. Maximal degree in co-relation 6992. Up to 2881 conditions per place. [2025-03-17 14:35:11,621 INFO L140 encePairwiseOnDemand]: 491/495 looper letters, 184 selfloop transitions, 3 changer transitions 0/336 dead transitions. [2025-03-17 14:35:11,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 336 transitions, 1059 flow [2025-03-17 14:35:11,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:35:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:35:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 800 transitions. [2025-03-17 14:35:11,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2025-03-17 14:35:11,624 INFO L175 Difference]: Start difference. First operand has 312 places, 339 transitions, 691 flow. Second operand 4 states and 800 transitions. [2025-03-17 14:35:11,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 336 transitions, 1059 flow [2025-03-17 14:35:11,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 336 transitions, 1053 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:35:11,629 INFO L231 Difference]: Finished difference. Result has 309 places, 336 transitions, 685 flow [2025-03-17 14:35:11,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=685, PETRI_PLACES=309, PETRI_TRANSITIONS=336} [2025-03-17 14:35:11,631 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -32 predicate places. [2025-03-17 14:35:11,632 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 336 transitions, 685 flow [2025-03-17 14:35:11,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:11,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:11,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:11,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:35:11,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:11,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:11,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1352143776, now seen corresponding path program 1 times [2025-03-17 14:35:11,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:11,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114830213] [2025-03-17 14:35:11,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:11,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:11,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:35:11,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:35:11,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:11,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:35:11,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:11,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114830213] [2025-03-17 14:35:11,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114830213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:11,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:11,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:35:11,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238594116] [2025-03-17 14:35:11,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:11,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:35:11,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:11,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:35:11,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:35:11,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 495 [2025-03-17 14:35:11,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 336 transitions, 685 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:11,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:11,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 495 [2025-03-17 14:35:11,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:12,255 INFO L124 PetriNetUnfolderBase]: 1835/4811 cut-off events. [2025-03-17 14:35:12,255 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:35:12,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8261 conditions, 4811 events. 1835/4811 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 37123 event pairs, 1240 based on Foata normal form. 0/3955 useless extension candidates. Maximal degree in co-relation 8199. Up to 2896 conditions per place. [2025-03-17 14:35:12,270 INFO L140 encePairwiseOnDemand]: 491/495 looper letters, 333 selfloop transitions, 2 changer transitions 0/480 dead transitions. [2025-03-17 14:35:12,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 480 transitions, 1643 flow [2025-03-17 14:35:12,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:35:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:35:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-03-17 14:35:12,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5279461279461279 [2025-03-17 14:35:12,272 INFO L175 Difference]: Start difference. First operand has 309 places, 336 transitions, 685 flow. Second operand 3 states and 784 transitions. [2025-03-17 14:35:12,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 480 transitions, 1643 flow [2025-03-17 14:35:12,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 480 transitions, 1637 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:35:12,279 INFO L231 Difference]: Finished difference. Result has 306 places, 334 transitions, 679 flow [2025-03-17 14:35:12,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=306, PETRI_TRANSITIONS=334} [2025-03-17 14:35:12,282 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -35 predicate places. [2025-03-17 14:35:12,282 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 334 transitions, 679 flow [2025-03-17 14:35:12,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:12,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:12,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:12,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:35:12,283 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:12,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1352143777, now seen corresponding path program 1 times [2025-03-17 14:35:12,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:12,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611186476] [2025-03-17 14:35:12,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:12,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:35:12,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:35:12,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:12,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:35:12,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:12,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611186476] [2025-03-17 14:35:12,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611186476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:12,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:12,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:35:12,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161492718] [2025-03-17 14:35:12,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:12,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:35:12,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:12,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:35:12,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:35:12,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:12,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 334 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:12,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:12,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:12,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:12,708 INFO L124 PetriNetUnfolderBase]: 1543/4147 cut-off events. [2025-03-17 14:35:12,708 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-03-17 14:35:12,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7180 conditions, 4147 events. 1543/4147 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31244 event pairs, 1240 based on Foata normal form. 0/3364 useless extension candidates. Maximal degree in co-relation 7045. Up to 2893 conditions per place. [2025-03-17 14:35:12,719 INFO L140 encePairwiseOnDemand]: 492/495 looper letters, 188 selfloop transitions, 2 changer transitions 0/337 dead transitions. [2025-03-17 14:35:12,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 337 transitions, 1065 flow [2025-03-17 14:35:12,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:35:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:35:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2025-03-17 14:35:12,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4377104377104377 [2025-03-17 14:35:12,722 INFO L175 Difference]: Start difference. First operand has 306 places, 334 transitions, 679 flow. Second operand 3 states and 650 transitions. [2025-03-17 14:35:12,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 337 transitions, 1065 flow [2025-03-17 14:35:12,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 337 transitions, 1061 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:35:12,728 INFO L231 Difference]: Finished difference. Result has 307 places, 335 transitions, 687 flow [2025-03-17 14:35:12,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=687, PETRI_PLACES=307, PETRI_TRANSITIONS=335} [2025-03-17 14:35:12,729 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -34 predicate places. [2025-03-17 14:35:12,729 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 335 transitions, 687 flow [2025-03-17 14:35:12,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:12,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:12,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:12,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:35:12,730 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:12,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash -307191175, now seen corresponding path program 1 times [2025-03-17 14:35:12,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:12,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942396553] [2025-03-17 14:35:12,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:12,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:12,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:35:12,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:35:12,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:12,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:35:12,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:12,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942396553] [2025-03-17 14:35:12,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942396553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:35:12,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181279968] [2025-03-17 14:35:12,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:12,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:35:12,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:35:12,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:35:12,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:35:12,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:35:12,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:35:12,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:12,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:12,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:35:12,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:35:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:35:12,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:35:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:35:12,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181279968] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:35:12,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:35:12,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2025-03-17 14:35:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661993968] [2025-03-17 14:35:12,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:12,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:35:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:12,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:35:12,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:35:12,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:12,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 335 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:12,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:12,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:12,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:13,354 INFO L124 PetriNetUnfolderBase]: 1543/4148 cut-off events. [2025-03-17 14:35:13,354 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:35:13,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7061 conditions, 4148 events. 1543/4148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 30995 event pairs, 1240 based on Foata normal form. 0/3366 useless extension candidates. Maximal degree in co-relation 7037. Up to 2884 conditions per place. [2025-03-17 14:35:13,365 INFO L140 encePairwiseOnDemand]: 491/495 looper letters, 186 selfloop transitions, 3 changer transitions 0/336 dead transitions. [2025-03-17 14:35:13,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 336 transitions, 1067 flow [2025-03-17 14:35:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:35:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:35:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2025-03-17 14:35:13,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-17 14:35:13,368 INFO L175 Difference]: Start difference. First operand has 307 places, 335 transitions, 687 flow. Second operand 3 states and 648 transitions. [2025-03-17 14:35:13,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 336 transitions, 1067 flow [2025-03-17 14:35:13,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 336 transitions, 1065 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:35:13,372 INFO L231 Difference]: Finished difference. Result has 310 places, 336 transitions, 703 flow [2025-03-17 14:35:13,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=703, PETRI_PLACES=310, PETRI_TRANSITIONS=336} [2025-03-17 14:35:13,373 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -31 predicate places. [2025-03-17 14:35:13,373 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 336 transitions, 703 flow [2025-03-17 14:35:13,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:13,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:13,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:13,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:35:13,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 14:35:13,575 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:13,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:13,575 INFO L85 PathProgramCache]: Analyzing trace with hash 808835746, now seen corresponding path program 1 times [2025-03-17 14:35:13,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:13,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669776928] [2025-03-17 14:35:13,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:13,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:13,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:35:13,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:35:13,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:13,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:35:13,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:13,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669776928] [2025-03-17 14:35:13,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669776928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:35:13,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478943771] [2025-03-17 14:35:13,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:13,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:35:13,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:35:13,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:35:13,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:35:13,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:35:13,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:35:13,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:13,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:13,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:35:13,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:35:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:35:13,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:35:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:35:13,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478943771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:35:13,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:35:13,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 14:35:13,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772329488] [2025-03-17 14:35:13,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:35:13,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:35:13,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:13,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:35:13,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:35:13,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:13,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 336 transitions, 703 flow. Second operand has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:13,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:13,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:13,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:14,452 INFO L124 PetriNetUnfolderBase]: 1543/4151 cut-off events. [2025-03-17 14:35:14,452 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:35:14,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7076 conditions, 4151 events. 1543/4151 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 30992 event pairs, 1240 based on Foata normal form. 1/3371 useless extension candidates. Maximal degree in co-relation 7033. Up to 2892 conditions per place. [2025-03-17 14:35:14,467 INFO L140 encePairwiseOnDemand]: 491/495 looper letters, 189 selfloop transitions, 5 changer transitions 0/341 dead transitions. [2025-03-17 14:35:14,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 341 transitions, 1103 flow [2025-03-17 14:35:14,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:35:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:35:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 959 transitions. [2025-03-17 14:35:14,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38747474747474747 [2025-03-17 14:35:14,469 INFO L175 Difference]: Start difference. First operand has 310 places, 336 transitions, 703 flow. Second operand 5 states and 959 transitions. [2025-03-17 14:35:14,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 341 transitions, 1103 flow [2025-03-17 14:35:14,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 341 transitions, 1097 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:35:14,475 INFO L231 Difference]: Finished difference. Result has 314 places, 338 transitions, 723 flow [2025-03-17 14:35:14,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=723, PETRI_PLACES=314, PETRI_TRANSITIONS=338} [2025-03-17 14:35:14,477 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -27 predicate places. [2025-03-17 14:35:14,477 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 338 transitions, 723 flow [2025-03-17 14:35:14,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:14,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:14,478 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:14,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:35:14,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 14:35:14,679 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:14,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:14,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1580940666, now seen corresponding path program 2 times [2025-03-17 14:35:14,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:14,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418943270] [2025-03-17 14:35:14,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:35:14,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:14,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-17 14:35:14,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 20 statements. [2025-03-17 14:35:14,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:35:14,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:35:14,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:14,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418943270] [2025-03-17 14:35:14,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418943270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:14,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:14,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:35:14,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999522597] [2025-03-17 14:35:14,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:14,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:35:14,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:14,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:35:14,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:35:14,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:14,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 338 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:14,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:14,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:14,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:15,130 INFO L124 PetriNetUnfolderBase]: 1543/4148 cut-off events. [2025-03-17 14:35:15,130 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-17 14:35:15,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7081 conditions, 4148 events. 1543/4148 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31039 event pairs, 1240 based on Foata normal form. 1/3367 useless extension candidates. Maximal degree in co-relation 7032. Up to 2888 conditions per place. [2025-03-17 14:35:15,141 INFO L140 encePairwiseOnDemand]: 492/495 looper letters, 187 selfloop transitions, 3 changer transitions 0/335 dead transitions. [2025-03-17 14:35:15,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 335 transitions, 1097 flow [2025-03-17 14:35:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:35:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:35:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2025-03-17 14:35:15,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.435016835016835 [2025-03-17 14:35:15,142 INFO L175 Difference]: Start difference. First operand has 314 places, 338 transitions, 723 flow. Second operand 3 states and 646 transitions. [2025-03-17 14:35:15,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 335 transitions, 1097 flow [2025-03-17 14:35:15,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 335 transitions, 1091 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 14:35:15,147 INFO L231 Difference]: Finished difference. Result has 312 places, 335 transitions, 717 flow [2025-03-17 14:35:15,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=717, PETRI_PLACES=312, PETRI_TRANSITIONS=335} [2025-03-17 14:35:15,147 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -29 predicate places. [2025-03-17 14:35:15,148 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 335 transitions, 717 flow [2025-03-17 14:35:15,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:15,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:15,148 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:15,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:35:15,148 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:15,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash -893598742, now seen corresponding path program 1 times [2025-03-17 14:35:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:15,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68231880] [2025-03-17 14:35:15,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:15,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:35:15,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:35:15,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:15,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:35:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68231880] [2025-03-17 14:35:15,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68231880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:15,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:15,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:35:15,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278494245] [2025-03-17 14:35:15,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:15,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:35:15,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:15,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:35:15,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:35:15,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:15,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 335 transitions, 717 flow. Second operand has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:15,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:15,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:15,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:15,731 INFO L124 PetriNetUnfolderBase]: 1543/4145 cut-off events. [2025-03-17 14:35:15,732 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-17 14:35:15,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7078 conditions, 4145 events. 1543/4145 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31032 event pairs, 1240 based on Foata normal form. 1/3365 useless extension candidates. Maximal degree in co-relation 7031. Up to 2888 conditions per place. [2025-03-17 14:35:15,741 INFO L140 encePairwiseOnDemand]: 490/495 looper letters, 184 selfloop transitions, 5 changer transitions 0/332 dead transitions. [2025-03-17 14:35:15,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 332 transitions, 1089 flow [2025-03-17 14:35:15,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:35:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:35:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 798 transitions. [2025-03-17 14:35:15,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2025-03-17 14:35:15,743 INFO L175 Difference]: Start difference. First operand has 312 places, 335 transitions, 717 flow. Second operand 4 states and 798 transitions. [2025-03-17 14:35:15,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 332 transitions, 1089 flow [2025-03-17 14:35:15,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 332 transitions, 1083 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:35:15,747 INFO L231 Difference]: Finished difference. Result has 310 places, 332 transitions, 715 flow [2025-03-17 14:35:15,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=715, PETRI_PLACES=310, PETRI_TRANSITIONS=332} [2025-03-17 14:35:15,747 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -31 predicate places. [2025-03-17 14:35:15,748 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 332 transitions, 715 flow [2025-03-17 14:35:15,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:15,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:15,748 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:15,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:35:15,748 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:15,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:15,749 INFO L85 PathProgramCache]: Analyzing trace with hash -828342230, now seen corresponding path program 1 times [2025-03-17 14:35:15,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:15,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84352461] [2025-03-17 14:35:15,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:15,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:15,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:35:15,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:35:15,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:15,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:35:15,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:15,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84352461] [2025-03-17 14:35:15,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84352461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:15,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:15,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:35:15,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999802897] [2025-03-17 14:35:15,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:15,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:35:15,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:15,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:35:15,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:35:15,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:16,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 332 transitions, 715 flow. Second operand has 5 states, 5 states have (on average 156.2) internal successors, (781), 5 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:16,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:16,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:16,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:16,621 INFO L124 PetriNetUnfolderBase]: 1533/4057 cut-off events. [2025-03-17 14:35:16,622 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 14:35:16,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6991 conditions, 4057 events. 1533/4057 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 30108 event pairs, 992 based on Foata normal form. 0/3316 useless extension candidates. Maximal degree in co-relation 6944. Up to 2341 conditions per place. [2025-03-17 14:35:16,632 INFO L140 encePairwiseOnDemand]: 487/495 looper letters, 326 selfloop transitions, 8 changer transitions 0/477 dead transitions. [2025-03-17 14:35:16,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 477 transitions, 1673 flow [2025-03-17 14:35:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:35:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:35:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1249 transitions. [2025-03-17 14:35:16,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42053872053872055 [2025-03-17 14:35:16,634 INFO L175 Difference]: Start difference. First operand has 310 places, 332 transitions, 715 flow. Second operand 6 states and 1249 transitions. [2025-03-17 14:35:16,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 477 transitions, 1673 flow [2025-03-17 14:35:16,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 477 transitions, 1663 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:35:16,640 INFO L231 Difference]: Finished difference. Result has 311 places, 331 transitions, 719 flow [2025-03-17 14:35:16,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=719, PETRI_PLACES=311, PETRI_TRANSITIONS=331} [2025-03-17 14:35:16,641 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -30 predicate places. [2025-03-17 14:35:16,641 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 331 transitions, 719 flow [2025-03-17 14:35:16,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 156.2) internal successors, (781), 5 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:16,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:16,641 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:16,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:35:16,641 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:16,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:16,642 INFO L85 PathProgramCache]: Analyzing trace with hash -828342229, now seen corresponding path program 1 times [2025-03-17 14:35:16,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:16,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605458545] [2025-03-17 14:35:16,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:16,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:16,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:35:16,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:35:16,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:16,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:35:16,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:16,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605458545] [2025-03-17 14:35:16,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605458545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:16,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:16,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:35:16,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267225779] [2025-03-17 14:35:16,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:16,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:35:16,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:16,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:35:16,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:35:17,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:17,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 331 transitions, 719 flow. Second operand has 5 states, 5 states have (on average 156.2) internal successors, (781), 5 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:17,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:17,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:17,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:17,536 INFO L124 PetriNetUnfolderBase]: 1543/4143 cut-off events. [2025-03-17 14:35:17,537 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-03-17 14:35:17,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7204 conditions, 4143 events. 1543/4143 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 30980 event pairs, 1240 based on Foata normal form. 0/3364 useless extension candidates. Maximal degree in co-relation 7155. Up to 2887 conditions per place. [2025-03-17 14:35:17,546 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 181 selfloop transitions, 6 changer transitions 0/330 dead transitions. [2025-03-17 14:35:17,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 330 transitions, 1091 flow [2025-03-17 14:35:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:35:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:35:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 949 transitions. [2025-03-17 14:35:17,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38343434343434346 [2025-03-17 14:35:17,548 INFO L175 Difference]: Start difference. First operand has 311 places, 331 transitions, 719 flow. Second operand 5 states and 949 transitions. [2025-03-17 14:35:17,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 330 transitions, 1091 flow [2025-03-17 14:35:17,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 330 transitions, 1075 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 14:35:17,552 INFO L231 Difference]: Finished difference. Result has 309 places, 330 transitions, 713 flow [2025-03-17 14:35:17,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=713, PETRI_PLACES=309, PETRI_TRANSITIONS=330} [2025-03-17 14:35:17,553 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -32 predicate places. [2025-03-17 14:35:17,553 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 330 transitions, 713 flow [2025-03-17 14:35:17,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 156.2) internal successors, (781), 5 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:17,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:17,554 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:17,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:35:17,554 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:17,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1467860079, now seen corresponding path program 1 times [2025-03-17 14:35:17,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:17,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148246515] [2025-03-17 14:35:17,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:17,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:17,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:35:17,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:35:17,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:17,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:35:17,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:17,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148246515] [2025-03-17 14:35:17,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148246515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:17,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:17,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:35:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276178164] [2025-03-17 14:35:17,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:17,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:35:17,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:17,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:35:17,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:35:17,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 495 [2025-03-17 14:35:17,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 330 transitions, 713 flow. Second operand has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:17,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:17,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 495 [2025-03-17 14:35:17,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:18,214 INFO L124 PetriNetUnfolderBase]: 1533/4054 cut-off events. [2025-03-17 14:35:18,215 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:35:18,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6989 conditions, 4054 events. 1533/4054 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 30073 event pairs, 992 based on Foata normal form. 1/3317 useless extension candidates. Maximal degree in co-relation 6941. Up to 2343 conditions per place. [2025-03-17 14:35:18,224 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 329 selfloop transitions, 5 changer transitions 0/474 dead transitions. [2025-03-17 14:35:18,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 474 transitions, 1669 flow [2025-03-17 14:35:18,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:35:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:35:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 932 transitions. [2025-03-17 14:35:18,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4707070707070707 [2025-03-17 14:35:18,226 INFO L175 Difference]: Start difference. First operand has 309 places, 330 transitions, 713 flow. Second operand 4 states and 932 transitions. [2025-03-17 14:35:18,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 474 transitions, 1669 flow [2025-03-17 14:35:18,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 474 transitions, 1657 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:35:18,231 INFO L231 Difference]: Finished difference. Result has 306 places, 328 transitions, 707 flow [2025-03-17 14:35:18,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=707, PETRI_PLACES=306, PETRI_TRANSITIONS=328} [2025-03-17 14:35:18,232 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -35 predicate places. [2025-03-17 14:35:18,232 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 328 transitions, 707 flow [2025-03-17 14:35:18,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:18,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:18,232 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:18,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:35:18,232 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:18,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:18,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1467860078, now seen corresponding path program 1 times [2025-03-17 14:35:18,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:18,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879871325] [2025-03-17 14:35:18,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:18,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:18,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:35:18,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:35:18,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:18,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:35:18,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:18,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879871325] [2025-03-17 14:35:18,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879871325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:18,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:18,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:35:18,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81804347] [2025-03-17 14:35:18,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:18,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:35:18,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:18,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:35:18,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:35:18,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 495 [2025-03-17 14:35:18,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 328 transitions, 707 flow. Second operand has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:18,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:18,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 495 [2025-03-17 14:35:18,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:18,859 INFO L124 PetriNetUnfolderBase]: 1543/4139 cut-off events. [2025-03-17 14:35:18,860 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-03-17 14:35:18,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7197 conditions, 4139 events. 1543/4139 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31065 event pairs, 1240 based on Foata normal form. 2/3364 useless extension candidates. Maximal degree in co-relation 7149. Up to 2887 conditions per place. [2025-03-17 14:35:18,871 INFO L140 encePairwiseOnDemand]: 490/495 looper letters, 183 selfloop transitions, 4 changer transitions 0/326 dead transitions. [2025-03-17 14:35:18,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 326 transitions, 1077 flow [2025-03-17 14:35:18,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:35:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:35:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 789 transitions. [2025-03-17 14:35:18,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3984848484848485 [2025-03-17 14:35:18,873 INFO L175 Difference]: Start difference. First operand has 306 places, 328 transitions, 707 flow. Second operand 4 states and 789 transitions. [2025-03-17 14:35:18,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 326 transitions, 1077 flow [2025-03-17 14:35:18,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 326 transitions, 1067 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:35:18,877 INFO L231 Difference]: Finished difference. Result has 304 places, 326 transitions, 701 flow [2025-03-17 14:35:18,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=701, PETRI_PLACES=304, PETRI_TRANSITIONS=326} [2025-03-17 14:35:18,877 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -37 predicate places. [2025-03-17 14:35:18,878 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 326 transitions, 701 flow [2025-03-17 14:35:18,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:18,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:18,878 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:18,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:35:18,878 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:18,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1089713112, now seen corresponding path program 1 times [2025-03-17 14:35:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:18,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768881037] [2025-03-17 14:35:18,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:18,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 14:35:18,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:35:18,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:18,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:35:18,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:18,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768881037] [2025-03-17 14:35:18,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768881037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:35:18,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045706973] [2025-03-17 14:35:18,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:18,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:35:18,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:35:18,948 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:35:18,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:35:19,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 14:35:19,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:35:19,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:19,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:19,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:35:19,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:35:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:35:19,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:35:19,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:35:19,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045706973] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:35:19,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:35:19,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2025-03-17 14:35:19,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298164777] [2025-03-17 14:35:19,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:35:19,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:35:19,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:19,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:35:19,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:35:19,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 495 [2025-03-17 14:35:19,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 326 transitions, 701 flow. Second operand has 9 states, 9 states have (on average 157.44444444444446) internal successors, (1417), 9 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:19,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:19,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 495 [2025-03-17 14:35:19,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:19,743 INFO L124 PetriNetUnfolderBase]: 1549/4189 cut-off events. [2025-03-17 14:35:19,743 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-17 14:35:19,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7153 conditions, 4189 events. 1549/4189 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31046 event pairs, 1240 based on Foata normal form. 2/3414 useless extension candidates. Maximal degree in co-relation 7105. Up to 2877 conditions per place. [2025-03-17 14:35:19,754 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 206 selfloop transitions, 8 changer transitions 0/353 dead transitions. [2025-03-17 14:35:19,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 353 transitions, 1201 flow [2025-03-17 14:35:19,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:35:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:35:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1287 transitions. [2025-03-17 14:35:19,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2025-03-17 14:35:19,756 INFO L175 Difference]: Start difference. First operand has 304 places, 326 transitions, 701 flow. Second operand 7 states and 1287 transitions. [2025-03-17 14:35:19,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 353 transitions, 1201 flow [2025-03-17 14:35:19,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 353 transitions, 1185 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:35:19,760 INFO L231 Difference]: Finished difference. Result has 310 places, 329 transitions, 737 flow [2025-03-17 14:35:19,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=737, PETRI_PLACES=310, PETRI_TRANSITIONS=329} [2025-03-17 14:35:19,761 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -31 predicate places. [2025-03-17 14:35:19,761 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 329 transitions, 737 flow [2025-03-17 14:35:19,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 157.44444444444446) internal successors, (1417), 9 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:19,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:19,762 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:19,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:35:19,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:35:19,962 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:19,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:19,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2059648250, now seen corresponding path program 2 times [2025-03-17 14:35:19,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:19,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248595984] [2025-03-17 14:35:19,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:35:19,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:19,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-17 14:35:20,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 14:35:20,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:35:20,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-17 14:35:20,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:20,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248595984] [2025-03-17 14:35:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248595984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:20,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:20,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:35:20,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061258376] [2025-03-17 14:35:20,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:20,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:35:20,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:20,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:35:20,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:35:20,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 495 [2025-03-17 14:35:20,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 329 transitions, 737 flow. Second operand has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:20,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:20,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 495 [2025-03-17 14:35:20,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:20,958 INFO L124 PetriNetUnfolderBase]: 1503/4940 cut-off events. [2025-03-17 14:35:20,959 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-17 14:35:20,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7912 conditions, 4940 events. 1503/4940 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 42569 event pairs, 124 based on Foata normal form. 126/4311 useless extension candidates. Maximal degree in co-relation 7859. Up to 1956 conditions per place. [2025-03-17 14:35:20,973 INFO L140 encePairwiseOnDemand]: 488/495 looper letters, 478 selfloop transitions, 5 changer transitions 0/621 dead transitions. [2025-03-17 14:35:20,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 621 transitions, 2287 flow [2025-03-17 14:35:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:35:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:35:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1086 transitions. [2025-03-17 14:35:20,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5484848484848485 [2025-03-17 14:35:20,975 INFO L175 Difference]: Start difference. First operand has 310 places, 329 transitions, 737 flow. Second operand 4 states and 1086 transitions. [2025-03-17 14:35:20,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 621 transitions, 2287 flow [2025-03-17 14:35:20,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 621 transitions, 2275 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-17 14:35:20,981 INFO L231 Difference]: Finished difference. Result has 310 places, 329 transitions, 747 flow [2025-03-17 14:35:20,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=747, PETRI_PLACES=310, PETRI_TRANSITIONS=329} [2025-03-17 14:35:20,981 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -31 predicate places. [2025-03-17 14:35:20,981 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 329 transitions, 747 flow [2025-03-17 14:35:20,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:20,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:20,982 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:20,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:35:20,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:20,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1590757993, now seen corresponding path program 1 times [2025-03-17 14:35:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:20,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042965789] [2025-03-17 14:35:20,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:20,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:21,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 14:35:21,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 14:35:21,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:21,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 14:35:21,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:21,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042965789] [2025-03-17 14:35:21,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042965789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:35:21,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801494220] [2025-03-17 14:35:21,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:21,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:35:21,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:35:21,286 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:35:21,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:35:21,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 14:35:21,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 14:35:21,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:21,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:21,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 14:35:21,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:35:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 14:35:21,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:35:21,693 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 14:35:21,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801494220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:35:21,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:35:21,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-17 14:35:21,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090633118] [2025-03-17 14:35:21,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:35:21,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:35:21,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:21,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:35:21,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:35:21,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 495 [2025-03-17 14:35:21,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 329 transitions, 747 flow. Second operand has 14 states, 14 states have (on average 154.92857142857142) internal successors, (2169), 14 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:21,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:21,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 495 [2025-03-17 14:35:21,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:22,945 INFO L124 PetriNetUnfolderBase]: 1550/4249 cut-off events. [2025-03-17 14:35:22,945 INFO L125 PetriNetUnfolderBase]: For 1029/1032 co-relation queries the response was YES. [2025-03-17 14:35:22,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8137 conditions, 4249 events. 1550/4249 cut-off events. For 1029/1032 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31597 event pairs, 1240 based on Foata normal form. 2/3585 useless extension candidates. Maximal degree in co-relation 8086. Up to 2884 conditions per place. [2025-03-17 14:35:22,957 INFO L140 encePairwiseOnDemand]: 484/495 looper letters, 216 selfloop transitions, 27 changer transitions 0/379 dead transitions. [2025-03-17 14:35:22,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 379 transitions, 1355 flow [2025-03-17 14:35:22,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 14:35:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 14:35:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2960 transitions. [2025-03-17 14:35:22,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33221099887766553 [2025-03-17 14:35:22,962 INFO L175 Difference]: Start difference. First operand has 310 places, 329 transitions, 747 flow. Second operand 18 states and 2960 transitions. [2025-03-17 14:35:22,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 379 transitions, 1355 flow [2025-03-17 14:35:22,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 379 transitions, 1350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:35:22,967 INFO L231 Difference]: Finished difference. Result has 335 places, 353 transitions, 931 flow [2025-03-17 14:35:22,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=931, PETRI_PLACES=335, PETRI_TRANSITIONS=353} [2025-03-17 14:35:22,967 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -6 predicate places. [2025-03-17 14:35:22,967 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 353 transitions, 931 flow [2025-03-17 14:35:22,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 154.92857142857142) internal successors, (2169), 14 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:22,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:22,969 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:22,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:35:23,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:35:23,169 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:23,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:23,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1407926145, now seen corresponding path program 1 times [2025-03-17 14:35:23,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:23,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652542138] [2025-03-17 14:35:23,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:23,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:23,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 14:35:23,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 14:35:23,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:23,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 14:35:23,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:23,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652542138] [2025-03-17 14:35:23,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652542138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:23,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:23,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:35:23,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514848355] [2025-03-17 14:35:23,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:23,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:35:23,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:23,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:35:23,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:35:23,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 495 [2025-03-17 14:35:23,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 353 transitions, 931 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:23,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:23,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 495 [2025-03-17 14:35:23,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:23,812 INFO L124 PetriNetUnfolderBase]: 1542/4213 cut-off events. [2025-03-17 14:35:23,812 INFO L125 PetriNetUnfolderBase]: For 843/846 co-relation queries the response was YES. [2025-03-17 14:35:23,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7893 conditions, 4213 events. 1542/4213 cut-off events. For 843/846 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 31372 event pairs, 1240 based on Foata normal form. 4/3564 useless extension candidates. Maximal degree in co-relation 7832. Up to 2922 conditions per place. [2025-03-17 14:35:23,829 INFO L140 encePairwiseOnDemand]: 492/495 looper letters, 202 selfloop transitions, 6 changer transitions 0/343 dead transitions. [2025-03-17 14:35:23,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 343 transitions, 1303 flow [2025-03-17 14:35:23,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:35:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:35:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-03-17 14:35:23,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42828282828282827 [2025-03-17 14:35:23,831 INFO L175 Difference]: Start difference. First operand has 335 places, 353 transitions, 931 flow. Second operand 3 states and 636 transitions. [2025-03-17 14:35:23,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 343 transitions, 1303 flow [2025-03-17 14:35:23,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 343 transitions, 1284 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-17 14:35:23,836 INFO L231 Difference]: Finished difference. Result has 329 places, 343 transitions, 880 flow [2025-03-17 14:35:23,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=329, PETRI_TRANSITIONS=343} [2025-03-17 14:35:23,837 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -12 predicate places. [2025-03-17 14:35:23,837 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 343 transitions, 880 flow [2025-03-17 14:35:23,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:23,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:23,838 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:23,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 14:35:23,838 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 151 more)] === [2025-03-17 14:35:23,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:23,839 INFO L85 PathProgramCache]: Analyzing trace with hash 538245, now seen corresponding path program 1 times [2025-03-17 14:35:23,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:23,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294971670] [2025-03-17 14:35:23,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:23,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:23,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 14:35:23,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 14:35:23,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:23,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:35:23,991 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:35:24,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 14:35:24,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 14:35:24,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:24,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:35:24,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:35:24,189 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:35:24,189 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (153 of 154 remaining) [2025-03-17 14:35:24,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 154 remaining) [2025-03-17 14:35:24,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 154 remaining) [2025-03-17 14:35:24,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 154 remaining) [2025-03-17 14:35:24,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 154 remaining) [2025-03-17 14:35:24,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 154 remaining) [2025-03-17 14:35:24,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 154 remaining) [2025-03-17 14:35:24,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (146 of 154 remaining) [2025-03-17 14:35:24,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 154 remaining) [2025-03-17 14:35:24,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 154 remaining) [2025-03-17 14:35:24,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (143 of 154 remaining) [2025-03-17 14:35:24,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (142 of 154 remaining) [2025-03-17 14:35:24,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 154 remaining) [2025-03-17 14:35:24,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 154 remaining) [2025-03-17 14:35:24,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (139 of 154 remaining) [2025-03-17 14:35:24,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (138 of 154 remaining) [2025-03-17 14:35:24,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (137 of 154 remaining) [2025-03-17 14:35:24,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (136 of 154 remaining) [2025-03-17 14:35:24,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 154 remaining) [2025-03-17 14:35:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 154 remaining) [2025-03-17 14:35:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 154 remaining) [2025-03-17 14:35:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 154 remaining) [2025-03-17 14:35:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 154 remaining) [2025-03-17 14:35:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 154 remaining) [2025-03-17 14:35:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 154 remaining) [2025-03-17 14:35:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 154 remaining) [2025-03-17 14:35:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr64ASSERT_VIOLATIONMEMORY_LEAK (127 of 154 remaining) [2025-03-17 14:35:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 154 remaining) [2025-03-17 14:35:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 154 remaining) [2025-03-17 14:35:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr63ASSERT_VIOLATIONMEMORY_LEAK (124 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr27ASSERT_VIOLATIONMEMORY_LEAK (119 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr24ASSERT_VIOLATIONMEMORY_LEAK (110 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr52ASSERT_VIOLATIONMEMORY_LEAK (107 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr51ASSERT_VIOLATIONMEMORY_LEAK (104 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr50ASSERT_VIOLATIONMEMORY_LEAK (95 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 154 remaining) [2025-03-17 14:35:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONMEMORY_LEAK (90 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONMEMORY_LEAK (87 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONMEMORY_LEAK (86 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONMEMORY_LEAK (81 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 154 remaining) [2025-03-17 14:35:24,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr64ASSERT_VIOLATIONMEMORY_LEAK (62 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr63ASSERT_VIOLATIONMEMORY_LEAK (59 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr27ASSERT_VIOLATIONMEMORY_LEAK (54 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 154 remaining) [2025-03-17 14:35:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 154 remaining) [2025-03-17 14:35:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 154 remaining) [2025-03-17 14:35:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 154 remaining) [2025-03-17 14:35:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 154 remaining) [2025-03-17 14:35:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr24ASSERT_VIOLATIONMEMORY_LEAK (45 of 154 remaining) [2025-03-17 14:35:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 154 remaining) [2025-03-17 14:35:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 154 remaining) [2025-03-17 14:35:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr52ASSERT_VIOLATIONMEMORY_LEAK (42 of 154 remaining) [2025-03-17 14:35:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 154 remaining) [2025-03-17 14:35:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 154 remaining) [2025-03-17 14:35:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr51ASSERT_VIOLATIONMEMORY_LEAK (39 of 154 remaining) [2025-03-17 14:35:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 154 remaining) [2025-03-17 14:35:24,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 154 remaining) [2025-03-17 14:35:24,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr50ASSERT_VIOLATIONMEMORY_LEAK (30 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr17ASSERT_VIOLATIONMEMORY_LEAK (25 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr14ASSERT_VIOLATIONMEMORY_LEAK (22 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONMEMORY_LEAK (16 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 154 remaining) [2025-03-17 14:35:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 154 remaining) [2025-03-17 14:35:24,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 154 remaining) [2025-03-17 14:35:24,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 154 remaining) [2025-03-17 14:35:24,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 154 remaining) [2025-03-17 14:35:24,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 154 remaining) [2025-03-17 14:35:24,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 154 remaining) [2025-03-17 14:35:24,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 154 remaining) [2025-03-17 14:35:24,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 154 remaining) [2025-03-17 14:35:24,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 154 remaining) [2025-03-17 14:35:24,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 14:35:24,219 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:35:24,232 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:35:24,232 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 14:35:24,359 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 14:35:24,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 587 places, 856 transitions, 1728 flow [2025-03-17 14:35:24,487 INFO L124 PetriNetUnfolderBase]: 309/973 cut-off events. [2025-03-17 14:35:24,487 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 14:35:24,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 973 events. 309/973 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4926 event pairs, 0 based on Foata normal form. 0/488 useless extension candidates. Maximal degree in co-relation 792. Up to 12 conditions per place. [2025-03-17 14:35:24,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 587 places, 856 transitions, 1728 flow [2025-03-17 14:35:24,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 587 places, 856 transitions, 1728 flow [2025-03-17 14:35:24,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:35:24,528 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=None, 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;@13265dab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:35:24,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 219 error locations. [2025-03-17 14:35:24,529 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:35:24,529 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-03-17 14:35:24,529 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:35:24,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:35:24,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-17 14:35:24,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 216 more)] === [2025-03-17 14:35:24,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:35:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash 108073, now seen corresponding path program 1 times [2025-03-17 14:35:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:35:24,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361463817] [2025-03-17 14:35:24,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:35:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:35:24,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 14:35:24,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 14:35:24,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:35:24,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:35:24,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:35:24,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:35:24,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361463817] [2025-03-17 14:35:24,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361463817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:35:24,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:35:24,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:35:24,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457938239] [2025-03-17 14:35:24,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:35:24,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:35:24,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:35:24,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:35:24,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:35:24,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 856 [2025-03-17 14:35:24,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 856 transitions, 1728 flow. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:35:24,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:35:24,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 856 [2025-03-17 14:35:24,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand