./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-misc-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-misc-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 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:05:44,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:05:44,181 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:05:44,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:05:44,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:05:44,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:05:44,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:05:44,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:05:44,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:05:44,210 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:05:44,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:05:44,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:05:44,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:05:44,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:05:44,211 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:05:44,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:05:44,211 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:05:44,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:05:44,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:05:44,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:05:44,212 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:05:44,212 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:05:44,212 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:05:44,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:05:44,212 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:05:44,212 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:05:44,212 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:05:44,212 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:05:44,213 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:05:44,213 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:05:44,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:05:44,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:05:44,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:05:44,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:44,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:05:44,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:05:44,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:05:44,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:05:44,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:44,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:05:44,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:05:44,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:05:44,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:05:44,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:05:44,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:05:44,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:05:44,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:05:44,215 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 -> 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c [2025-01-10 01:05:44,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:05:44,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:05:44,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:05:44,466 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:05:44,466 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:05:44,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2025-01-10 01:05:46,294 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62da08d7f/1f64b39c85944eb2a0e69043e666c130/FLAG01c717726 [2025-01-10 01:05:46,500 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:05:46,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2025-01-10 01:05:46,520 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62da08d7f/1f64b39c85944eb2a0e69043e666c130/FLAG01c717726 [2025-01-10 01:05:46,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/62da08d7f/1f64b39c85944eb2a0e69043e666c130 [2025-01-10 01:05:46,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:05:46,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:05:46,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:05:46,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:05:46,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:05:46,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:05:46" (1/1) ... [2025-01-10 01:05:46,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c0037ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:46, skipping insertion in model container [2025-01-10 01:05:46,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:05:46" (1/1) ... [2025-01-10 01:05:46,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:05:46,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:05:46,706 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:05:46,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:05:46,737 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:05:46,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:46 WrapperNode [2025-01-10 01:05:46,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:05:46,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:05:46,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:05:46,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:05:46,744 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:05:46" (1/1) ... [2025-01-10 01:05:46,752 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:05:46" (1/1) ... [2025-01-10 01:05:46,764 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-01-10 01:05:46,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:05:46,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:05:46,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:05:46,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:05:46,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:46" (1/1) ... [2025-01-10 01:05:46,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:46" (1/1) ... [2025-01-10 01:05:46,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:46" (1/1) ... [2025-01-10 01:05:46,789 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:05:46,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:46" (1/1) ... [2025-01-10 01:05:46,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:46" (1/1) ... [2025-01-10 01:05:46,795 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:46" (1/1) ... [2025-01-10 01:05:46,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:46" (1/1) ... [2025-01-10 01:05:46,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:46" (1/1) ... [2025-01-10 01:05:46,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:46" (1/1) ... [2025-01-10 01:05:46,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:46" (1/1) ... [2025-01-10 01:05:46,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:05:46,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:05:46,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:05:46,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:05:46,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:46" (1/1) ... [2025-01-10 01:05:46,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:05:46,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:46,826 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:05:46,828 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:05:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:05:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:05:46,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:05:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:05:46,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:05:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:05:46,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:05:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:05:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:05:46,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:05:46,845 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:05:46,901 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:05:46,903 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:05:47,046 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:05:47,047 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:05:47,154 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:05:47,159 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:05:47,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:05:47 BoogieIcfgContainer [2025-01-10 01:05:47,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:05:47,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:05:47,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:05:47,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:05:47,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:05:46" (1/3) ... [2025-01-10 01:05:47,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca90e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:05:47, skipping insertion in model container [2025-01-10 01:05:47,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:05:46" (2/3) ... [2025-01-10 01:05:47,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca90e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:05:47, skipping insertion in model container [2025-01-10 01:05:47,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:05:47" (3/3) ... [2025-01-10 01:05:47,169 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2025-01-10 01:05:47,181 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:05:47,183 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-4.wvr.c that has 4 procedures, 40 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-10 01:05:47,183 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:05:47,227 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:05:47,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 43 transitions, 107 flow [2025-01-10 01:05:47,281 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2025-01-10 01:05:47,283 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:05:47,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 4/40 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-01-10 01:05:47,288 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 43 transitions, 107 flow [2025-01-10 01:05:47,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 39 transitions, 96 flow [2025-01-10 01:05:47,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:05:47,305 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;@1564d57a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:05:47,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-10 01:05:47,323 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:05:47,325 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-01-10 01:05:47,325 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:05:47,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:47,326 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] [2025-01-10 01:05:47,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:47,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:47,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2026061130, now seen corresponding path program 1 times [2025-01-10 01:05:47,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:47,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110023587] [2025-01-10 01:05:47,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:47,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:47,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:05:47,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:05:47,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:47,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:47,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:47,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110023587] [2025-01-10 01:05:47,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110023587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:47,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:47,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:05:47,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841660111] [2025-01-10 01:05:47,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:47,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:47,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:47,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:47,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:47,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2025-01-10 01:05:47,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 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:05:47,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:47,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2025-01-10 01:05:47,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:48,100 INFO L124 PetriNetUnfolderBase]: 480/950 cut-off events. [2025-01-10 01:05:48,100 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-01-10 01:05:48,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 950 events. 480/950 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5499 event pairs, 58 based on Foata normal form. 66/917 useless extension candidates. Maximal degree in co-relation 1486. Up to 403 conditions per place. [2025-01-10 01:05:48,113 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 39 selfloop transitions, 8 changer transitions 1/64 dead transitions. [2025-01-10 01:05:48,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 266 flow [2025-01-10 01:05:48,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:05:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:05:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-01-10 01:05:48,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162790697674418 [2025-01-10 01:05:48,126 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 96 flow. Second operand 5 states and 154 transitions. [2025-01-10 01:05:48,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 266 flow [2025-01-10 01:05:48,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 238 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:05:48,133 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 135 flow [2025-01-10 01:05:48,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2025-01-10 01:05:48,139 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2025-01-10 01:05:48,140 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 135 flow [2025-01-10 01:05:48,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 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:05:48,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:48,141 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] [2025-01-10 01:05:48,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:05:48,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:48,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1253136630, now seen corresponding path program 2 times [2025-01-10 01:05:48,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:48,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974982263] [2025-01-10 01:05:48,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:48,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:48,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:05:48,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:05:48,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:05:48,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:48,207 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:05:48,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:48,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974982263] [2025-01-10 01:05:48,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974982263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:48,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:48,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:05:48,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611780110] [2025-01-10 01:05:48,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:48,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:05:48,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:48,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:05:48,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:05:48,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2025-01-10 01:05:48,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:05:48,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:48,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2025-01-10 01:05:48,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:48,350 INFO L124 PetriNetUnfolderBase]: 632/1187 cut-off events. [2025-01-10 01:05:48,351 INFO L125 PetriNetUnfolderBase]: For 844/844 co-relation queries the response was YES. [2025-01-10 01:05:48,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2566 conditions, 1187 events. 632/1187 cut-off events. For 844/844 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6969 event pairs, 189 based on Foata normal form. 96/1169 useless extension candidates. Maximal degree in co-relation 1474. Up to 594 conditions per place. [2025-01-10 01:05:48,360 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 26 selfloop transitions, 5 changer transitions 1/50 dead transitions. [2025-01-10 01:05:48,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 224 flow [2025-01-10 01:05:48,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:05:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:05:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-01-10 01:05:48,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2025-01-10 01:05:48,361 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 135 flow. Second operand 3 states and 90 transitions. [2025-01-10 01:05:48,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 224 flow [2025-01-10 01:05:48,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:05:48,364 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 162 flow [2025-01-10 01:05:48,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-01-10 01:05:48,364 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-01-10 01:05:48,365 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 162 flow [2025-01-10 01:05:48,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:05:48,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:48,365 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] [2025-01-10 01:05:48,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:05:48,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:48,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1576749556, now seen corresponding path program 1 times [2025-01-10 01:05:48,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:48,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173650666] [2025-01-10 01:05:48,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:48,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:48,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:05:48,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:05:48,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:48,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:48,442 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:05:48,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173650666] [2025-01-10 01:05:48,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173650666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:48,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:48,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:05:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170124716] [2025-01-10 01:05:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:48,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:05:48,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:48,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:05:48,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:05:48,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2025-01-10 01:05:48,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:05:48,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:48,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2025-01-10 01:05:48,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:48,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L55-1-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][14], [Black: 61#true, 42#L88-4true, 25#L42true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L56true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,663 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-10 01:05:48,663 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,663 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-10 01:05:48,663 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,663 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][46], [Black: 61#true, 40#L55-1true, 42#L88-4true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 36#L46-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,663 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-10 01:05:48,663 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,663 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,663 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,663 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][30], [Black: 61#true, 40#L55-1true, 42#L88-4true, 9#L43-2true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,663 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-10 01:05:48,663 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,663 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,663 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L55-1-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][14], [Black: 61#true, 25#L42true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L56true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,680 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-10 01:05:48,680 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,680 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,680 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][46], [Black: 61#true, 40#L55-1true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 36#L46-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,682 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,682 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,682 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,682 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][30], [Black: 61#true, 40#L55-1true, 9#L43-2true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,682 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,682 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,683 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,683 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L55-1-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][14], [Black: 61#true, 42#L88-4true, 25#L42true, 24#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 13#L56true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,683 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-10 01:05:48,683 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,684 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,684 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][46], [Black: 61#true, 40#L55-1true, 42#L88-4true, 24#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 36#L46-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,684 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,684 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,684 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,684 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][30], [Black: 61#true, 40#L55-1true, 42#L88-4true, 24#thread3EXITtrue, 9#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,684 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,684 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,685 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,685 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L55-1-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][14], [Black: 61#true, 25#L42true, 42#L88-4true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 13#L56true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,691 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-10 01:05:48,691 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,691 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-10 01:05:48,691 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][46], [Black: 61#true, 40#L55-1true, 42#L88-4true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 36#L46-2true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,692 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-10 01:05:48,692 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,692 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,692 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][30], [Black: 61#true, 40#L55-1true, 42#L88-4true, 9#L43-2true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,692 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-10 01:05:48,692 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,692 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,692 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L55-1-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][14], [Black: 61#true, 24#thread3EXITtrue, 25#L42true, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 13#L56true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,695 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,695 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,695 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,695 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][46], [Black: 61#true, 40#L55-1true, 24#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 36#L46-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,695 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 01:05:48,695 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 01:05:48,696 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 01:05:48,696 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,696 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][30], [Black: 61#true, 40#L55-1true, 9#L43-2true, 24#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,696 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 01:05:48,696 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,696 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 01:05:48,696 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 01:05:48,699 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([236] L55-1-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][14], [Black: 61#true, 42#L88-4true, 25#L42true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 13#L56true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,699 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-10 01:05:48,699 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 01:05:48,700 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,700 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-10 01:05:48,700 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([236] L55-1-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][14], [Black: 61#true, 25#L42true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, 13#L56true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,703 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-10 01:05:48,703 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,703 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,703 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][46], [Black: 61#true, 40#L55-1true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 36#L46-2true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,704 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,704 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,704 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,704 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][30], [Black: 61#true, 40#L55-1true, 9#L43-2true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,704 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,704 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,704 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,704 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][46], [Black: 61#true, 40#L55-1true, 42#L88-4true, 24#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 36#L46-2true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,704 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,704 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,704 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,704 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][30], [Black: 61#true, 40#L55-1true, 42#L88-4true, 9#L43-2true, 24#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,704 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,704 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,705 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,705 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][16], [Black: 61#true, 9#L43-2true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 22#L57true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2025-01-10 01:05:48,710 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,710 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,710 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,710 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 01:05:48,712 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][37], [Black: 61#true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 22#L57true, 36#L46-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2025-01-10 01:05:48,714 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,714 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 01:05:48,714 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,714 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,714 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][30], [Black: 61#true, 40#L55-1true, 42#L88-4true, 9#L43-2true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,714 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,714 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,714 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,714 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 01:05:48,714 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,715 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][46], [Black: 61#true, 40#L55-1true, 42#L88-4true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 36#L46-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,715 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,715 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,715 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,715 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,715 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 01:05:48,716 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([236] L55-1-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][14], [Black: 61#true, 25#L42true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, 13#L56true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,716 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,716 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,716 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-10 01:05:48,716 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,716 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 01:05:48,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][46], [Black: 61#true, 40#L55-1true, 24#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 36#L46-2true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,717 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 01:05:48,718 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 01:05:48,718 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,718 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 01:05:48,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][30], [Black: 61#true, 40#L55-1true, 9#L43-2true, 24#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,718 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 01:05:48,718 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 01:05:48,718 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,718 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 01:05:48,719 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][30], [Black: 61#true, 40#L55-1true, 9#L43-2true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,720 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 01:05:48,720 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,720 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,720 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,720 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,720 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][46], [Black: 61#true, 40#L55-1true, 44#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 6#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 36#L46-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,720 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 01:05:48,720 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 01:05:48,720 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,720 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,720 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,722 INFO L124 PetriNetUnfolderBase]: 1341/2305 cut-off events. [2025-01-10 01:05:48,722 INFO L125 PetriNetUnfolderBase]: For 1760/1816 co-relation queries the response was YES. [2025-01-10 01:05:48,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5602 conditions, 2305 events. 1341/2305 cut-off events. For 1760/1816 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 14160 event pairs, 439 based on Foata normal form. 11/1836 useless extension candidates. Maximal degree in co-relation 3065. Up to 897 conditions per place. [2025-01-10 01:05:48,742 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 34 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2025-01-10 01:05:48,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 292 flow [2025-01-10 01:05:48,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:05:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:05:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-01-10 01:05:48,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751937984496124 [2025-01-10 01:05:48,745 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 162 flow. Second operand 3 states and 97 transitions. [2025-01-10 01:05:48,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 292 flow [2025-01-10 01:05:48,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:48,754 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 174 flow [2025-01-10 01:05:48,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2025-01-10 01:05:48,755 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2025-01-10 01:05:48,755 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 174 flow [2025-01-10 01:05:48,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:05:48,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:48,756 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] [2025-01-10 01:05:48,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:05:48,756 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:48,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1935450215, now seen corresponding path program 1 times [2025-01-10 01:05:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754306580] [2025-01-10 01:05:48,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:48,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:05:48,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:05:48,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:48,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:48,834 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:05:48,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:48,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754306580] [2025-01-10 01:05:48,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754306580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:48,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:48,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:05:48,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498972681] [2025-01-10 01:05:48,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:48,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:05:48,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:48,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:05:48,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:05:48,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2025-01-10 01:05:48,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:05:48,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:48,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2025-01-10 01:05:48,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:48,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([226] L41-1-->L42: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 25#L42true, Black: 68#(<= 1 (mod ~d2~0 256)), 3#L88-3true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L56true, 71#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:48,984 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 01:05:48,984 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:48,984 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:48,984 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-10 01:05:49,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([226] L41-1-->L42: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 38#$Ultimate##0true, 25#L42true, 42#L88-4true, Black: 68#(<= 1 (mod ~d2~0 256)), 13#L56true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 71#true, Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:49,001 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 01:05:49,001 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:49,001 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 01:05:49,002 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:49,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([226] L41-1-->L42: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 42#L88-4true, 25#L42true, 24#thread3EXITtrue, Black: 68#(<= 1 (mod ~d2~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L56true, Black: 54#(<= 0 ~pos~0), 71#true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:49,010 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-10 01:05:49,010 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,010 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 01:05:49,010 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([226] L41-1-->L42: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [38#$Ultimate##0true, Black: 61#true, 25#L42true, Black: 68#(<= 1 (mod ~d2~0 256)), 6#L89true, 13#L56true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 71#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:49,015 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-01-10 01:05:49,015 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 01:05:49,015 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 01:05:49,015 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 01:05:49,023 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([226] L41-1-->L42: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 25#L42true, 24#thread3EXITtrue, Black: 68#(<= 1 (mod ~d2~0 256)), 6#L89true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L56true, Black: 54#(<= 0 ~pos~0), 71#true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:49,023 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,023 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,023 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 01:05:49,023 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 01:05:49,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([241] L60-->L60-1: Formula: (= v_~pos~0_6 (+ v_~pos~0_5 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][45], [Black: 61#true, 24#thread3EXITtrue, 42#L88-4true, 4#L60-1true, Black: 68#(<= 1 (mod ~d2~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 36#L46-2true, 71#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:49,031 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-10 01:05:49,032 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 01:05:49,032 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 01:05:49,032 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 01:05:49,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([241] L60-->L60-1: Formula: (= v_~pos~0_6 (+ v_~pos~0_5 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][45], [Black: 61#true, 24#thread3EXITtrue, 4#L60-1true, Black: 68#(<= 1 (mod ~d2~0 256)), 6#L89true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 36#L46-2true, 71#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:49,042 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2025-01-10 01:05:49,042 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,042 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 01:05:49,042 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([226] L41-1-->L42: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 25#L42true, 44#L69-1true, Black: 68#(<= 1 (mod ~d2~0 256)), 6#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L56true, 66#true, Black: 54#(<= 0 ~pos~0), 71#true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:49,043 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2025-01-10 01:05:49,043 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,043 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 01:05:49,043 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 01:05:49,044 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([226] L41-1-->L42: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 25#L42true, 24#thread3EXITtrue, 42#L88-4true, Black: 68#(<= 1 (mod ~d2~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L56true, 66#true, Black: 54#(<= 0 ~pos~0), 71#true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:49,044 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2025-01-10 01:05:49,044 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 01:05:49,045 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,045 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 01:05:49,045 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,046 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([226] L41-1-->L42: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 24#thread3EXITtrue, 42#L88-4true, 25#L42true, Black: 68#(<= 1 (mod ~d2~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L56true, Black: 54#(<= 0 ~pos~0), 71#true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:49,046 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2025-01-10 01:05:49,046 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 01:05:49,046 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 01:05:49,047 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,047 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-10 01:05:49,047 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,049 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([226] L41-1-->L42: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 24#thread3EXITtrue, 25#L42true, Black: 68#(<= 1 (mod ~d2~0 256)), 6#L89true, 13#L56true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 71#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:49,049 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-10 01:05:49,049 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,049 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,050 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 01:05:49,050 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 01:05:49,050 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([226] L41-1-->L42: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 25#L42true, 24#thread3EXITtrue, Black: 68#(<= 1 (mod ~d2~0 256)), 6#L89true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L56true, Black: 54#(<= 0 ~pos~0), 71#true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-01-10 01:05:49,050 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-01-10 01:05:49,050 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,050 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-01-10 01:05:49,051 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-10 01:05:49,051 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 01:05:49,051 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 01:05:49,052 INFO L124 PetriNetUnfolderBase]: 1000/2003 cut-off events. [2025-01-10 01:05:49,052 INFO L125 PetriNetUnfolderBase]: For 1068/1170 co-relation queries the response was YES. [2025-01-10 01:05:49,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4692 conditions, 2003 events. 1000/2003 cut-off events. For 1068/1170 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13344 event pairs, 391 based on Foata normal form. 14/1769 useless extension candidates. Maximal degree in co-relation 2415. Up to 731 conditions per place. [2025-01-10 01:05:49,070 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 32 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2025-01-10 01:05:49,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 287 flow [2025-01-10 01:05:49,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:05:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:05:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-01-10 01:05:49,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751937984496124 [2025-01-10 01:05:49,072 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 174 flow. Second operand 3 states and 97 transitions. [2025-01-10 01:05:49,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 287 flow [2025-01-10 01:05:49,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:49,078 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 190 flow [2025-01-10 01:05:49,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-01-10 01:05:49,079 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2025-01-10 01:05:49,079 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 190 flow [2025-01-10 01:05:49,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:05:49,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:49,079 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:49,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:05:49,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:49,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1188484232, now seen corresponding path program 1 times [2025-01-10 01:05:49,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:49,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876724008] [2025-01-10 01:05:49,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:49,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:05:49,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:05:49,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:49,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:49,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:49,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876724008] [2025-01-10 01:05:49,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876724008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:49,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162741179] [2025-01-10 01:05:49,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:49,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:49,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:49,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:05:49,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:05:49,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:05:49,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:05:49,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:49,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:49,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:05:49,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:49,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:49,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162741179] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:49,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:49,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2025-01-10 01:05:49,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418978507] [2025-01-10 01:05:49,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:49,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:05:49,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:49,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:05:49,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:05:49,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-01-10 01:05:49,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 190 flow. Second operand has 11 states, 11 states have (on average 21.181818181818183) internal successors, (233), 11 states have internal predecessors, (233), 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:05:49,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:49,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-01-10 01:05:49,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:50,107 INFO L124 PetriNetUnfolderBase]: 3111/5713 cut-off events. [2025-01-10 01:05:50,107 INFO L125 PetriNetUnfolderBase]: For 4485/4529 co-relation queries the response was YES. [2025-01-10 01:05:50,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14723 conditions, 5713 events. 3111/5713 cut-off events. For 4485/4529 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 40400 event pairs, 201 based on Foata normal form. 160/5595 useless extension candidates. Maximal degree in co-relation 9178. Up to 1315 conditions per place. [2025-01-10 01:05:50,134 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 55 selfloop transitions, 20 changer transitions 22/114 dead transitions. [2025-01-10 01:05:50,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 114 transitions, 627 flow [2025-01-10 01:05:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:05:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:05:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 240 transitions. [2025-01-10 01:05:50,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6201550387596899 [2025-01-10 01:05:50,136 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 190 flow. Second operand 9 states and 240 transitions. [2025-01-10 01:05:50,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 114 transitions, 627 flow [2025-01-10 01:05:50,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 114 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:50,144 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 361 flow [2025-01-10 01:05:50,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=361, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2025-01-10 01:05:50,146 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2025-01-10 01:05:50,146 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 361 flow [2025-01-10 01:05:50,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.181818181818183) internal successors, (233), 11 states have internal predecessors, (233), 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:05:50,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:50,147 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:50,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:05:50,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:50,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:50,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:50,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1958528549, now seen corresponding path program 1 times [2025-01-10 01:05:50,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:50,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331216317] [2025-01-10 01:05:50,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:50,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:50,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:05:50,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:05:50,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:50,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:50,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331216317] [2025-01-10 01:05:50,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331216317] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898137663] [2025-01-10 01:05:50,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:50,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:50,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:50,512 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:05:50,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:05:50,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:05:50,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:05:50,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:50,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:50,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:05:50,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:50,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:50,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898137663] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:50,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:50,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 8 [2025-01-10 01:05:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821555835] [2025-01-10 01:05:50,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:50,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:05:50,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:50,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:05:50,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:05:50,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-01-10 01:05:50,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 361 flow. Second operand has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 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:05:50,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:50,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-01-10 01:05:50,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:51,291 INFO L124 PetriNetUnfolderBase]: 3702/7076 cut-off events. [2025-01-10 01:05:51,291 INFO L125 PetriNetUnfolderBase]: For 17421/17519 co-relation queries the response was YES. [2025-01-10 01:05:51,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22594 conditions, 7076 events. 3702/7076 cut-off events. For 17421/17519 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 53611 event pairs, 235 based on Foata normal form. 226/6866 useless extension candidates. Maximal degree in co-relation 18837. Up to 1827 conditions per place. [2025-01-10 01:05:51,340 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 62 selfloop transitions, 26 changer transitions 60/165 dead transitions. [2025-01-10 01:05:51,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 165 transitions, 1308 flow [2025-01-10 01:05:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:05:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:05:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 266 transitions. [2025-01-10 01:05:51,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6186046511627907 [2025-01-10 01:05:51,342 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 361 flow. Second operand 10 states and 266 transitions. [2025-01-10 01:05:51,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 165 transitions, 1308 flow [2025-01-10 01:05:51,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 165 transitions, 1147 flow, removed 79 selfloop flow, removed 3 redundant places. [2025-01-10 01:05:51,380 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 528 flow [2025-01-10 01:05:51,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=528, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2025-01-10 01:05:51,381 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2025-01-10 01:05:51,382 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 528 flow [2025-01-10 01:05:51,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 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:05:51,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:51,382 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:51,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:05:51,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:51,583 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:51,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:51,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1742675992, now seen corresponding path program 2 times [2025-01-10 01:05:51,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:51,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789569878] [2025-01-10 01:05:51,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:51,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:51,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:05:51,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:05:51,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:05:51,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:05:51,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:51,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789569878] [2025-01-10 01:05:51,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789569878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:51,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:51,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:05:51,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26439548] [2025-01-10 01:05:51,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:51,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:51,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:51,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:51,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:51,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2025-01-10 01:05:51,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 528 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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:05:51,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:51,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2025-01-10 01:05:51,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:52,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][23], [Black: 61#true, 24#thread3EXITtrue, 9#L43-2true, Black: 66#true, 411#(< 0 (mod ~v_assert~0 256)), 6#L89true, Black: 71#true, Black: 486#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 488#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 359#(= ~v_assert~0 1), Black: 490#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), 496#true, Black: 484#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), 4#L60-1true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1))]) [2025-01-10 01:05:52,111 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2025-01-10 01:05:52,111 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:05:52,111 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2025-01-10 01:05:52,111 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:05:52,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][91], [Black: 61#true, 24#thread3EXITtrue, Black: 66#true, 411#(< 0 (mod ~v_assert~0 256)), 6#L89true, Black: 73#(<= 1 (mod ~d1~0 256)), 36#L46-2true, Black: 486#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 488#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 359#(= ~v_assert~0 1), Black: 490#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), 496#true, Black: 484#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), 4#L60-1true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2025-01-10 01:05:52,111 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2025-01-10 01:05:52,111 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2025-01-10 01:05:52,111 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:05:52,111 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-01-10 01:05:52,116 INFO L124 PetriNetUnfolderBase]: 2990/5542 cut-off events. [2025-01-10 01:05:52,116 INFO L125 PetriNetUnfolderBase]: For 20750/21636 co-relation queries the response was YES. [2025-01-10 01:05:52,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19865 conditions, 5542 events. 2990/5542 cut-off events. For 20750/21636 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 40609 event pairs, 943 based on Foata normal form. 89/4582 useless extension candidates. Maximal degree in co-relation 19111. Up to 1679 conditions per place. [2025-01-10 01:05:52,167 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 75 selfloop transitions, 5 changer transitions 0/117 dead transitions. [2025-01-10 01:05:52,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 117 transitions, 1026 flow [2025-01-10 01:05:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:05:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:05:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-01-10 01:05:52,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7674418604651163 [2025-01-10 01:05:52,169 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 528 flow. Second operand 4 states and 132 transitions. [2025-01-10 01:05:52,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 117 transitions, 1026 flow [2025-01-10 01:05:52,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 117 transitions, 945 flow, removed 38 selfloop flow, removed 4 redundant places. [2025-01-10 01:05:52,253 INFO L231 Difference]: Finished difference. Result has 71 places, 76 transitions, 527 flow [2025-01-10 01:05:52,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=527, PETRI_PLACES=71, PETRI_TRANSITIONS=76} [2025-01-10 01:05:52,254 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2025-01-10 01:05:52,254 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 76 transitions, 527 flow [2025-01-10 01:05:52,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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:05:52,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:52,254 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:52,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:05:52,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:52,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:52,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1945768456, now seen corresponding path program 2 times [2025-01-10 01:05:52,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:52,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984811860] [2025-01-10 01:05:52,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:52,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:52,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-10 01:05:52,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:05:52,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:05:52,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:52,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:52,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984811860] [2025-01-10 01:05:52,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984811860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:52,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:52,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:05:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599542831] [2025-01-10 01:05:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:52,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:05:52,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:52,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:05:52,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:05:52,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2025-01-10 01:05:52,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 76 transitions, 527 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:05:52,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:52,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2025-01-10 01:05:52,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:52,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][25], [Black: 61#true, 9#L43-2true, Black: 66#true, 6#L89true, 484#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 486#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 71#true, Black: 488#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 54#(<= 0 ~pos~0), Black: 490#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), 496#true, 38#$Ultimate##0true, 503#true, 4#L60-1true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 498#(= (mod ~d2~0 256) 0), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 499#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1))]) [2025-01-10 01:05:52,468 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-01-10 01:05:52,468 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-10 01:05:52,468 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-01-10 01:05:52,468 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-10 01:05:52,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][25], [Black: 61#true, 9#L43-2true, Black: 66#true, 411#(< 0 (mod ~v_assert~0 256)), 6#L89true, Black: 486#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 71#true, Black: 488#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 499#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 490#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 484#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), 38#$Ultimate##0true, 503#true, 4#L60-1true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 498#(= (mod ~d2~0 256) 0), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 496#true, Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1))]) [2025-01-10 01:05:52,515 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-10 01:05:52,515 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:52,515 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-10 01:05:52,515 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 01:05:52,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([230] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][25], [Black: 61#true, 9#L43-2true, 44#L69-1true, Black: 66#true, 411#(< 0 (mod ~v_assert~0 256)), 6#L89true, Black: 71#true, Black: 486#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 488#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 499#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 490#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 484#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), 503#true, 4#L60-1true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 498#(= (mod ~d2~0 256) 0), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 496#true, Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1))]) [2025-01-10 01:05:52,537 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2025-01-10 01:05:52,537 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 01:05:52,537 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 01:05:52,537 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-10 01:05:52,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][57], [Black: 61#true, 24#thread3EXITtrue, Black: 68#(<= 1 (mod ~d2~0 256)), 411#(< 0 (mod ~v_assert~0 256)), 6#L89true, Black: 73#(<= 1 (mod ~d1~0 256)), 36#L46-2true, Black: 486#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 488#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 498#(= (mod ~d2~0 256) 0), Black: 490#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 484#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), 4#L60-1true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 499#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 496#true, Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 505#(= (mod ~d1~0 256) 0), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 144#(= ~v_assert~0 1)]) [2025-01-10 01:05:52,621 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-01-10 01:05:52,621 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:05:52,621 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:05:52,621 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-01-10 01:05:52,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][66], [Black: 61#true, 42#L88-4true, 24#thread3EXITtrue, Black: 66#true, 411#(< 0 (mod ~v_assert~0 256)), Black: 73#(<= 1 (mod ~d1~0 256)), Black: 486#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 36#L46-2true, Black: 488#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 499#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 490#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 484#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), 4#L60-1true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 498#(= (mod ~d2~0 256) 0), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 496#true, Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 505#(= (mod ~d1~0 256) 0), Black: 54#(<= 0 ~pos~0), 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2025-01-10 01:05:52,628 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2025-01-10 01:05:52,629 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 01:05:52,629 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 01:05:52,629 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-01-10 01:05:52,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][66], [Black: 61#true, 24#thread3EXITtrue, Black: 66#true, 411#(< 0 (mod ~v_assert~0 256)), 6#L89true, Black: 73#(<= 1 (mod ~d1~0 256)), 36#L46-2true, Black: 486#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 488#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 499#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 490#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 484#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), 4#L60-1true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 498#(= (mod ~d2~0 256) 0), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 496#true, Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 505#(= (mod ~d1~0 256) 0), Black: 54#(<= 0 ~pos~0), 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2025-01-10 01:05:52,643 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2025-01-10 01:05:52,643 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 01:05:52,643 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 01:05:52,643 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-01-10 01:05:52,693 INFO L124 PetriNetUnfolderBase]: 1567/3645 cut-off events. [2025-01-10 01:05:52,693 INFO L125 PetriNetUnfolderBase]: For 9473/10057 co-relation queries the response was YES. [2025-01-10 01:05:52,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12372 conditions, 3645 events. 1567/3645 cut-off events. For 9473/10057 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 27892 event pairs, 472 based on Foata normal form. 113/3439 useless extension candidates. Maximal degree in co-relation 8496. Up to 825 conditions per place. [2025-01-10 01:05:52,726 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 53 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2025-01-10 01:05:52,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 97 transitions, 728 flow [2025-01-10 01:05:52,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:05:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:05:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-01-10 01:05:52,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2025-01-10 01:05:52,728 INFO L175 Difference]: Start difference. First operand has 71 places, 76 transitions, 527 flow. Second operand 4 states and 128 transitions. [2025-01-10 01:05:52,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 97 transitions, 728 flow [2025-01-10 01:05:52,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 97 transitions, 716 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 01:05:52,742 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 539 flow [2025-01-10 01:05:52,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=539, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2025-01-10 01:05:52,744 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2025-01-10 01:05:52,744 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 539 flow [2025-01-10 01:05:52,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:05:52,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:52,745 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:52,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:05:52,746 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:52,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash -970124829, now seen corresponding path program 1 times [2025-01-10 01:05:52,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:52,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050132762] [2025-01-10 01:05:52,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:52,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:52,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:05:52,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:05:52,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:52,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:52,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:52,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050132762] [2025-01-10 01:05:52,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050132762] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:52,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371600914] [2025-01-10 01:05:52,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:52,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:52,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:52,965 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:05:52,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:05:53,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:05:53,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:05:53,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:53,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:53,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:05:53,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:53,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:53,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:53,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371600914] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:53,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:53,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 12 [2025-01-10 01:05:53,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109534289] [2025-01-10 01:05:53,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:53,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:05:53,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:53,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:05:53,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:05:53,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-10 01:05:53,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 539 flow. Second operand has 12 states, 12 states have (on average 18.25) internal successors, (219), 12 states have internal predecessors, (219), 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:05:53,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:53,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-10 01:05:53,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:54,751 INFO L124 PetriNetUnfolderBase]: 9335/16611 cut-off events. [2025-01-10 01:05:54,751 INFO L125 PetriNetUnfolderBase]: For 53629/53653 co-relation queries the response was YES. [2025-01-10 01:05:54,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63446 conditions, 16611 events. 9335/16611 cut-off events. For 53629/53653 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 125626 event pairs, 883 based on Foata normal form. 324/16863 useless extension candidates. Maximal degree in co-relation 47072. Up to 3336 conditions per place. [2025-01-10 01:05:54,839 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 98 selfloop transitions, 56 changer transitions 119/287 dead transitions. [2025-01-10 01:05:54,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 287 transitions, 2542 flow [2025-01-10 01:05:54,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:05:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:05:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 384 transitions. [2025-01-10 01:05:54,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2025-01-10 01:05:54,845 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 539 flow. Second operand 16 states and 384 transitions. [2025-01-10 01:05:54,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 287 transitions, 2542 flow [2025-01-10 01:05:54,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 287 transitions, 2542 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:05:54,928 INFO L231 Difference]: Finished difference. Result has 101 places, 109 transitions, 1101 flow [2025-01-10 01:05:54,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1101, PETRI_PLACES=101, PETRI_TRANSITIONS=109} [2025-01-10 01:05:54,930 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 56 predicate places. [2025-01-10 01:05:54,931 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 109 transitions, 1101 flow [2025-01-10 01:05:54,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.25) internal successors, (219), 12 states have internal predecessors, (219), 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:05:54,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:54,931 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:54,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:05:55,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:55,132 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:05:55,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:55,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1680309117, now seen corresponding path program 2 times [2025-01-10 01:05:55,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:55,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265572957] [2025-01-10 01:05:55,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:55,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:55,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-10 01:05:55,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:05:55,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:05:55,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:55,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:55,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265572957] [2025-01-10 01:05:55,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265572957] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:55,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915640928] [2025-01-10 01:05:55,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:55,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:55,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:55,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:05:55,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:05:55,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-01-10 01:05:55,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:05:55,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:05:55,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:55,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:05:55,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:55,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:05:55,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915640928] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:55,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:55,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 10 [2025-01-10 01:05:55,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806781439] [2025-01-10 01:05:55,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:55,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:05:55,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:55,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:05:55,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:05:55,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-01-10 01:05:55,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 109 transitions, 1101 flow. Second operand has 10 states, 10 states have (on average 21.2) internal successors, (212), 10 states have internal predecessors, (212), 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:05:55,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:55,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-01-10 01:05:55,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:56,193 INFO L124 PetriNetUnfolderBase]: 2813/6176 cut-off events. [2025-01-10 01:05:56,193 INFO L125 PetriNetUnfolderBase]: For 43162/43304 co-relation queries the response was YES. [2025-01-10 01:05:56,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26971 conditions, 6176 events. 2813/6176 cut-off events. For 43162/43304 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 49188 event pairs, 143 based on Foata normal form. 290/6428 useless extension candidates. Maximal degree in co-relation 26914. Up to 1658 conditions per place. [2025-01-10 01:05:56,226 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 0 selfloop transitions, 0 changer transitions 193/193 dead transitions. [2025-01-10 01:05:56,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 193 transitions, 2224 flow [2025-01-10 01:05:56,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:05:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:05:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 293 transitions. [2025-01-10 01:05:56,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5678294573643411 [2025-01-10 01:05:56,229 INFO L175 Difference]: Start difference. First operand has 101 places, 109 transitions, 1101 flow. Second operand 12 states and 293 transitions. [2025-01-10 01:05:56,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 193 transitions, 2224 flow [2025-01-10 01:05:56,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 193 transitions, 1969 flow, removed 77 selfloop flow, removed 13 redundant places. [2025-01-10 01:05:56,304 INFO L231 Difference]: Finished difference. Result has 87 places, 0 transitions, 0 flow [2025-01-10 01:05:56,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=87, PETRI_TRANSITIONS=0} [2025-01-10 01:05:56,305 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places. [2025-01-10 01:05:56,305 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 0 transitions, 0 flow [2025-01-10 01:05:56,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.2) internal successors, (212), 10 states have internal predecessors, (212), 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:05:56,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-01-10 01:05:56,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-01-10 01:05:56,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-10 01:05:56,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-01-10 01:05:56,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-01-10 01:05:56,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:05:56,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 01:05:56,509 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1] [2025-01-10 01:05:56,512 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 01:05:56,513 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:05:56,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:05:56 BasicIcfg [2025-01-10 01:05:56,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:05:56,520 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:05:56,520 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:05:56,520 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:05:56,521 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:05:47" (3/4) ... [2025-01-10 01:05:56,522 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:05:56,525 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-10 01:05:56,525 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-10 01:05:56,525 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-10 01:05:56,528 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2025-01-10 01:05:56,528 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-01-10 01:05:56,528 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 01:05:56,528 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:05:56,600 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:05:56,601 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:05:56,601 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:05:56,602 INFO L158 Benchmark]: Toolchain (without parser) took 10056.51ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 114.3MB in the beginning and 105.7MB in the end (delta: 8.6MB). Peak memory consumption was 409.9MB. Max. memory is 16.1GB. [2025-01-10 01:05:56,602 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:05:56,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.06ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 102.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:05:56,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.78ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:05:56,604 INFO L158 Benchmark]: Boogie Preprocessor took 32.76ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 100.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:05:56,604 INFO L158 Benchmark]: RCFGBuilder took 359.56ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 79.9MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:05:56,605 INFO L158 Benchmark]: TraceAbstraction took 9358.20ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 79.1MB in the beginning and 112.5MB in the end (delta: -33.4MB). Peak memory consumption was 368.0MB. Max. memory is 16.1GB. [2025-01-10 01:05:56,605 INFO L158 Benchmark]: Witness Printer took 81.04ms. Allocated memory is still 545.3MB. Free memory was 112.5MB in the beginning and 105.7MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:05:56,606 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.23ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.06ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 102.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.78ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.76ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 100.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 359.56ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 79.9MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9358.20ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 79.1MB in the beginning and 112.5MB in the end (delta: -33.4MB). Peak memory consumption was 368.0MB. Max. memory is 16.1GB. * Witness Printer took 81.04ms. Allocated memory is still 545.3MB. Free memory was 112.5MB in the beginning and 105.7MB in the end (delta: 6.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: 74]: 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 7 procedures, 63 locations, 5 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: 9.3s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 607 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1355 IncrementalHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 35 mSDtfsCounter, 1355 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 282 SyntacticMatches, 16 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1101occurred in iteration=9, InterpolantAutomatonStates: 69, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 466 NumberOfCodeBlocks, 466 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 594 ConstructedInterpolants, 0 QuantifiedInterpolants, 1584 SizeOfPredicates, 23 NumberOfNonLiveVariables, 652 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 30/47 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:05:56,621 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