./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/libvsync/ttaslock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/libvsync/ttaslock.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 1232142cbd2d3669d71853399351b59e265805f095536d7cdae31e54b7810261 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:16:18,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:16:18,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:16:18,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:16:18,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:16:18,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:16:18,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:16:18,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:16:18,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:16:18,767 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:16:18,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:16:18,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:16:18,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:16:18,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:16:18,768 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:16:18,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:16:18,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:16:18,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:16:18,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:16:18,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:16:18,768 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:16:18,768 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:16:18,769 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:16:18,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:16:18,769 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:16:18,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:16:18,769 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:16:18,769 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:16:18,769 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:16:18,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:16:18,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:16:18,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:16:18,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:16:18,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:18,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:16:18,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:16:18,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:16:18,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:16:18,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:18,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:16:18,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:16:18,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:16:18,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:16:18,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:16:18,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:16:18,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:16:18,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:16:18,770 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 1232142cbd2d3669d71853399351b59e265805f095536d7cdae31e54b7810261 [2025-01-10 01:16:18,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:16:18,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:16:18,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:16:18,987 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:16:18,987 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:16:18,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/ttaslock.i [2025-01-10 01:16:20,200 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14cd62faa/bddd2a3aa3f64fadaeb440c6cb44f72f/FLAG3b7c7b2db [2025-01-10 01:16:20,676 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:16:20,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/libvsync/ttaslock.i [2025-01-10 01:16:20,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14cd62faa/bddd2a3aa3f64fadaeb440c6cb44f72f/FLAG3b7c7b2db [2025-01-10 01:16:20,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14cd62faa/bddd2a3aa3f64fadaeb440c6cb44f72f [2025-01-10 01:16:20,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:16:20,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:16:20,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:16:20,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:16:20,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:16:20,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:16:20" (1/1) ... [2025-01-10 01:16:20,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b453623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:20, skipping insertion in model container [2025-01-10 01:16:20,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:16:20" (1/1) ... [2025-01-10 01:16:20,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:16:22,134 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:16:22,138 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:16:22,138 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:16:22,147 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:16:22,147 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:16:22,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:16:22,421 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:16:22,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-01-10 01:16:22,496 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-01-10 01:16:22,496 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-01-10 01:16:22,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-01-10 01:16:22,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-01-10 01:16:22,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-01-10 01:16:22,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-01-10 01:16:22,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-01-10 01:16:22,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-01-10 01:16:22,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-01-10 01:16:22,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-01-10 01:16:22,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-01-10 01:16:22,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-01-10 01:16:22,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-01-10 01:16:22,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-01-10 01:16:22,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-01-10 01:16:22,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-01-10 01:16:22,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-01-10 01:16:22,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-01-10 01:16:22,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-01-10 01:16:22,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-01-10 01:16:22,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-01-10 01:16:22,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-01-10 01:16:22,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-01-10 01:16:22,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-01-10 01:16:22,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-01-10 01:16:22,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-01-10 01:16:22,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-01-10 01:16:22,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-01-10 01:16:22,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-01-10 01:16:22,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-01-10 01:16:22,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-01-10 01:16:22,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-01-10 01:16:22,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-01-10 01:16:22,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-01-10 01:16:22,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-01-10 01:16:22,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-01-10 01:16:22,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-01-10 01:16:22,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-01-10 01:16:22,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-01-10 01:16:22,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-01-10 01:16:22,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-01-10 01:16:22,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-01-10 01:16:22,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-01-10 01:16:22,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-01-10 01:16:22,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-01-10 01:16:22,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-01-10 01:16:22,509 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-01-10 01:16:22,509 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-01-10 01:16:22,509 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-01-10 01:16:22,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-01-10 01:16:22,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-01-10 01:16:22,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-01-10 01:16:22,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-01-10 01:16:22,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-01-10 01:16:22,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-01-10 01:16:22,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-01-10 01:16:22,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-01-10 01:16:22,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-01-10 01:16:22,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-01-10 01:16:22,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-01-10 01:16:22,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-01-10 01:16:22,513 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-01-10 01:16:22,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-01-10 01:16:22,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-01-10 01:16:22,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-01-10 01:16:22,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-01-10 01:16:22,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-01-10 01:16:22,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-01-10 01:16:22,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-01-10 01:16:22,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-01-10 01:16:22,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-01-10 01:16:22,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-01-10 01:16:22,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-01-10 01:16:22,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-01-10 01:16:22,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-01-10 01:16:22,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-01-10 01:16:22,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-01-10 01:16:22,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-01-10 01:16:22,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-01-10 01:16:22,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-01-10 01:16:22,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-01-10 01:16:22,519 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-01-10 01:16:22,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-01-10 01:16:22,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-01-10 01:16:22,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-01-10 01:16:22,520 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-01-10 01:16:22,521 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-01-10 01:16:22,521 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-01-10 01:16:22,521 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-01-10 01:16:22,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-01-10 01:16:22,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-01-10 01:16:22,522 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-01-10 01:16:22,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-01-10 01:16:22,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-01-10 01:16:22,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-01-10 01:16:22,523 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-01-10 01:16:22,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-01-10 01:16:22,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-01-10 01:16:22,524 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-01-10 01:16:22,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:16:22,907 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:16:22,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22 WrapperNode [2025-01-10 01:16:22,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:16:22,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:16:22,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:16:22,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:16:22,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22" (1/1) ... [2025-01-10 01:16:22,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22" (1/1) ... [2025-01-10 01:16:23,007 INFO L138 Inliner]: procedures = 917, calls = 913, calls flagged for inlining = 815, calls inlined = 29, statements flattened = 263 [2025-01-10 01:16:23,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:16:23,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:16:23,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:16:23,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:16:23,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22" (1/1) ... [2025-01-10 01:16:23,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22" (1/1) ... [2025-01-10 01:16:23,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22" (1/1) ... [2025-01-10 01:16:23,031 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 5, 2]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-01-10 01:16:23,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22" (1/1) ... [2025-01-10 01:16:23,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22" (1/1) ... [2025-01-10 01:16:23,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22" (1/1) ... [2025-01-10 01:16:23,038 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22" (1/1) ... [2025-01-10 01:16:23,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22" (1/1) ... [2025-01-10 01:16:23,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22" (1/1) ... [2025-01-10 01:16:23,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22" (1/1) ... [2025-01-10 01:16:23,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:16:23,047 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:16:23,047 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:16:23,047 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:16:23,048 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22" (1/1) ... [2025-01-10 01:16:23,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:23,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:23,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:16:23,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:16:23,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:16:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:16:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:16:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:16:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:16:23,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:16:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-01-10 01:16:23,088 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-01-10 01:16:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:16:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:16:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:16:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:16:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:16:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:16:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:16:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:16:23,090 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:16:23,190 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:16:23,191 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:16:23,455 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:16:23,456 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:16:23,614 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:16:23,615 INFO L312 CfgBuilder]: Removed 32 assume(true) statements. [2025-01-10 01:16:23,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:16:23 BoogieIcfgContainer [2025-01-10 01:16:23,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:16:23,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:16:23,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:16:23,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:16:23,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:16:20" (1/3) ... [2025-01-10 01:16:23,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b49a28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:16:23, skipping insertion in model container [2025-01-10 01:16:23,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:22" (2/3) ... [2025-01-10 01:16:23,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b49a28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:16:23, skipping insertion in model container [2025-01-10 01:16:23,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:16:23" (3/3) ... [2025-01-10 01:16:23,624 INFO L128 eAbstractionObserver]: Analyzing ICFG ttaslock.i [2025-01-10 01:16:23,634 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:16:23,635 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ttaslock.i that has 2 procedures, 110 locations, 1 initial locations, 37 loop locations, and 15 error locations. [2025-01-10 01:16:23,636 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:16:23,710 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 01:16:23,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 173 transitions, 353 flow [2025-01-10 01:16:23,773 INFO L124 PetriNetUnfolderBase]: 76/217 cut-off events. [2025-01-10 01:16:23,775 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 01:16:23,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 217 events. 76/217 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 728 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 157. Up to 6 conditions per place. [2025-01-10 01:16:23,782 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 173 transitions, 353 flow [2025-01-10 01:16:23,788 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 173 transitions, 353 flow [2025-01-10 01:16:23,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:23,802 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;@76174cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:23,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-01-10 01:16:23,807 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:23,807 INFO L124 PetriNetUnfolderBase]: 5/17 cut-off events. [2025-01-10 01:16:23,807 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:23,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:23,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:16:23,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:16:23,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:23,811 INFO L85 PathProgramCache]: Analyzing trace with hash 923953529, now seen corresponding path program 1 times [2025-01-10 01:16:23,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:23,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517688334] [2025-01-10 01:16:23,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:23,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:23,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:16:23,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:16:23,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:23,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:23,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:23,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517688334] [2025-01-10 01:16:23,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517688334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:23,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:23,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:16:23,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100275588] [2025-01-10 01:16:23,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:23,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 01:16:23,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:23,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 01:16:23,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:16:23,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 173 [2025-01-10 01:16:23,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 173 transitions, 353 flow. Second operand has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:23,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:23,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 173 [2025-01-10 01:16:23,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:24,193 INFO L124 PetriNetUnfolderBase]: 447/1261 cut-off events. [2025-01-10 01:16:24,194 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-10 01:16:24,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2156 conditions, 1261 events. 447/1261 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7843 event pairs, 380 based on Foata normal form. 705/1758 useless extension candidates. Maximal degree in co-relation 2092. Up to 890 conditions per place. [2025-01-10 01:16:24,205 INFO L140 encePairwiseOnDemand]: 115/173 looper letters, 60 selfloop transitions, 0 changer transitions 0/113 dead transitions. [2025-01-10 01:16:24,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 113 transitions, 353 flow [2025-01-10 01:16:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 01:16:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 01:16:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 224 transitions. [2025-01-10 01:16:24,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6473988439306358 [2025-01-10 01:16:24,219 INFO L175 Difference]: Start difference. First operand has 113 places, 173 transitions, 353 flow. Second operand 2 states and 224 transitions. [2025-01-10 01:16:24,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 113 transitions, 353 flow [2025-01-10 01:16:24,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 113 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:16:24,225 INFO L231 Difference]: Finished difference. Result has 110 places, 113 transitions, 233 flow [2025-01-10 01:16:24,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=233, PETRI_PLACES=110, PETRI_TRANSITIONS=113} [2025-01-10 01:16:24,230 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -3 predicate places. [2025-01-10 01:16:24,230 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 113 transitions, 233 flow [2025-01-10 01:16:24,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:24,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:24,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:24,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:16:24,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:16:24,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1985176894, now seen corresponding path program 1 times [2025-01-10 01:16:24,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:24,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145455525] [2025-01-10 01:16:24,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:24,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:24,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:16:24,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:16:24,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:24,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:24,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:24,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145455525] [2025-01-10 01:16:24,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145455525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:24,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:24,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:24,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755601848] [2025-01-10 01:16:24,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:24,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:24,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:24,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:24,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:24,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 173 [2025-01-10 01:16:24,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 113 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:24,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:24,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 173 [2025-01-10 01:16:24,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:24,633 INFO L124 PetriNetUnfolderBase]: 535/1448 cut-off events. [2025-01-10 01:16:24,633 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 01:16:24,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2512 conditions, 1448 events. 535/1448 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9283 event pairs, 380 based on Foata normal form. 0/1238 useless extension candidates. Maximal degree in co-relation 2508. Up to 889 conditions per place. [2025-01-10 01:16:24,642 INFO L140 encePairwiseOnDemand]: 169/173 looper letters, 104 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2025-01-10 01:16:24,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 155 transitions, 529 flow [2025-01-10 01:16:24,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2025-01-10 01:16:24,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4913294797687861 [2025-01-10 01:16:24,645 INFO L175 Difference]: Start difference. First operand has 110 places, 113 transitions, 233 flow. Second operand 3 states and 255 transitions. [2025-01-10 01:16:24,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 155 transitions, 529 flow [2025-01-10 01:16:24,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 155 transitions, 529 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:16:24,649 INFO L231 Difference]: Finished difference. Result has 110 places, 111 transitions, 233 flow [2025-01-10 01:16:24,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=110, PETRI_TRANSITIONS=111} [2025-01-10 01:16:24,650 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -3 predicate places. [2025-01-10 01:16:24,651 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 111 transitions, 233 flow [2025-01-10 01:16:24,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:24,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:24,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:24,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:16:24,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:16:24,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:24,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1985176895, now seen corresponding path program 1 times [2025-01-10 01:16:24,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:24,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140887759] [2025-01-10 01:16:24,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:24,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:24,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:16:24,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:16:24,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:24,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:24,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:24,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140887759] [2025-01-10 01:16:24,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140887759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:24,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:24,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:16:24,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950450832] [2025-01-10 01:16:24,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:24,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:24,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:24,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:24,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:24,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 173 [2025-01-10 01:16:24,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 111 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:24,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:24,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 173 [2025-01-10 01:16:24,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:25,197 INFO L124 PetriNetUnfolderBase]: 490/1690 cut-off events. [2025-01-10 01:16:25,197 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-01-10 01:16:25,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2709 conditions, 1690 events. 490/1690 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 12543 event pairs, 76 based on Foata normal form. 0/1451 useless extension candidates. Maximal degree in co-relation 2704. Up to 588 conditions per place. [2025-01-10 01:16:25,206 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 145 selfloop transitions, 5 changer transitions 0/199 dead transitions. [2025-01-10 01:16:25,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 199 transitions, 709 flow [2025-01-10 01:16:25,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 356 transitions. [2025-01-10 01:16:25,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5144508670520231 [2025-01-10 01:16:25,209 INFO L175 Difference]: Start difference. First operand has 110 places, 111 transitions, 233 flow. Second operand 4 states and 356 transitions. [2025-01-10 01:16:25,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 199 transitions, 709 flow [2025-01-10 01:16:25,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 199 transitions, 705 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:25,216 INFO L231 Difference]: Finished difference. Result has 112 places, 111 transitions, 251 flow [2025-01-10 01:16:25,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=112, PETRI_TRANSITIONS=111} [2025-01-10 01:16:25,218 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -1 predicate places. [2025-01-10 01:16:25,218 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 111 transitions, 251 flow [2025-01-10 01:16:25,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:25,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:25,218 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:25,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:16:25,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-01-10 01:16:25,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:25,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1972552736, now seen corresponding path program 1 times [2025-01-10 01:16:25,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:25,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993307849] [2025-01-10 01:16:25,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:25,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:25,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:16:25,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:16:25,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:25,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:25,258 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:16:25,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:16:25,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:16:25,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:25,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:25,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:16:25,301 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:16:25,301 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 24 remaining) [2025-01-10 01:16:25,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (18 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (17 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (16 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 24 remaining) [2025-01-10 01:16:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 24 remaining) [2025-01-10 01:16:25,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:16:25,304 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 01:16:25,306 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 01:16:25,306 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 01:16:25,368 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:16:25,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 287 transitions, 590 flow [2025-01-10 01:16:25,408 INFO L124 PetriNetUnfolderBase]: 143/408 cut-off events. [2025-01-10 01:16:25,408 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:16:25,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 408 events. 143/408 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1756 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 300. Up to 12 conditions per place. [2025-01-10 01:16:25,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 287 transitions, 590 flow [2025-01-10 01:16:25,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 287 transitions, 590 flow [2025-01-10 01:16:25,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:25,423 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;@76174cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:25,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-01-10 01:16:25,424 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:25,424 INFO L124 PetriNetUnfolderBase]: 5/17 cut-off events. [2025-01-10 01:16:25,425 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:25,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:25,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:16:25,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-01-10 01:16:25,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:25,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1197839064, now seen corresponding path program 1 times [2025-01-10 01:16:25,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:25,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130645579] [2025-01-10 01:16:25,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:25,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:25,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:16:25,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:16:25,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:25,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:25,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:25,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130645579] [2025-01-10 01:16:25,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130645579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:25,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:25,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:16:25,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541860995] [2025-01-10 01:16:25,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:25,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 01:16:25,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:25,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 01:16:25,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:16:25,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 287 [2025-01-10 01:16:25,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 287 transitions, 590 flow. Second operand has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:25,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:25,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 287 [2025-01-10 01:16:25,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:29,980 INFO L124 PetriNetUnfolderBase]: 37109/64680 cut-off events. [2025-01-10 01:16:29,980 INFO L125 PetriNetUnfolderBase]: For 345/350 co-relation queries the response was YES. [2025-01-10 01:16:30,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119477 conditions, 64680 events. 37109/64680 cut-off events. For 345/350 co-relation queries the response was YES. Maximal size of possible extension queue 1498. Compared 584690 event pairs, 31806 based on Foata normal form. 40047/91625 useless extension candidates. Maximal degree in co-relation 108031. Up to 54595 conditions per place. [2025-01-10 01:16:30,287 INFO L140 encePairwiseOnDemand]: 189/287 looper letters, 106 selfloop transitions, 0 changer transitions 0/187 dead transitions. [2025-01-10 01:16:30,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 187 transitions, 602 flow [2025-01-10 01:16:30,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 01:16:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 01:16:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 366 transitions. [2025-01-10 01:16:30,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6376306620209059 [2025-01-10 01:16:30,289 INFO L175 Difference]: Start difference. First operand has 184 places, 287 transitions, 590 flow. Second operand 2 states and 366 transitions. [2025-01-10 01:16:30,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 187 transitions, 602 flow [2025-01-10 01:16:30,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 187 transitions, 602 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:16:30,293 INFO L231 Difference]: Finished difference. Result has 179 places, 187 transitions, 390 flow [2025-01-10 01:16:30,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=390, PETRI_PLACES=179, PETRI_TRANSITIONS=187} [2025-01-10 01:16:30,293 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -5 predicate places. [2025-01-10 01:16:30,294 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 187 transitions, 390 flow [2025-01-10 01:16:30,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:30,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:30,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:30,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:16:30,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-01-10 01:16:30,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:30,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1823184605, now seen corresponding path program 1 times [2025-01-10 01:16:30,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:30,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094780377] [2025-01-10 01:16:30,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:30,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:30,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:16:30,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:16:30,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:30,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:30,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:30,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094780377] [2025-01-10 01:16:30,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094780377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:30,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:30,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:30,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652265055] [2025-01-10 01:16:30,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:30,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:30,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:30,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:30,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:30,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 287 [2025-01-10 01:16:30,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 187 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:30,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:30,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 287 [2025-01-10 01:16:30,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:34,766 INFO L124 PetriNetUnfolderBase]: 44105/76370 cut-off events. [2025-01-10 01:16:34,767 INFO L125 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2025-01-10 01:16:34,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141325 conditions, 76370 events. 44105/76370 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 1747. Compared 697856 event pairs, 31768 based on Foata normal form. 0/61428 useless extension candidates. Maximal degree in co-relation 141320. Up to 54511 conditions per place. [2025-01-10 01:16:35,198 INFO L140 encePairwiseOnDemand]: 283/287 looper letters, 194 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-01-10 01:16:35,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 273 transitions, 954 flow [2025-01-10 01:16:35,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2025-01-10 01:16:35,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49825783972125437 [2025-01-10 01:16:35,203 INFO L175 Difference]: Start difference. First operand has 179 places, 187 transitions, 390 flow. Second operand 3 states and 429 transitions. [2025-01-10 01:16:35,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 273 transitions, 954 flow [2025-01-10 01:16:35,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 273 transitions, 954 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:16:35,207 INFO L231 Difference]: Finished difference. Result has 179 places, 185 transitions, 390 flow [2025-01-10 01:16:35,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=179, PETRI_TRANSITIONS=185} [2025-01-10 01:16:35,208 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -5 predicate places. [2025-01-10 01:16:35,208 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 185 transitions, 390 flow [2025-01-10 01:16:35,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:35,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:35,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:35,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:16:35,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-01-10 01:16:35,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:35,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1823184606, now seen corresponding path program 1 times [2025-01-10 01:16:35,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:35,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425505799] [2025-01-10 01:16:35,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:35,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:16:35,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:16:35,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:35,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:35,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:35,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:35,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425505799] [2025-01-10 01:16:35,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425505799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:35,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:35,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:16:35,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636021720] [2025-01-10 01:16:35,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:35,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:35,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:35,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:35,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:35,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 287 [2025-01-10 01:16:35,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 185 transitions, 390 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:35,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:35,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 287 [2025-01-10 01:16:35,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:39,536 INFO L124 PetriNetUnfolderBase]: 37108/67124 cut-off events. [2025-01-10 01:16:39,537 INFO L125 PetriNetUnfolderBase]: For 1900/1908 co-relation queries the response was YES. [2025-01-10 01:16:39,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123521 conditions, 67124 events. 37108/67124 cut-off events. For 1900/1908 co-relation queries the response was YES. Maximal size of possible extension queue 1541. Compared 635155 event pairs, 12265 based on Foata normal form. 1561/56079 useless extension candidates. Maximal degree in co-relation 123515. Up to 35797 conditions per place. [2025-01-10 01:16:39,931 INFO L140 encePairwiseOnDemand]: 280/287 looper letters, 278 selfloop transitions, 5 changer transitions 0/361 dead transitions. [2025-01-10 01:16:39,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 361 transitions, 1308 flow [2025-01-10 01:16:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2025-01-10 01:16:39,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5270034843205574 [2025-01-10 01:16:39,935 INFO L175 Difference]: Start difference. First operand has 179 places, 185 transitions, 390 flow. Second operand 4 states and 605 transitions. [2025-01-10 01:16:39,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 361 transitions, 1308 flow [2025-01-10 01:16:39,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 361 transitions, 1304 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:39,988 INFO L231 Difference]: Finished difference. Result has 181 places, 185 transitions, 408 flow [2025-01-10 01:16:39,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=287, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=408, PETRI_PLACES=181, PETRI_TRANSITIONS=185} [2025-01-10 01:16:39,988 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -3 predicate places. [2025-01-10 01:16:39,988 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 185 transitions, 408 flow [2025-01-10 01:16:39,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:39,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:39,989 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:39,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:16:39,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2025-01-10 01:16:39,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash 689211243, now seen corresponding path program 1 times [2025-01-10 01:16:39,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:39,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102746007] [2025-01-10 01:16:39,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:39,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:39,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:16:40,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:16:40,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:40,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:40,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:16:40,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:16:40,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:16:40,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:40,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:40,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:16:40,036 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:16:40,036 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2025-01-10 01:16:40,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2025-01-10 01:16:40,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2025-01-10 01:16:40,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2025-01-10 01:16:40,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2025-01-10 01:16:40,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (26 of 32 remaining) [2025-01-10 01:16:40,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (25 of 32 remaining) [2025-01-10 01:16:40,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (24 of 32 remaining) [2025-01-10 01:16:40,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2025-01-10 01:16:40,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2025-01-10 01:16:40,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2025-01-10 01:16:40,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 32 remaining) [2025-01-10 01:16:40,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 32 remaining) [2025-01-10 01:16:40,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:16:40,037 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 01:16:40,038 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 01:16:40,038 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 01:16:40,126 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:16:40,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 401 transitions, 829 flow [2025-01-10 01:16:40,194 INFO L124 PetriNetUnfolderBase]: 229/662 cut-off events. [2025-01-10 01:16:40,194 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 01:16:40,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 662 events. 229/662 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3212 event pairs, 1 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 476. Up to 24 conditions per place. [2025-01-10 01:16:40,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 255 places, 401 transitions, 829 flow [2025-01-10 01:16:40,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 401 transitions, 829 flow [2025-01-10 01:16:40,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:40,216 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;@76174cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:40,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-01-10 01:16:40,217 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:40,217 INFO L124 PetriNetUnfolderBase]: 5/17 cut-off events. [2025-01-10 01:16:40,217 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:40,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:40,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:16:40,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:16:40,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:40,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1580515369, now seen corresponding path program 1 times [2025-01-10 01:16:40,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:40,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927900065] [2025-01-10 01:16:40,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:40,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:40,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:16:40,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:16:40,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:40,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:16:40,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:40,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927900065] [2025-01-10 01:16:40,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927900065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:40,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:40,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:16:40,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478725693] [2025-01-10 01:16:40,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:40,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 01:16:40,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:40,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 01:16:40,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:16:40,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 401 [2025-01-10 01:16:40,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 401 transitions, 829 flow. Second operand has 2 states, 2 states have (on average 111.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:40,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:40,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 401 [2025-01-10 01:16:40,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand