./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --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/weaver/parallel-ticket-4.wvr.c -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 ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:06:00,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:06:00,114 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:06:00,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:06:00,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:06:00,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:06:00,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:06:00,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:06:00,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:06:00,143 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:06:00,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:06:00,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:06:00,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:06:00,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:06:00,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:06:00,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:06:00,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:06:00,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:06:00,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:06:00,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:06:00,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:06:00,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:06:00,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:06:00,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:06:00,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:06:00,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:06:00,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:06:00,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:06:00,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:06:00,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:06:00,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:06:00,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:06:00,146 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 -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2025-01-10 01:06:00,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:06:00,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:06:00,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:06:00,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:06:00,387 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:06:00,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-01-10 01:06:01,517 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ed500e5a/116643900a1d40aab8359a752d97ab6c/FLAGd71b417d6 [2025-01-10 01:06:01,726 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:06:01,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-01-10 01:06:01,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ed500e5a/116643900a1d40aab8359a752d97ab6c/FLAGd71b417d6 [2025-01-10 01:06:02,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ed500e5a/116643900a1d40aab8359a752d97ab6c [2025-01-10 01:06:02,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:06:02,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:06:02,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:06:02,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:06:02,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:06:02,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:06:02" (1/1) ... [2025-01-10 01:06:02,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405d5fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:02, skipping insertion in model container [2025-01-10 01:06:02,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:06:02" (1/1) ... [2025-01-10 01:06:02,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:06:02,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:06:02,239 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:06:02,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:06:02,271 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:06:02,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:02 WrapperNode [2025-01-10 01:06:02,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:06:02,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:06:02,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:06:02,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:06:02,278 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:06:02" (1/1) ... [2025-01-10 01:06:02,285 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:06:02" (1/1) ... [2025-01-10 01:06:02,308 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 174 [2025-01-10 01:06:02,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:06:02,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:06:02,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:06:02,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:06:02,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:02" (1/1) ... [2025-01-10 01:06:02,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:02" (1/1) ... [2025-01-10 01:06:02,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:02" (1/1) ... [2025-01-10 01:06:02,346 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:06:02,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:02" (1/1) ... [2025-01-10 01:06:02,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:02" (1/1) ... [2025-01-10 01:06:02,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:02" (1/1) ... [2025-01-10 01:06:02,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:02" (1/1) ... [2025-01-10 01:06:02,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:02" (1/1) ... [2025-01-10 01:06:02,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:02" (1/1) ... [2025-01-10 01:06:02,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:02" (1/1) ... [2025-01-10 01:06:02,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:06:02,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:06:02,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:06:02,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:06:02,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:02" (1/1) ... [2025-01-10 01:06:02,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:06:02,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:06:02,402 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:06:02,409 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:06:02,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:06:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:06:02,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:06:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:06:02,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:06:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:06:02,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:06:02,431 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 01:06:02,431 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 01:06:02,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:06:02,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:06:02,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:06:02,432 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:06:02,507 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:06:02,508 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:06:02,706 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:06:02,707 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:06:02,808 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:06:02,808 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:06:02,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:06:02 BoogieIcfgContainer [2025-01-10 01:06:02,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:06:02,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:06:02,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:06:02,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:06:02,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:06:02" (1/3) ... [2025-01-10 01:06:02,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e010de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:06:02, skipping insertion in model container [2025-01-10 01:06:02,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:06:02" (2/3) ... [2025-01-10 01:06:02,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e010de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:06:02, skipping insertion in model container [2025-01-10 01:06:02,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:06:02" (3/3) ... [2025-01-10 01:06:02,818 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2025-01-10 01:06:02,829 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:06:02,831 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-10 01:06:02,831 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:06:02,894 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 01:06:02,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 61 transitions, 150 flow [2025-01-10 01:06:02,944 INFO L124 PetriNetUnfolderBase]: 3/57 cut-off events. [2025-01-10 01:06:02,946 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:06:02,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 57 events. 3/57 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-01-10 01:06:02,948 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 61 transitions, 150 flow [2025-01-10 01:06:02,951 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 56 transitions, 136 flow [2025-01-10 01:06:02,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:06:02,968 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;@4c82950e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:06:02,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:06:02,986 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:06:02,986 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2025-01-10 01:06:02,986 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:06:02,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:02,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:02,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:02,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:02,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1673393006, now seen corresponding path program 1 times [2025-01-10 01:06:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:02,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253383643] [2025-01-10 01:06:02,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:03,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:03,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:06:03,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:06:03,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:03,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:03,358 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:06:03,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:03,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253383643] [2025-01-10 01:06:03,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253383643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:03,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:03,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:06:03,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939065459] [2025-01-10 01:06:03,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:03,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:06:03,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:03,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:06:03,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:06:03,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2025-01-10 01:06:03,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:06:03,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:03,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2025-01-10 01:06:03,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:04,846 INFO L124 PetriNetUnfolderBase]: 12679/17507 cut-off events. [2025-01-10 01:06:04,847 INFO L125 PetriNetUnfolderBase]: For 1243/1243 co-relation queries the response was YES. [2025-01-10 01:06:04,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35337 conditions, 17507 events. 12679/17507 cut-off events. For 1243/1243 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 101536 event pairs, 4419 based on Foata normal form. 2/17033 useless extension candidates. Maximal degree in co-relation 32049. Up to 10696 conditions per place. [2025-01-10 01:06:04,967 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 59 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2025-01-10 01:06:04,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 338 flow [2025-01-10 01:06:04,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:06:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:06:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2025-01-10 01:06:04,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7158469945355191 [2025-01-10 01:06:04,980 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 136 flow. Second operand 3 states and 131 transitions. [2025-01-10 01:06:04,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 338 flow [2025-01-10 01:06:05,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 310 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:06:05,009 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2025-01-10 01:06:05,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-01-10 01:06:05,014 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2025-01-10 01:06:05,014 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2025-01-10 01:06:05,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:06:05,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:05,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:05,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:06:05,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:05,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2047081064, now seen corresponding path program 1 times [2025-01-10 01:06:05,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:05,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489882191] [2025-01-10 01:06:05,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:05,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:05,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:05,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:05,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:05,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:05,117 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:06:05,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:05,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489882191] [2025-01-10 01:06:05,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489882191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:05,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:05,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:06:05,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499235894] [2025-01-10 01:06:05,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:05,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:06:05,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:05,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:06:05,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:06:05,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-01-10 01:06:05,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:06:05,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:05,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-01-10 01:06:05,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:06,804 INFO L124 PetriNetUnfolderBase]: 21965/30404 cut-off events. [2025-01-10 01:06:06,806 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-01-10 01:06:06,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61554 conditions, 30404 events. 21965/30404 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 1155. Compared 181776 event pairs, 16979 based on Foata normal form. 0/29844 useless extension candidates. Maximal degree in co-relation 41623. Up to 26138 conditions per place. [2025-01-10 01:06:06,933 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 58 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2025-01-10 01:06:06,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 329 flow [2025-01-10 01:06:06,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:06:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:06:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2025-01-10 01:06:06,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.639344262295082 [2025-01-10 01:06:06,936 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 3 states and 117 transitions. [2025-01-10 01:06:06,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 329 flow [2025-01-10 01:06:06,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:06:06,939 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 196 flow [2025-01-10 01:06:06,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2025-01-10 01:06:06,941 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2025-01-10 01:06:06,941 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 196 flow [2025-01-10 01:06:06,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:06:06,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:06,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:06,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:06:06,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:06,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2121097810, now seen corresponding path program 1 times [2025-01-10 01:06:06,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:06,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176053079] [2025-01-10 01:06:06,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:06,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:06,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:06,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:06,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:06,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:07,204 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:06:07,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:07,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176053079] [2025-01-10 01:06:07,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176053079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:07,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:07,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:06:07,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479710842] [2025-01-10 01:06:07,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:07,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:06:07,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:07,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:06:07,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:06:07,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:07,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 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:06:07,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:07,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:07,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:08,729 INFO L124 PetriNetUnfolderBase]: 18572/28993 cut-off events. [2025-01-10 01:06:08,730 INFO L125 PetriNetUnfolderBase]: For 1566/1670 co-relation queries the response was YES. [2025-01-10 01:06:08,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59625 conditions, 28993 events. 18572/28993 cut-off events. For 1566/1670 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 225280 event pairs, 3513 based on Foata normal form. 358/27918 useless extension candidates. Maximal degree in co-relation 37875. Up to 9172 conditions per place. [2025-01-10 01:06:08,896 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 105 selfloop transitions, 41 changer transitions 1/172 dead transitions. [2025-01-10 01:06:08,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 172 transitions, 732 flow [2025-01-10 01:06:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:06:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:06:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 357 transitions. [2025-01-10 01:06:08,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2025-01-10 01:06:08,901 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 196 flow. Second operand 9 states and 357 transitions. [2025-01-10 01:06:08,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 172 transitions, 732 flow [2025-01-10 01:06:08,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 172 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:08,936 INFO L231 Difference]: Finished difference. Result has 71 places, 97 transitions, 366 flow [2025-01-10 01:06:08,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=366, PETRI_PLACES=71, PETRI_TRANSITIONS=97} [2025-01-10 01:06:08,936 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2025-01-10 01:06:08,937 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 97 transitions, 366 flow [2025-01-10 01:06:08,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 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:06:08,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:08,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:08,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:06:08,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:08,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1623899882, now seen corresponding path program 2 times [2025-01-10 01:06:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:08,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142682627] [2025-01-10 01:06:08,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:06:08,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:08,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:08,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:08,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:06:08,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:09,147 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:06:09,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:09,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142682627] [2025-01-10 01:06:09,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142682627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:09,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:09,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:06:09,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572992440] [2025-01-10 01:06:09,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:09,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:06:09,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:09,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:06:09,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:06:09,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:09,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 97 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:06:09,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:09,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:09,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:10,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [5#L100-4true, 30#L76-1true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 100#true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2025-01-10 01:06:10,895 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-10 01:06:10,895 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:10,895 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:10,895 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:10,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 7#L44-1true, 86#(<= (+ ~s~0 1) ~t~0), 46#L56-1true, 100#true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2025-01-10 01:06:10,895 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-10 01:06:10,896 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:10,896 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:10,896 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:11,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [30#L76-1true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 46#L56-1true, 43#L66-1true, 48#L101true, Black: 76#(= (mod ~b~0 256) 0)]) [2025-01-10 01:06:11,056 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,056 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,056 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,056 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 46#L56-1true, 48#L101true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2025-01-10 01:06:11,057 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,057 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,057 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,057 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 7#L44-1true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue]) [2025-01-10 01:06:11,057 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,057 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,057 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,057 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 46#L56-1true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2025-01-10 01:06:11,058 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,058 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,058 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,058 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [5#L100-4true, 30#L76-1true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2025-01-10 01:06:11,058 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,058 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,058 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,058 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 7#L44-1true, 86#(<= (+ ~s~0 1) ~t~0), 46#L56-1true, 100#true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2025-01-10 01:06:11,058 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,058 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,058 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,058 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:11,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 48#L101true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue]) [2025-01-10 01:06:11,192 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,192 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,192 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,192 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 100#true, 48#L101true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2025-01-10 01:06:11,192 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,192 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,192 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,192 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [30#L76-1true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 48#L101true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2025-01-10 01:06:11,192 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,192 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,192 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,192 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 46#L56-1true, 48#L101true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2025-01-10 01:06:11,192 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,192 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,193 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,193 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,193 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2025-01-10 01:06:11,193 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,193 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,193 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,193 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,193 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2025-01-10 01:06:11,193 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,193 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,193 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,193 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:11,426 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 48#L101true, 43#L66-1true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2025-01-10 01:06:11,426 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-10 01:06:11,426 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:11,426 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:11,426 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:11,426 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 48#L101true, Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue]) [2025-01-10 01:06:11,426 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-10 01:06:11,426 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:11,426 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:11,426 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:11,538 INFO L124 PetriNetUnfolderBase]: 31017/48718 cut-off events. [2025-01-10 01:06:11,538 INFO L125 PetriNetUnfolderBase]: For 23066/23594 co-relation queries the response was YES. [2025-01-10 01:06:11,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120023 conditions, 48718 events. 31017/48718 cut-off events. For 23066/23594 co-relation queries the response was YES. Maximal size of possible extension queue 2591. Compared 401587 event pairs, 7493 based on Foata normal form. 523/47334 useless extension candidates. Maximal degree in co-relation 77638. Up to 18165 conditions per place. [2025-01-10 01:06:11,765 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 104 selfloop transitions, 55 changer transitions 4/188 dead transitions. [2025-01-10 01:06:11,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 188 transitions, 998 flow [2025-01-10 01:06:11,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:06:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:06:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2025-01-10 01:06:11,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7147540983606557 [2025-01-10 01:06:11,768 INFO L175 Difference]: Start difference. First operand has 71 places, 97 transitions, 366 flow. Second operand 5 states and 218 transitions. [2025-01-10 01:06:11,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 188 transitions, 998 flow [2025-01-10 01:06:11,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 188 transitions, 991 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:06:11,877 INFO L231 Difference]: Finished difference. Result has 77 places, 134 transitions, 759 flow [2025-01-10 01:06:11,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=759, PETRI_PLACES=77, PETRI_TRANSITIONS=134} [2025-01-10 01:06:11,878 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2025-01-10 01:06:11,878 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 134 transitions, 759 flow [2025-01-10 01:06:11,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:06:11,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:11,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:11,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:06:11,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:11,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:11,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1796716772, now seen corresponding path program 1 times [2025-01-10 01:06:11,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:11,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500133495] [2025-01-10 01:06:11,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:06:11,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:11,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:11,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:11,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:11,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:12,058 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:06:12,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:12,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500133495] [2025-01-10 01:06:12,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500133495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:12,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:12,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:06:12,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773658908] [2025-01-10 01:06:12,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:12,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:06:12,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:12,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:06:12,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:06:12,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:12,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 134 transitions, 759 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:06:12,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:12,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:12,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:14,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 5#L100-4true, Black: 78#true, 7#L44-1true, 46#L56-1true]) [2025-01-10 01:06:14,102 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-10 01:06:14,102 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:14,102 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:14,102 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:14,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 5#L100-4true, Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true]) [2025-01-10 01:06:14,102 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-10 01:06:14,102 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:14,102 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:14,102 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:14,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 78#true, 7#L44-1true, 46#L56-1true, 48#L101true]) [2025-01-10 01:06:14,296 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,296 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,296 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,296 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 48#L101true]) [2025-01-10 01:06:14,296 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,296 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,296 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,296 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 5#L100-4true, Black: 78#true, 7#L44-1true]) [2025-01-10 01:06:14,296 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,296 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,296 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,296 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 5#L100-4true, Black: 78#true, 7#L44-1true, 46#L56-1true]) [2025-01-10 01:06:14,297 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,297 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,297 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,297 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 5#L100-4true, Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true]) [2025-01-10 01:06:14,297 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,297 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,297 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,297 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 5#L100-4true, Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true]) [2025-01-10 01:06:14,297 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,297 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,297 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,297 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:14,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, Black: 78#true, 7#L44-1true, 48#L101true]) [2025-01-10 01:06:14,444 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 7#L44-1true, 46#L56-1true, 48#L101true]) [2025-01-10 01:06:14,444 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 48#L101true]) [2025-01-10 01:06:14,444 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 48#L101true]) [2025-01-10 01:06:14,444 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,444 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, 5#L100-4true, Black: 78#true, 7#L44-1true]) [2025-01-10 01:06:14,445 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,445 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,445 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,445 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, Black: 103#(<= (+ ~s~0 1) ~t~0), 5#L100-4true, Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true]) [2025-01-10 01:06:14,445 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,445 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,445 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,445 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:14,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 7#L44-1true, 48#L101true]) [2025-01-10 01:06:14,717 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-10 01:06:14,717 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:14,717 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:14,717 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:14,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 48#L101true]) [2025-01-10 01:06:14,717 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-10 01:06:14,717 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:14,717 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:14,717 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:14,836 INFO L124 PetriNetUnfolderBase]: 28896/45634 cut-off events. [2025-01-10 01:06:14,836 INFO L125 PetriNetUnfolderBase]: For 66816/68251 co-relation queries the response was YES. [2025-01-10 01:06:14,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139415 conditions, 45634 events. 28896/45634 cut-off events. For 66816/68251 co-relation queries the response was YES. Maximal size of possible extension queue 2401. Compared 374953 event pairs, 7274 based on Foata normal form. 952/44887 useless extension candidates. Maximal degree in co-relation 86598. Up to 17640 conditions per place. [2025-01-10 01:06:15,088 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 107 selfloop transitions, 68 changer transitions 0/200 dead transitions. [2025-01-10 01:06:15,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 200 transitions, 1397 flow [2025-01-10 01:06:15,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:06:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:06:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2025-01-10 01:06:15,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7114754098360656 [2025-01-10 01:06:15,090 INFO L175 Difference]: Start difference. First operand has 77 places, 134 transitions, 759 flow. Second operand 5 states and 217 transitions. [2025-01-10 01:06:15,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 200 transitions, 1397 flow [2025-01-10 01:06:15,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 200 transitions, 1382 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-01-10 01:06:15,229 INFO L231 Difference]: Finished difference. Result has 82 places, 147 transitions, 1057 flow [2025-01-10 01:06:15,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1057, PETRI_PLACES=82, PETRI_TRANSITIONS=147} [2025-01-10 01:06:15,232 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places. [2025-01-10 01:06:15,232 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 147 transitions, 1057 flow [2025-01-10 01:06:15,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:06:15,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:15,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:15,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:06:15,233 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:15,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:15,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1269143448, now seen corresponding path program 3 times [2025-01-10 01:06:15,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:15,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234748432] [2025-01-10 01:06:15,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:06:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:15,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:15,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:15,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:06:15,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:06:15,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:15,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234748432] [2025-01-10 01:06:15,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234748432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:15,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:15,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:06:15,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327067714] [2025-01-10 01:06:15,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:15,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:06:15,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:15,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:06:15,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:06:15,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:15,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 147 transitions, 1057 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 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:06:15,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:15,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:15,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:17,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true]) [2025-01-10 01:06:17,513 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-10 01:06:17,513 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:17,513 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:17,513 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:17,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 48#L101true]) [2025-01-10 01:06:17,928 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:17,928 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:17,928 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:17,928 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:17,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true]) [2025-01-10 01:06:17,928 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:17,928 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:17,928 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:17,929 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:17,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true]) [2025-01-10 01:06:17,929 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:17,929 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:17,929 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:17,929 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:18,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 48#L101true]) [2025-01-10 01:06:18,102 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:18,102 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:18,102 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:18,102 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:18,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 48#L101true]) [2025-01-10 01:06:18,102 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:18,102 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:18,102 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:18,102 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:18,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true]) [2025-01-10 01:06:18,103 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:18,103 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:18,103 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:18,103 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:18,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 48#L101true]) [2025-01-10 01:06:18,236 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-10 01:06:18,236 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:18,236 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:18,236 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:18,441 INFO L124 PetriNetUnfolderBase]: 32470/50995 cut-off events. [2025-01-10 01:06:18,441 INFO L125 PetriNetUnfolderBase]: For 103810/106170 co-relation queries the response was YES. [2025-01-10 01:06:18,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169020 conditions, 50995 events. 32470/50995 cut-off events. For 103810/106170 co-relation queries the response was YES. Maximal size of possible extension queue 2826. Compared 425346 event pairs, 6385 based on Foata normal form. 1598/50204 useless extension candidates. Maximal degree in co-relation 105849. Up to 17284 conditions per place. [2025-01-10 01:06:18,924 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 107 selfloop transitions, 106 changer transitions 4/242 dead transitions. [2025-01-10 01:06:18,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 242 transitions, 1922 flow [2025-01-10 01:06:18,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:06:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:06:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 263 transitions. [2025-01-10 01:06:18,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7185792349726776 [2025-01-10 01:06:18,926 INFO L175 Difference]: Start difference. First operand has 82 places, 147 transitions, 1057 flow. Second operand 6 states and 263 transitions. [2025-01-10 01:06:18,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 242 transitions, 1922 flow [2025-01-10 01:06:19,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 242 transitions, 1836 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:19,036 INFO L231 Difference]: Finished difference. Result has 87 places, 175 transitions, 1487 flow [2025-01-10 01:06:19,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1487, PETRI_PLACES=87, PETRI_TRANSITIONS=175} [2025-01-10 01:06:19,037 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 21 predicate places. [2025-01-10 01:06:19,037 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 175 transitions, 1487 flow [2025-01-10 01:06:19,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 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:06:19,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:19,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:19,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:06:19,037 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:19,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:19,038 INFO L85 PathProgramCache]: Analyzing trace with hash -549382550, now seen corresponding path program 4 times [2025-01-10 01:06:19,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:19,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402176349] [2025-01-10 01:06:19,038 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:06:19,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:19,045 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-01-10 01:06:19,061 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:19,061 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:06:19,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:19,224 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:06:19,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:19,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402176349] [2025-01-10 01:06:19,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402176349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:19,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:19,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:06:19,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117269969] [2025-01-10 01:06:19,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:19,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:06:19,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:19,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:06:19,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:06:19,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:19,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 175 transitions, 1487 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:06:19,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:19,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:19,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:21,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2025-01-10 01:06:21,489 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-10 01:06:21,489 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:21,489 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:21,489 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:06:21,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 129#true, 121#(<= ~s~0 ~t~0), Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2025-01-10 01:06:21,743 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,743 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,743 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,743 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 48#L101true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2025-01-10 01:06:21,808 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,808 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,808 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,808 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2025-01-10 01:06:21,808 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,809 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,809 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,809 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2025-01-10 01:06:21,809 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,809 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,809 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:21,809 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:06:22,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 48#L101true, 129#true, 121#(<= ~s~0 ~t~0), Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2025-01-10 01:06:22,178 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,178 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,178 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,178 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 86#(<= (+ ~s~0 1) ~t~0), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 52#thread2EXITtrue, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 129#true, 121#(<= ~s~0 ~t~0), Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2025-01-10 01:06:22,179 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,179 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,179 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,179 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,213 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 48#L101true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2025-01-10 01:06:22,213 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,213 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,213 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,213 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 48#L101true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2025-01-10 01:06:22,214 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,214 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,214 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,214 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2025-01-10 01:06:22,214 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,214 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,214 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,214 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-01-10 01:06:22,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 52#thread2EXITtrue, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 48#L101true, 129#true, 121#(<= ~s~0 ~t~0), Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2025-01-10 01:06:22,368 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-10 01:06:22,368 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:22,368 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:22,368 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:22,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 52#thread2EXITtrue, 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 48#L101true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2025-01-10 01:06:22,392 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-01-10 01:06:22,392 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:22,393 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:22,393 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:06:22,621 INFO L124 PetriNetUnfolderBase]: 31732/50984 cut-off events. [2025-01-10 01:06:22,621 INFO L125 PetriNetUnfolderBase]: For 160612/162633 co-relation queries the response was YES. [2025-01-10 01:06:22,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178792 conditions, 50984 events. 31732/50984 cut-off events. For 160612/162633 co-relation queries the response was YES. Maximal size of possible extension queue 2813. Compared 436801 event pairs, 8150 based on Foata normal form. 1179/50388 useless extension candidates. Maximal degree in co-relation 111148. Up to 23495 conditions per place. [2025-01-10 01:06:22,941 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 124 selfloop transitions, 85 changer transitions 12/246 dead transitions. [2025-01-10 01:06:22,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 246 transitions, 2344 flow [2025-01-10 01:06:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:06:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:06:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2025-01-10 01:06:22,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7180327868852459 [2025-01-10 01:06:22,942 INFO L175 Difference]: Start difference. First operand has 87 places, 175 transitions, 1487 flow. Second operand 5 states and 219 transitions. [2025-01-10 01:06:22,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 246 transitions, 2344 flow [2025-01-10 01:06:23,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 246 transitions, 2275 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:23,208 INFO L231 Difference]: Finished difference. Result has 91 places, 185 transitions, 1807 flow [2025-01-10 01:06:23,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1807, PETRI_PLACES=91, PETRI_TRANSITIONS=185} [2025-01-10 01:06:23,209 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 25 predicate places. [2025-01-10 01:06:23,209 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 185 transitions, 1807 flow [2025-01-10 01:06:23,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:06:23,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:23,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:23,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:06:23,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:23,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:23,210 INFO L85 PathProgramCache]: Analyzing trace with hash -954436072, now seen corresponding path program 5 times [2025-01-10 01:06:23,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:23,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778982828] [2025-01-10 01:06:23,210 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:06:23,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:23,224 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:23,231 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:23,231 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:06:23,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:23,352 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:06:23,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:23,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778982828] [2025-01-10 01:06:23,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778982828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:23,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:23,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:06:23,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911354875] [2025-01-10 01:06:23,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:23,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:06:23,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:23,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:06:23,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:06:23,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:23,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 185 transitions, 1807 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:06:23,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:23,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:23,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:25,542 INFO L124 PetriNetUnfolderBase]: 20188/32574 cut-off events. [2025-01-10 01:06:25,543 INFO L125 PetriNetUnfolderBase]: For 112813/114709 co-relation queries the response was YES. [2025-01-10 01:06:25,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115542 conditions, 32574 events. 20188/32574 cut-off events. For 112813/114709 co-relation queries the response was YES. Maximal size of possible extension queue 1796. Compared 263247 event pairs, 5504 based on Foata normal form. 1250/32730 useless extension candidates. Maximal degree in co-relation 89605. Up to 16794 conditions per place. [2025-01-10 01:06:25,730 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 116 selfloop transitions, 91 changer transitions 5/237 dead transitions. [2025-01-10 01:06:25,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 237 transitions, 2473 flow [2025-01-10 01:06:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:06:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:06:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2025-01-10 01:06:25,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7081967213114754 [2025-01-10 01:06:25,731 INFO L175 Difference]: Start difference. First operand has 91 places, 185 transitions, 1807 flow. Second operand 5 states and 216 transitions. [2025-01-10 01:06:25,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 237 transitions, 2473 flow [2025-01-10 01:06:25,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 237 transitions, 2372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:25,843 INFO L231 Difference]: Finished difference. Result has 95 places, 189 transitions, 2039 flow [2025-01-10 01:06:25,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2039, PETRI_PLACES=95, PETRI_TRANSITIONS=189} [2025-01-10 01:06:25,844 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 29 predicate places. [2025-01-10 01:06:25,845 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 189 transitions, 2039 flow [2025-01-10 01:06:25,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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:06:25,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:25,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:25,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:06:25,846 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:25,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:25,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1362432530, now seen corresponding path program 6 times [2025-01-10 01:06:25,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:25,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272433388] [2025-01-10 01:06:25,846 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:06:25,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:25,854 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:25,860 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:25,861 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 01:06:25,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:25,986 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:06:25,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:25,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272433388] [2025-01-10 01:06:25,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272433388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:25,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:25,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:06:25,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909045361] [2025-01-10 01:06:25,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:25,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:06:25,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:25,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:06:25,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:06:25,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:25,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 189 transitions, 2039 flow. Second operand has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 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:06:25,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:25,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:25,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:28,427 INFO L124 PetriNetUnfolderBase]: 20016/32104 cut-off events. [2025-01-10 01:06:28,428 INFO L125 PetriNetUnfolderBase]: For 133745/136146 co-relation queries the response was YES. [2025-01-10 01:06:28,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120084 conditions, 32104 events. 20016/32104 cut-off events. For 133745/136146 co-relation queries the response was YES. Maximal size of possible extension queue 1742. Compared 258284 event pairs, 4419 based on Foata normal form. 1070/31811 useless extension candidates. Maximal degree in co-relation 94070. Up to 9636 conditions per place. [2025-01-10 01:06:28,603 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 120 selfloop transitions, 127 changer transitions 3/275 dead transitions. [2025-01-10 01:06:28,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 275 transitions, 2941 flow [2025-01-10 01:06:28,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:06:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:06:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 334 transitions. [2025-01-10 01:06:28,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6844262295081968 [2025-01-10 01:06:28,604 INFO L175 Difference]: Start difference. First operand has 95 places, 189 transitions, 2039 flow. Second operand 8 states and 334 transitions. [2025-01-10 01:06:28,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 275 transitions, 2941 flow [2025-01-10 01:06:28,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 275 transitions, 2828 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:06:28,692 INFO L231 Difference]: Finished difference. Result has 102 places, 196 transitions, 2333 flow [2025-01-10 01:06:28,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2333, PETRI_PLACES=102, PETRI_TRANSITIONS=196} [2025-01-10 01:06:28,693 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 36 predicate places. [2025-01-10 01:06:28,693 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 196 transitions, 2333 flow [2025-01-10 01:06:28,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 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:06:28,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:28,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:28,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:06:28,694 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:28,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1223545596, now seen corresponding path program 2 times [2025-01-10 01:06:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:28,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952042234] [2025-01-10 01:06:28,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:06:28,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:28,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:28,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:28,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:06:28,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:28,795 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:06:28,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:28,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952042234] [2025-01-10 01:06:28,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952042234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:28,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:28,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:06:28,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991293530] [2025-01-10 01:06:28,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:28,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:06:28,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:28,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:06:28,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:06:28,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:28,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 196 transitions, 2333 flow. Second operand has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 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:06:28,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:28,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:28,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:31,478 INFO L124 PetriNetUnfolderBase]: 19436/31706 cut-off events. [2025-01-10 01:06:31,479 INFO L125 PetriNetUnfolderBase]: For 161120/162912 co-relation queries the response was YES. [2025-01-10 01:06:31,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123993 conditions, 31706 events. 19436/31706 cut-off events. For 161120/162912 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 259374 event pairs, 4258 based on Foata normal form. 1119/31570 useless extension candidates. Maximal degree in co-relation 97513. Up to 9533 conditions per place. [2025-01-10 01:06:31,656 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 122 selfloop transitions, 139 changer transitions 26/312 dead transitions. [2025-01-10 01:06:31,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 312 transitions, 3738 flow [2025-01-10 01:06:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:06:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:06:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 340 transitions. [2025-01-10 01:06:31,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6967213114754098 [2025-01-10 01:06:31,657 INFO L175 Difference]: Start difference. First operand has 102 places, 196 transitions, 2333 flow. Second operand 8 states and 340 transitions. [2025-01-10 01:06:31,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 312 transitions, 3738 flow [2025-01-10 01:06:31,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 312 transitions, 3515 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-01-10 01:06:31,763 INFO L231 Difference]: Finished difference. Result has 107 places, 207 transitions, 2653 flow [2025-01-10 01:06:31,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2653, PETRI_PLACES=107, PETRI_TRANSITIONS=207} [2025-01-10 01:06:31,764 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 41 predicate places. [2025-01-10 01:06:31,764 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 207 transitions, 2653 flow [2025-01-10 01:06:31,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 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:06:31,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:31,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:31,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:06:31,764 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:31,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:31,764 INFO L85 PathProgramCache]: Analyzing trace with hash -188279710, now seen corresponding path program 7 times [2025-01-10 01:06:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:31,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085629377] [2025-01-10 01:06:31,764 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:06:31,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:31,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:31,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:31,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:06:31,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:31,848 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:06:31,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:31,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085629377] [2025-01-10 01:06:31,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085629377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:31,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:31,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:06:31,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065343255] [2025-01-10 01:06:31,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:31,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:06:31,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:31,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:06:31,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:06:31,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:31,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 207 transitions, 2653 flow. Second operand has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 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:06:31,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:31,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:31,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:33,666 INFO L124 PetriNetUnfolderBase]: 13479/22218 cut-off events. [2025-01-10 01:06:33,666 INFO L125 PetriNetUnfolderBase]: For 107050/108086 co-relation queries the response was YES. [2025-01-10 01:06:33,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86331 conditions, 22218 events. 13479/22218 cut-off events. For 107050/108086 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 173182 event pairs, 3104 based on Foata normal form. 828/22416 useless extension candidates. Maximal degree in co-relation 71313. Up to 6362 conditions per place. [2025-01-10 01:06:33,778 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 112 selfloop transitions, 138 changer transitions 35/309 dead transitions. [2025-01-10 01:06:33,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 309 transitions, 3930 flow [2025-01-10 01:06:33,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:06:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:06:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 336 transitions. [2025-01-10 01:06:33,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2025-01-10 01:06:33,779 INFO L175 Difference]: Start difference. First operand has 107 places, 207 transitions, 2653 flow. Second operand 8 states and 336 transitions. [2025-01-10 01:06:33,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 309 transitions, 3930 flow [2025-01-10 01:06:33,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 309 transitions, 3783 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:06:33,860 INFO L231 Difference]: Finished difference. Result has 113 places, 202 transitions, 2782 flow [2025-01-10 01:06:33,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2782, PETRI_PLACES=113, PETRI_TRANSITIONS=202} [2025-01-10 01:06:33,861 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 47 predicate places. [2025-01-10 01:06:33,861 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 202 transitions, 2782 flow [2025-01-10 01:06:33,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 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:06:33,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:33,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:33,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:06:33,861 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:33,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:33,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1533324864, now seen corresponding path program 8 times [2025-01-10 01:06:33,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:33,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048944824] [2025-01-10 01:06:33,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:06:33,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:33,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:33,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:33,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:06:33,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:33,960 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:06:33,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:33,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048944824] [2025-01-10 01:06:33,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048944824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:33,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:33,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:06:33,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809447021] [2025-01-10 01:06:33,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:33,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:06:33,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:33,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:06:33,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:06:33,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:33,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 202 transitions, 2782 flow. Second operand has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 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:06:33,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:33,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:33,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:35,742 INFO L124 PetriNetUnfolderBase]: 12276/20093 cut-off events. [2025-01-10 01:06:35,742 INFO L125 PetriNetUnfolderBase]: For 115673/116505 co-relation queries the response was YES. [2025-01-10 01:06:35,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79234 conditions, 20093 events. 12276/20093 cut-off events. For 115673/116505 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 154596 event pairs, 2977 based on Foata normal form. 598/20064 useless extension candidates. Maximal degree in co-relation 64394. Up to 7290 conditions per place. [2025-01-10 01:06:35,879 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 100 selfloop transitions, 138 changer transitions 31/293 dead transitions. [2025-01-10 01:06:35,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 293 transitions, 3831 flow [2025-01-10 01:06:35,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:06:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:06:35,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 357 transitions. [2025-01-10 01:06:35,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2025-01-10 01:06:35,880 INFO L175 Difference]: Start difference. First operand has 113 places, 202 transitions, 2782 flow. Second operand 9 states and 357 transitions. [2025-01-10 01:06:35,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 293 transitions, 3831 flow [2025-01-10 01:06:35,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 293 transitions, 3699 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:06:35,984 INFO L231 Difference]: Finished difference. Result has 119 places, 191 transitions, 2738 flow [2025-01-10 01:06:35,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2738, PETRI_PLACES=119, PETRI_TRANSITIONS=191} [2025-01-10 01:06:35,985 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 53 predicate places. [2025-01-10 01:06:35,986 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 191 transitions, 2738 flow [2025-01-10 01:06:35,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 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:06:35,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:35,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:35,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:06:35,986 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:35,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:35,986 INFO L85 PathProgramCache]: Analyzing trace with hash -216172402, now seen corresponding path program 9 times [2025-01-10 01:06:35,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:35,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779539059] [2025-01-10 01:06:35,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:06:35,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:35,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:35,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:35,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:06:35,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:36,122 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:06:36,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:36,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779539059] [2025-01-10 01:06:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779539059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:36,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:36,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:06:36,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630596457] [2025-01-10 01:06:36,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:36,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:06:36,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:36,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:06:36,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:06:36,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:36,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 191 transitions, 2738 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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:06:36,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:36,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:36,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:37,673 INFO L124 PetriNetUnfolderBase]: 11650/19000 cut-off events. [2025-01-10 01:06:37,673 INFO L125 PetriNetUnfolderBase]: For 130698/131584 co-relation queries the response was YES. [2025-01-10 01:06:37,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77039 conditions, 19000 events. 11650/19000 cut-off events. For 130698/131584 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 144267 event pairs, 2887 based on Foata normal form. 586/18902 useless extension candidates. Maximal degree in co-relation 62033. Up to 7029 conditions per place. [2025-01-10 01:06:37,824 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 110 selfloop transitions, 136 changer transitions 18/288 dead transitions. [2025-01-10 01:06:37,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 288 transitions, 3743 flow [2025-01-10 01:06:37,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:06:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:06:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 447 transitions. [2025-01-10 01:06:37,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.610655737704918 [2025-01-10 01:06:37,826 INFO L175 Difference]: Start difference. First operand has 119 places, 191 transitions, 2738 flow. Second operand 12 states and 447 transitions. [2025-01-10 01:06:37,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 288 transitions, 3743 flow [2025-01-10 01:06:37,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 288 transitions, 3559 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-10 01:06:37,950 INFO L231 Difference]: Finished difference. Result has 127 places, 190 transitions, 2782 flow [2025-01-10 01:06:37,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2782, PETRI_PLACES=127, PETRI_TRANSITIONS=190} [2025-01-10 01:06:37,951 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 61 predicate places. [2025-01-10 01:06:37,951 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 190 transitions, 2782 flow [2025-01-10 01:06:37,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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:06:37,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:37,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:37,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:06:37,951 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:37,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash 402497868, now seen corresponding path program 10 times [2025-01-10 01:06:37,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:37,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569711889] [2025-01-10 01:06:37,952 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:06:37,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:37,959 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-01-10 01:06:37,968 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:37,968 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:06:37,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:38,115 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:06:38,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:38,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569711889] [2025-01-10 01:06:38,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569711889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:38,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:38,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:06:38,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516480940] [2025-01-10 01:06:38,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:38,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:06:38,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:38,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:06:38,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:06:38,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:38,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 190 transitions, 2782 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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:06:38,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:38,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:38,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:39,626 INFO L124 PetriNetUnfolderBase]: 11585/19081 cut-off events. [2025-01-10 01:06:39,626 INFO L125 PetriNetUnfolderBase]: For 148290/149024 co-relation queries the response was YES. [2025-01-10 01:06:39,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78441 conditions, 19081 events. 11585/19081 cut-off events. For 148290/149024 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 146947 event pairs, 3088 based on Foata normal form. 414/18857 useless extension candidates. Maximal degree in co-relation 62931. Up to 7026 conditions per place. [2025-01-10 01:06:39,771 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 94 selfloop transitions, 128 changer transitions 50/296 dead transitions. [2025-01-10 01:06:39,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 296 transitions, 3955 flow [2025-01-10 01:06:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:06:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:06:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 450 transitions. [2025-01-10 01:06:39,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6147540983606558 [2025-01-10 01:06:39,772 INFO L175 Difference]: Start difference. First operand has 127 places, 190 transitions, 2782 flow. Second operand 12 states and 450 transitions. [2025-01-10 01:06:39,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 296 transitions, 3955 flow [2025-01-10 01:06:39,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 296 transitions, 3697 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-01-10 01:06:39,895 INFO L231 Difference]: Finished difference. Result has 132 places, 181 transitions, 2659 flow [2025-01-10 01:06:39,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2659, PETRI_PLACES=132, PETRI_TRANSITIONS=181} [2025-01-10 01:06:39,895 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 66 predicate places. [2025-01-10 01:06:39,895 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 181 transitions, 2659 flow [2025-01-10 01:06:39,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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:06:39,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:39,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:39,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:06:39,896 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:39,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:39,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1139244856, now seen corresponding path program 3 times [2025-01-10 01:06:39,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:39,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614558366] [2025-01-10 01:06:39,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:06:39,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:39,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:39,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:39,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:06:39,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:39,982 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:06:39,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:39,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614558366] [2025-01-10 01:06:39,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614558366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:39,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:39,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:06:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881668315] [2025-01-10 01:06:39,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:39,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:06:39,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:39,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:06:39,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:06:39,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:39,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 181 transitions, 2659 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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:06:39,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:39,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:39,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:41,340 INFO L124 PetriNetUnfolderBase]: 11390/18742 cut-off events. [2025-01-10 01:06:41,340 INFO L125 PetriNetUnfolderBase]: For 150461/151463 co-relation queries the response was YES. [2025-01-10 01:06:41,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77859 conditions, 18742 events. 11390/18742 cut-off events. For 150461/151463 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 144060 event pairs, 3028 based on Foata normal form. 614/18739 useless extension candidates. Maximal degree in co-relation 62517. Up to 6968 conditions per place. [2025-01-10 01:06:41,470 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 103 selfloop transitions, 128 changer transitions 33/288 dead transitions. [2025-01-10 01:06:41,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 288 transitions, 3830 flow [2025-01-10 01:06:41,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:06:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:06:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 450 transitions. [2025-01-10 01:06:41,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6147540983606558 [2025-01-10 01:06:41,476 INFO L175 Difference]: Start difference. First operand has 132 places, 181 transitions, 2659 flow. Second operand 12 states and 450 transitions. [2025-01-10 01:06:41,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 288 transitions, 3830 flow [2025-01-10 01:06:41,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 288 transitions, 3530 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-01-10 01:06:41,616 INFO L231 Difference]: Finished difference. Result has 133 places, 180 transitions, 2605 flow [2025-01-10 01:06:41,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2401, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2605, PETRI_PLACES=133, PETRI_TRANSITIONS=180} [2025-01-10 01:06:41,617 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 67 predicate places. [2025-01-10 01:06:41,617 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 180 transitions, 2605 flow [2025-01-10 01:06:41,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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:06:41,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:41,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:41,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:06:41,617 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:41,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:41,618 INFO L85 PathProgramCache]: Analyzing trace with hash -144556386, now seen corresponding path program 11 times [2025-01-10 01:06:41,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:41,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929228415] [2025-01-10 01:06:41,618 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:06:41,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:41,625 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:41,628 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:41,628 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:06:41,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:41,691 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:06:41,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:41,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929228415] [2025-01-10 01:06:41,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929228415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:41,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:41,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:06:41,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596613032] [2025-01-10 01:06:41,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:41,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:06:41,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:41,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:06:41,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:06:41,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:41,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 180 transitions, 2605 flow. Second operand has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 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:06:41,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:41,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:41,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:43,073 INFO L124 PetriNetUnfolderBase]: 9120/15023 cut-off events. [2025-01-10 01:06:43,073 INFO L125 PetriNetUnfolderBase]: For 114984/115887 co-relation queries the response was YES. [2025-01-10 01:06:43,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61552 conditions, 15023 events. 9120/15023 cut-off events. For 114984/115887 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 112163 event pairs, 2708 based on Foata normal form. 428/15066 useless extension candidates. Maximal degree in co-relation 49701. Up to 5982 conditions per place. [2025-01-10 01:06:43,179 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 84 selfloop transitions, 117 changer transitions 15/232 dead transitions. [2025-01-10 01:06:43,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 232 transitions, 3269 flow [2025-01-10 01:06:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:06:43,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:06:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 335 transitions. [2025-01-10 01:06:43,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6102003642987249 [2025-01-10 01:06:43,180 INFO L175 Difference]: Start difference. First operand has 133 places, 180 transitions, 2605 flow. Second operand 9 states and 335 transitions. [2025-01-10 01:06:43,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 232 transitions, 3269 flow [2025-01-10 01:06:43,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 232 transitions, 3220 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:06:43,313 INFO L231 Difference]: Finished difference. Result has 138 places, 160 transitions, 2494 flow [2025-01-10 01:06:43,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2433, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2494, PETRI_PLACES=138, PETRI_TRANSITIONS=160} [2025-01-10 01:06:43,314 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 72 predicate places. [2025-01-10 01:06:43,314 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 160 transitions, 2494 flow [2025-01-10 01:06:43,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 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:06:43,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:43,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:43,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:06:43,314 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:43,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:43,315 INFO L85 PathProgramCache]: Analyzing trace with hash 83814646, now seen corresponding path program 2 times [2025-01-10 01:06:43,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:43,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222641806] [2025-01-10 01:06:43,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:06:43,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:43,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:43,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:43,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:06:43,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:43,416 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:06:43,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:43,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222641806] [2025-01-10 01:06:43,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222641806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:43,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:43,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:06:43,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554212764] [2025-01-10 01:06:43,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:43,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:06:43,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:43,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:06:43,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:06:43,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:43,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 160 transitions, 2494 flow. Second operand has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 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:06:43,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:43,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:43,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:44,080 INFO L124 PetriNetUnfolderBase]: 4469/7714 cut-off events. [2025-01-10 01:06:44,081 INFO L125 PetriNetUnfolderBase]: For 55316/55744 co-relation queries the response was YES. [2025-01-10 01:06:44,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31704 conditions, 7714 events. 4469/7714 cut-off events. For 55316/55744 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 53068 event pairs, 1314 based on Foata normal form. 430/8057 useless extension candidates. Maximal degree in co-relation 13722. Up to 1917 conditions per place. [2025-01-10 01:06:44,116 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 59 selfloop transitions, 26 changer transitions 109/210 dead transitions. [2025-01-10 01:06:44,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 210 transitions, 2890 flow [2025-01-10 01:06:44,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:06:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:06:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 322 transitions. [2025-01-10 01:06:44,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6598360655737705 [2025-01-10 01:06:44,117 INFO L175 Difference]: Start difference. First operand has 138 places, 160 transitions, 2494 flow. Second operand 8 states and 322 transitions. [2025-01-10 01:06:44,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 210 transitions, 2890 flow [2025-01-10 01:06:44,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 210 transitions, 2739 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-01-10 01:06:44,167 INFO L231 Difference]: Finished difference. Result has 141 places, 71 transitions, 723 flow [2025-01-10 01:06:44,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2034, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=723, PETRI_PLACES=141, PETRI_TRANSITIONS=71} [2025-01-10 01:06:44,167 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 75 predicate places. [2025-01-10 01:06:44,167 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 71 transitions, 723 flow [2025-01-10 01:06:44,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 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:06:44,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:44,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:44,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:06:44,168 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:44,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash -808885638, now seen corresponding path program 3 times [2025-01-10 01:06:44,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:44,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683067167] [2025-01-10 01:06:44,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:06:44,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:44,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:06:44,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:44,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:06:44,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:44,240 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:06:44,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:44,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683067167] [2025-01-10 01:06:44,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683067167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:44,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:44,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:06:44,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193355530] [2025-01-10 01:06:44,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:44,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:06:44,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:44,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:06:44,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:06:44,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:44,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 71 transitions, 723 flow. Second operand has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 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:06:44,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:44,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:44,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:44,433 INFO L124 PetriNetUnfolderBase]: 867/1535 cut-off events. [2025-01-10 01:06:44,434 INFO L125 PetriNetUnfolderBase]: For 7537/7561 co-relation queries the response was YES. [2025-01-10 01:06:44,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5307 conditions, 1535 events. 867/1535 cut-off events. For 7537/7561 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7482 event pairs, 156 based on Foata normal form. 48/1561 useless extension candidates. Maximal degree in co-relation 3035. Up to 578 conditions per place. [2025-01-10 01:06:44,444 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 51 selfloop transitions, 18 changer transitions 21/106 dead transitions. [2025-01-10 01:06:44,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 106 transitions, 1042 flow [2025-01-10 01:06:44,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:06:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:06:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 271 transitions. [2025-01-10 01:06:44,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.555327868852459 [2025-01-10 01:06:44,446 INFO L175 Difference]: Start difference. First operand has 141 places, 71 transitions, 723 flow. Second operand 8 states and 271 transitions. [2025-01-10 01:06:44,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 106 transitions, 1042 flow [2025-01-10 01:06:44,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 106 transitions, 705 flow, removed 47 selfloop flow, removed 41 redundant places. [2025-01-10 01:06:44,452 INFO L231 Difference]: Finished difference. Result has 95 places, 59 transitions, 325 flow [2025-01-10 01:06:44,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=325, PETRI_PLACES=95, PETRI_TRANSITIONS=59} [2025-01-10 01:06:44,453 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 29 predicate places. [2025-01-10 01:06:44,453 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 59 transitions, 325 flow [2025-01-10 01:06:44,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 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:06:44,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:06:44,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:06:44,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:06:44,453 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:06:44,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:06:44,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1638228514, now seen corresponding path program 4 times [2025-01-10 01:06:44,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:06:44,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39856122] [2025-01-10 01:06:44,454 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:06:44,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:06:44,458 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-01-10 01:06:44,462 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:06:44,462 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:06:44,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:06:44,571 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:06:44,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:06:44,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39856122] [2025-01-10 01:06:44,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39856122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:06:44,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:06:44,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:06:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784512912] [2025-01-10 01:06:44,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:06:44,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:06:44,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:06:44,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:06:44,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:06:44,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2025-01-10 01:06:44,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 59 transitions, 325 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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:06:44,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:06:44,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2025-01-10 01:06:44,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:06:44,699 INFO L124 PetriNetUnfolderBase]: 221/441 cut-off events. [2025-01-10 01:06:44,699 INFO L125 PetriNetUnfolderBase]: For 902/902 co-relation queries the response was YES. [2025-01-10 01:06:44,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1273 conditions, 441 events. 221/441 cut-off events. For 902/902 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1380 event pairs, 36 based on Foata normal form. 16/455 useless extension candidates. Maximal degree in co-relation 756. Up to 138 conditions per place. [2025-01-10 01:06:44,700 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 0 selfloop transitions, 0 changer transitions 76/76 dead transitions. [2025-01-10 01:06:44,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 76 transitions, 490 flow [2025-01-10 01:06:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:06:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:06:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 272 transitions. [2025-01-10 01:06:44,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49544626593806923 [2025-01-10 01:06:44,701 INFO L175 Difference]: Start difference. First operand has 95 places, 59 transitions, 325 flow. Second operand 9 states and 272 transitions. [2025-01-10 01:06:44,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 76 transitions, 490 flow [2025-01-10 01:06:44,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 385 flow, removed 4 selfloop flow, removed 23 redundant places. [2025-01-10 01:06:44,702 INFO L231 Difference]: Finished difference. Result has 76 places, 0 transitions, 0 flow [2025-01-10 01:06:44,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=76, PETRI_TRANSITIONS=0} [2025-01-10 01:06:44,703 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2025-01-10 01:06:44,703 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 0 transitions, 0 flow [2025-01-10 01:06:44,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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:06:44,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-01-10 01:06:44,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-01-10 01:06:44,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-01-10 01:06:44,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-01-10 01:06:44,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-01-10 01:06:44,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-01-10 01:06:44,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:06:44,707 INFO L422 BasicCegarLoop]: Path program histogram: [11, 4, 3, 1] [2025-01-10 01:06:44,710 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 01:06:44,710 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:06:44,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:06:44 BasicIcfg [2025-01-10 01:06:44,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:06:44,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:06:44,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:06:44,716 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:06:44,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:06:02" (3/4) ... [2025-01-10 01:06:44,718 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:06:44,721 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-10 01:06:44,721 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-10 01:06:44,721 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-10 01:06:44,721 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-10 01:06:44,724 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 83 nodes and edges [2025-01-10 01:06:44,726 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-01-10 01:06:44,726 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 01:06:44,727 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:06:44,780 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:06:44,781 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:06:44,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:06:44,781 INFO L158 Benchmark]: Toolchain (without parser) took 42694.65ms. Allocated memory was 167.8MB in the beginning and 12.1GB in the end (delta: 11.9GB). Free memory was 129.5MB in the beginning and 6.8GB in the end (delta: -6.7GB). Peak memory consumption was 5.2GB. Max. memory is 16.1GB. [2025-01-10 01:06:44,782 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:06:44,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.32ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 117.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:06:44,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.33ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 115.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:06:44,782 INFO L158 Benchmark]: Boogie Preprocessor took 54.49ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 114.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:06:44,782 INFO L158 Benchmark]: RCFGBuilder took 446.08ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 79.4MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-10 01:06:44,783 INFO L158 Benchmark]: TraceAbstraction took 41901.90ms. Allocated memory was 167.8MB in the beginning and 12.1GB in the end (delta: 11.9GB). Free memory was 78.6MB in the beginning and 6.8GB in the end (delta: -6.8GB). Peak memory consumption was 5.2GB. Max. memory is 16.1GB. [2025-01-10 01:06:44,783 INFO L158 Benchmark]: Witness Printer took 65.10ms. Allocated memory is still 12.1GB. Free memory was 6.8GB in the beginning and 6.8GB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:06:44,784 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.32ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 117.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.33ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 115.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.49ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 114.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 446.08ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 79.4MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 41901.90ms. Allocated memory was 167.8MB in the beginning and 12.1GB in the end (delta: 11.9GB). Free memory was 78.6MB in the beginning and 6.8GB in the end (delta: -6.8GB). Peak memory consumption was 5.2GB. Max. memory is 16.1GB. * Witness Printer took 65.10ms. Allocated memory is still 12.1GB. Free memory was 6.8GB in the beginning and 6.8GB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 81]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 95 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 41.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 38.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1220 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1196 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 345 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5349 IncrementalHoareTripleChecker+Invalid, 5694 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 345 mSolverCounterUnsat, 19 mSDtfsCounter, 5349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2782occurred in iteration=11, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 930 NumberOfCodeBlocks, 930 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 911 ConstructedInterpolants, 0 QuantifiedInterpolants, 2294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 01:06:44,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE