./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-barrier.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-barrier.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 b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:04:33,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:04:33,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:04:33,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:04:33,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:04:33,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:04:33,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:04:33,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:04:33,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:04:33,217 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:04:33,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:04:33,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:04:33,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:04:33,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:04:33,218 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:04:33,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:04:33,219 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:04:33,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:04:33,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:04:33,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:04:33,219 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:04:33,219 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:04:33,219 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:04:33,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:04:33,219 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:04:33,220 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:04:33,220 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:04:33,220 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:04:33,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:04:33,220 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:04:33,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:04:33,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:04:33,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:04:33,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:04:33,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:04:33,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:04:33,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:04:33,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:04:33,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:04:33,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:04:33,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:04:33,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:04:33,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:04:33,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:04:33,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:04:33,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:04:33,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:04:33,222 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 -> b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c [2025-01-10 01:04:33,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:04:33,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:04:33,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:04:33,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:04:33,492 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:04:33,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2025-01-10 01:04:34,707 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7b1a2756/e168ced456ba49af972143a6a7b0f374/FLAG61caa8945 [2025-01-10 01:04:35,000 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:04:35,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2025-01-10 01:04:35,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7b1a2756/e168ced456ba49af972143a6a7b0f374/FLAG61caa8945 [2025-01-10 01:04:35,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7b1a2756/e168ced456ba49af972143a6a7b0f374 [2025-01-10 01:04:35,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:04:35,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:04:35,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:04:35,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:04:35,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:04:35,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:04:35" (1/1) ... [2025-01-10 01:04:35,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3877f424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:35, skipping insertion in model container [2025-01-10 01:04:35,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:04:35" (1/1) ... [2025-01-10 01:04:35,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:04:35,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:04:35,194 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:04:35,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:04:35,230 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:04:35,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:35 WrapperNode [2025-01-10 01:04:35,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:04:35,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:04:35,233 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:04:35,233 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:04:35,237 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:04:35" (1/1) ... [2025-01-10 01:04:35,243 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:04:35" (1/1) ... [2025-01-10 01:04:35,264 INFO L138 Inliner]: procedures = 22, calls = 21, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 212 [2025-01-10 01:04:35,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:04:35,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:04:35,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:04:35,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:04:35,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:35" (1/1) ... [2025-01-10 01:04:35,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:35" (1/1) ... [2025-01-10 01:04:35,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:35" (1/1) ... [2025-01-10 01:04:35,293 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:04:35,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:35" (1/1) ... [2025-01-10 01:04:35,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:35" (1/1) ... [2025-01-10 01:04:35,301 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:35" (1/1) ... [2025-01-10 01:04:35,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:35" (1/1) ... [2025-01-10 01:04:35,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:35" (1/1) ... [2025-01-10 01:04:35,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:35" (1/1) ... [2025-01-10 01:04:35,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:35" (1/1) ... [2025-01-10 01:04:35,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:04:35,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:04:35,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:04:35,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:04:35,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:35" (1/1) ... [2025-01-10 01:04:35,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:04:35,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:35,346 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:04:35,352 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:04:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:04:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:04:35,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:04:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:04:35,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:04:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:04:35,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:04:35,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 01:04:35,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 01:04:35,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:04:35,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-01-10 01:04:35,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-01-10 01:04:35,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-01-10 01:04:35,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-01-10 01:04:35,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:04:35,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:04:35,370 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:04:35,467 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:04:35,469 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:04:35,717 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:04:35,717 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:04:35,879 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:04:35,880 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:04:35,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:04:35 BoogieIcfgContainer [2025-01-10 01:04:35,880 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:04:35,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:04:35,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:04:35,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:04:35,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:04:35" (1/3) ... [2025-01-10 01:04:35,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32aaed73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:04:35, skipping insertion in model container [2025-01-10 01:04:35,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:35" (2/3) ... [2025-01-10 01:04:35,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32aaed73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:04:35, skipping insertion in model container [2025-01-10 01:04:35,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:04:35" (3/3) ... [2025-01-10 01:04:35,889 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier.wvr.c [2025-01-10 01:04:35,899 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:04:35,901 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier.wvr.c that has 7 procedures, 75 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-10 01:04:35,901 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:04:35,980 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-01-10 01:04:36,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 84 transitions, 234 flow [2025-01-10 01:04:36,048 INFO L124 PetriNetUnfolderBase]: 4/72 cut-off events. [2025-01-10 01:04:36,050 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:04:36,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 72 events. 4/72 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2025-01-10 01:04:36,054 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 84 transitions, 234 flow [2025-01-10 01:04:36,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 71 transitions, 190 flow [2025-01-10 01:04:36,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:04:36,073 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;@43135bcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:04:36,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-10 01:04:36,094 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:04:36,094 INFO L124 PetriNetUnfolderBase]: 4/68 cut-off events. [2025-01-10 01:04:36,094 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:04:36,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:36,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:36,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2025-01-10 01:04:36,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1563154494, now seen corresponding path program 1 times [2025-01-10 01:04:36,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:36,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643573324] [2025-01-10 01:04:36,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:36,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:36,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 01:04:36,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 01:04:36,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:36,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:36,465 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:04:36,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:36,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643573324] [2025-01-10 01:04:36,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643573324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:36,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:36,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:04:36,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35424516] [2025-01-10 01:04:36,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:36,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:04:36,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:36,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:04:36,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:04:36,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2025-01-10 01:04:36,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 71 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:04:36,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:36,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2025-01-10 01:04:36,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:38,189 INFO L124 PetriNetUnfolderBase]: 14053/19485 cut-off events. [2025-01-10 01:04:38,189 INFO L125 PetriNetUnfolderBase]: For 1965/1965 co-relation queries the response was YES. [2025-01-10 01:04:38,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41069 conditions, 19485 events. 14053/19485 cut-off events. For 1965/1965 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 109115 event pairs, 8277 based on Foata normal form. 489/18937 useless extension candidates. Maximal degree in co-relation 40672. Up to 13270 conditions per place. [2025-01-10 01:04:38,374 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 67 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2025-01-10 01:04:38,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 90 transitions, 391 flow [2025-01-10 01:04:38,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:04:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:04:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-01-10 01:04:38,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.571969696969697 [2025-01-10 01:04:38,389 INFO L175 Difference]: Start difference. First operand has 86 places, 71 transitions, 190 flow. Second operand 3 states and 151 transitions. [2025-01-10 01:04:38,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 90 transitions, 391 flow [2025-01-10 01:04:38,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 90 transitions, 345 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-01-10 01:04:38,475 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 168 flow [2025-01-10 01:04:38,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-01-10 01:04:38,478 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -11 predicate places. [2025-01-10 01:04:38,479 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 168 flow [2025-01-10 01:04:38,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:04:38,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:38,479 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:38,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:04:38,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2025-01-10 01:04:38,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:38,480 INFO L85 PathProgramCache]: Analyzing trace with hash 506626490, now seen corresponding path program 2 times [2025-01-10 01:04:38,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:38,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058762095] [2025-01-10 01:04:38,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:04:38,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:38,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 1 equivalence classes. [2025-01-10 01:04:38,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 01:04:38,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:04:38,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:38,706 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:04:38,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:38,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058762095] [2025-01-10 01:04:38,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058762095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:38,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:38,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:04:38,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695371556] [2025-01-10 01:04:38,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:38,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:04:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:38,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:04:38,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:04:38,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2025-01-10 01:04:38,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:04:38,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:38,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2025-01-10 01:04:38,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:39,924 INFO L124 PetriNetUnfolderBase]: 13081/18814 cut-off events. [2025-01-10 01:04:39,924 INFO L125 PetriNetUnfolderBase]: For 1234/1234 co-relation queries the response was YES. [2025-01-10 01:04:39,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37572 conditions, 18814 events. 13081/18814 cut-off events. For 1234/1234 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 113641 event pairs, 7989 based on Foata normal form. 316/17880 useless extension candidates. Maximal degree in co-relation 15654. Up to 13117 conditions per place. [2025-01-10 01:04:39,998 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 68 selfloop transitions, 4 changer transitions 0/91 dead transitions. [2025-01-10 01:04:39,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 91 transitions, 369 flow [2025-01-10 01:04:39,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:04:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:04:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-01-10 01:04:40,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.571969696969697 [2025-01-10 01:04:40,002 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 168 flow. Second operand 3 states and 151 transitions. [2025-01-10 01:04:40,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 91 transitions, 369 flow [2025-01-10 01:04:40,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:40,007 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 174 flow [2025-01-10 01:04:40,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2025-01-10 01:04:40,008 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -10 predicate places. [2025-01-10 01:04:40,008 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 174 flow [2025-01-10 01:04:40,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:04:40,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:40,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:40,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:04:40,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2025-01-10 01:04:40,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:40,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2103626852, now seen corresponding path program 3 times [2025-01-10 01:04:40,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:40,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987120424] [2025-01-10 01:04:40,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:04:40,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:40,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 1 equivalence classes. [2025-01-10 01:04:40,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 01:04:40,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:04:40,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:40,157 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:04:40,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:40,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987120424] [2025-01-10 01:04:40,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987120424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:40,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:40,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:04:40,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146607105] [2025-01-10 01:04:40,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:40,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:04:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:40,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:04:40,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:04:40,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2025-01-10 01:04:40,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:04:40,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:40,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2025-01-10 01:04:40,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:41,013 INFO L124 PetriNetUnfolderBase]: 11919/16775 cut-off events. [2025-01-10 01:04:41,013 INFO L125 PetriNetUnfolderBase]: For 1661/1683 co-relation queries the response was YES. [2025-01-10 01:04:41,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34598 conditions, 16775 events. 11919/16775 cut-off events. For 1661/1683 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 94819 event pairs, 7037 based on Foata normal form. 251/16050 useless extension candidates. Maximal degree in co-relation 13404. Up to 11081 conditions per place. [2025-01-10 01:04:41,075 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 69 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2025-01-10 01:04:41,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 379 flow [2025-01-10 01:04:41,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:04:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:04:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2025-01-10 01:04:41,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-01-10 01:04:41,077 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 174 flow. Second operand 3 states and 152 transitions. [2025-01-10 01:04:41,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 379 flow [2025-01-10 01:04:41,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 92 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:41,083 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 180 flow [2025-01-10 01:04:41,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2025-01-10 01:04:41,084 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, -9 predicate places. [2025-01-10 01:04:41,084 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 180 flow [2025-01-10 01:04:41,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:04:41,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:41,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:41,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:04:41,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2025-01-10 01:04:41,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:41,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1531433938, now seen corresponding path program 4 times [2025-01-10 01:04:41,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:41,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594638477] [2025-01-10 01:04:41,085 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:04:41,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:41,095 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-01-10 01:04:41,127 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 01:04:41,128 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:04:41,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:42,130 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:04:42,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:42,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594638477] [2025-01-10 01:04:42,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594638477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:42,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:42,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-01-10 01:04:42,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200784233] [2025-01-10 01:04:42,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:42,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:04:42,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:42,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:04:42,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:04:42,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 88 [2025-01-10 01:04:42,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 180 flow. Second operand has 22 states, 22 states have (on average 19.5) internal successors, (429), 22 states have internal predecessors, (429), 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:04:42,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:42,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 88 [2025-01-10 01:04:42,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:48,106 INFO L124 PetriNetUnfolderBase]: 56859/77026 cut-off events. [2025-01-10 01:04:48,106 INFO L125 PetriNetUnfolderBase]: For 9414/9414 co-relation queries the response was YES. [2025-01-10 01:04:48,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161828 conditions, 77026 events. 56859/77026 cut-off events. For 9414/9414 co-relation queries the response was YES. Maximal size of possible extension queue 1664. Compared 444952 event pairs, 5252 based on Foata normal form. 1/74107 useless extension candidates. Maximal degree in co-relation 82053. Up to 30832 conditions per place. [2025-01-10 01:04:48,565 INFO L140 encePairwiseOnDemand]: 68/88 looper letters, 437 selfloop transitions, 102 changer transitions 44/593 dead transitions. [2025-01-10 01:04:48,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 593 transitions, 2631 flow [2025-01-10 01:04:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-10 01:04:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-01-10 01:04:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 1213 transitions. [2025-01-10 01:04:48,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3725429975429975 [2025-01-10 01:04:48,573 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 180 flow. Second operand 37 states and 1213 transitions. [2025-01-10 01:04:48,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 593 transitions, 2631 flow [2025-01-10 01:04:48,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 593 transitions, 2599 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:48,669 INFO L231 Difference]: Finished difference. Result has 128 places, 178 transitions, 816 flow [2025-01-10 01:04:48,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=816, PETRI_PLACES=128, PETRI_TRANSITIONS=178} [2025-01-10 01:04:48,670 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 42 predicate places. [2025-01-10 01:04:48,670 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 178 transitions, 816 flow [2025-01-10 01:04:48,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 19.5) internal successors, (429), 22 states have internal predecessors, (429), 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:04:48,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:48,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:48,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:04:48,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2025-01-10 01:04:48,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:48,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1250733070, now seen corresponding path program 5 times [2025-01-10 01:04:48,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:48,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425060510] [2025-01-10 01:04:48,672 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:04:48,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:48,682 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 65 statements into 1 equivalence classes. [2025-01-10 01:04:48,689 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 01:04:48,690 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:04:48,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:48,758 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:04:48,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:48,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425060510] [2025-01-10 01:04:48,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425060510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:48,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:48,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:04:48,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764333375] [2025-01-10 01:04:48,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:48,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:04:48,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:48,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:04:48,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:04:48,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2025-01-10 01:04:48,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 178 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:04:48,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:48,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2025-01-10 01:04:48,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:50,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~f1_2~0=v_~f1_2~0_55} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~temp_5~0=v_~temp_5~0_39, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~temp_5~0, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), 209#true, Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, 22#L48true, 46#L76-4true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 76#L91-1true]) [2025-01-10 01:04:50,468 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is not cut-off event [2025-01-10 01:04:50,468 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2025-01-10 01:04:50,468 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2025-01-10 01:04:50,468 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2025-01-10 01:04:50,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64, ~f1_2~0=v_~f1_2~0_51} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), 209#true, Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, 46#L76-4true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 76#L91-1true, 64#L61true]) [2025-01-10 01:04:50,468 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is not cut-off event [2025-01-10 01:04:50,468 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2025-01-10 01:04:50,468 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2025-01-10 01:04:50,468 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2025-01-10 01:04:50,548 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~f1_2~0=v_~f1_2~0_55} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~temp_5~0=v_~temp_5~0_39, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~temp_5~0, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), 114#true, Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 46#L76-4true, 22#L48true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 76#L91-1true]) [2025-01-10 01:04:50,549 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,549 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,549 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,549 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64, ~f1_2~0=v_~f1_2~0_51} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), 114#true, Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 46#L76-4true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 76#L91-1true, 64#L61true]) [2025-01-10 01:04:50,550 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,550 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,550 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,550 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,577 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~f1_2~0=v_~f1_2~0_55} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~temp_5~0=v_~temp_5~0_39, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~temp_5~0, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, 22#L48true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 12#L77true, 76#L91-1true]) [2025-01-10 01:04:50,577 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,577 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,577 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,577 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64, ~f1_2~0=v_~f1_2~0_51} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 12#L77true, 76#L91-1true, 64#L61true]) [2025-01-10 01:04:50,578 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,578 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,578 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,578 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~f1_2~0=v_~f1_2~0_55} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~temp_5~0=v_~temp_5~0_39, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~temp_5~0, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), 18#L116true, Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, 22#L48true, 46#L76-4true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 76#L91-1true]) [2025-01-10 01:04:50,589 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,589 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,589 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,589 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64, ~f1_2~0=v_~f1_2~0_51} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), 18#L116true, Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, 46#L76-4true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 76#L91-1true, 64#L61true]) [2025-01-10 01:04:50,590 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,590 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,590 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,590 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2025-01-10 01:04:50,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~f1_2~0=v_~f1_2~0_55} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~temp_5~0=v_~temp_5~0_39, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~temp_5~0, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 22#L48true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 12#L77true, 76#L91-1true]) [2025-01-10 01:04:50,653 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,653 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,653 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,653 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64, ~f1_2~0=v_~f1_2~0_51} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 12#L77true, 76#L91-1true, 64#L61true]) [2025-01-10 01:04:50,654 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,654 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,654 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,654 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~f1_2~0=v_~f1_2~0_55} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~temp_5~0=v_~temp_5~0_39, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~temp_5~0, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, 18#L116true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 46#L76-4true, 22#L48true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 76#L91-1true]) [2025-01-10 01:04:50,665 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,665 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,665 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,665 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64, ~f1_2~0=v_~f1_2~0_51} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, 18#L116true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 46#L76-4true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 76#L91-1true, 64#L61true]) [2025-01-10 01:04:50,666 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,666 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,666 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,666 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~f1_2~0=v_~f1_2~0_55} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~temp_5~0=v_~temp_5~0_39, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~temp_5~0, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, 18#L116true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, 22#L48true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 12#L77true, 76#L91-1true]) [2025-01-10 01:04:50,688 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,688 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,688 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,688 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64, ~f1_2~0=v_~f1_2~0_51} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 18#L116true, 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 12#L77true, 76#L91-1true, 64#L61true]) [2025-01-10 01:04:50,688 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,688 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,689 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,689 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2025-01-10 01:04:50,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~f1_2~0=v_~f1_2~0_55} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72, ~temp_5~0=v_~temp_5~0_39, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~temp_5~0, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), 18#L116true, Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 22#L48true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 12#L77true, 76#L91-1true]) [2025-01-10 01:04:50,762 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is not cut-off event [2025-01-10 01:04:50,762 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2025-01-10 01:04:50,762 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2025-01-10 01:04:50,762 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2025-01-10 01:04:50,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64, ~f1_2~0=v_~f1_2~0_51} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), 18#L116true, Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 12#L77true, 76#L91-1true, 64#L61true]) [2025-01-10 01:04:50,763 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is not cut-off event [2025-01-10 01:04:50,763 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2025-01-10 01:04:50,763 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2025-01-10 01:04:50,763 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2025-01-10 01:04:51,587 INFO L124 PetriNetUnfolderBase]: 24273/36249 cut-off events. [2025-01-10 01:04:51,587 INFO L125 PetriNetUnfolderBase]: For 53803/54191 co-relation queries the response was YES. [2025-01-10 01:04:51,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97395 conditions, 36249 events. 24273/36249 cut-off events. For 53803/54191 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 245409 event pairs, 12894 based on Foata normal form. 1030/34394 useless extension candidates. Maximal degree in co-relation 80365. Up to 24200 conditions per place. [2025-01-10 01:04:51,909 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 95 selfloop transitions, 4 changer transitions 0/184 dead transitions. [2025-01-10 01:04:51,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 184 transitions, 1014 flow [2025-01-10 01:04:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:04:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:04:51,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-01-10 01:04:51,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2025-01-10 01:04:51,911 INFO L175 Difference]: Start difference. First operand has 128 places, 178 transitions, 816 flow. Second operand 3 states and 149 transitions. [2025-01-10 01:04:51,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 184 transitions, 1014 flow [2025-01-10 01:04:52,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 184 transitions, 1004 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-10 01:04:52,519 INFO L231 Difference]: Finished difference. Result has 125 places, 162 transitions, 743 flow [2025-01-10 01:04:52,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=743, PETRI_PLACES=125, PETRI_TRANSITIONS=162} [2025-01-10 01:04:52,521 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 39 predicate places. [2025-01-10 01:04:52,521 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 162 transitions, 743 flow [2025-01-10 01:04:52,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:04:52,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:52,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:52,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:04:52,522 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2025-01-10 01:04:52,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1905238980, now seen corresponding path program 6 times [2025-01-10 01:04:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:52,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010792634] [2025-01-10 01:04:52,524 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:04:52,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:52,536 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 65 statements into 1 equivalence classes. [2025-01-10 01:04:52,546 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 01:04:52,546 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 01:04:52,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:53,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010792634] [2025-01-10 01:04:53,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010792634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:53,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:53,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-01-10 01:04:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883822842] [2025-01-10 01:04:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:53,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:04:53,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:53,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:04:53,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:04:53,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 88 [2025-01-10 01:04:53,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 162 transitions, 743 flow. Second operand has 22 states, 22 states have (on average 19.5) internal successors, (429), 22 states have internal predecessors, (429), 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:04:53,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:53,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 88 [2025-01-10 01:04:53,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:00,514 INFO L124 PetriNetUnfolderBase]: 57558/78041 cut-off events. [2025-01-10 01:05:00,514 INFO L125 PetriNetUnfolderBase]: For 100171/100171 co-relation queries the response was YES. [2025-01-10 01:05:00,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221798 conditions, 78041 events. 57558/78041 cut-off events. For 100171/100171 co-relation queries the response was YES. Maximal size of possible extension queue 1598. Compared 443151 event pairs, 6273 based on Foata normal form. 1/75176 useless extension candidates. Maximal degree in co-relation 148246. Up to 42726 conditions per place. [2025-01-10 01:05:01,029 INFO L140 encePairwiseOnDemand]: 64/88 looper letters, 704 selfloop transitions, 241 changer transitions 20/975 dead transitions. [2025-01-10 01:05:01,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 975 transitions, 5433 flow [2025-01-10 01:05:01,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-01-10 01:05:01,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2025-01-10 01:05:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 2025 transitions. [2025-01-10 01:05:01,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3384024064171123 [2025-01-10 01:05:01,036 INFO L175 Difference]: Start difference. First operand has 125 places, 162 transitions, 743 flow. Second operand 68 states and 2025 transitions. [2025-01-10 01:05:01,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 975 transitions, 5433 flow [2025-01-10 01:05:03,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 975 transitions, 5357 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-01-10 01:05:03,183 INFO L231 Difference]: Finished difference. Result has 217 places, 395 transitions, 2600 flow [2025-01-10 01:05:03,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=2600, PETRI_PLACES=217, PETRI_TRANSITIONS=395} [2025-01-10 01:05:03,185 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 131 predicate places. [2025-01-10 01:05:03,185 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 395 transitions, 2600 flow [2025-01-10 01:05:03,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 19.5) internal successors, (429), 22 states have internal predecessors, (429), 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:03,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:03,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:03,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:05:03,186 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2025-01-10 01:05:03,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:03,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1067824980, now seen corresponding path program 7 times [2025-01-10 01:05:03,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:03,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164360111] [2025-01-10 01:05:03,187 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:05:03,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:03,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 01:05:03,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 01:05:03,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:03,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:03,969 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:03,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:03,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164360111] [2025-01-10 01:05:03,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164360111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:03,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:03,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-10 01:05:03,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979024381] [2025-01-10 01:05:03,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:03,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:05:03,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:03,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:05:03,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:05:03,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 88 [2025-01-10 01:05:03,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 395 transitions, 2600 flow. Second operand has 21 states, 21 states have (on average 19.61904761904762) internal successors, (412), 21 states have internal predecessors, (412), 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:03,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:03,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 88 [2025-01-10 01:05:03,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:14,717 INFO L124 PetriNetUnfolderBase]: 68627/92980 cut-off events. [2025-01-10 01:05:14,717 INFO L125 PetriNetUnfolderBase]: For 394239/394239 co-relation queries the response was YES. [2025-01-10 01:05:15,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328302 conditions, 92980 events. 68627/92980 cut-off events. For 394239/394239 co-relation queries the response was YES. Maximal size of possible extension queue 1771. Compared 537651 event pairs, 9356 based on Foata normal form. 1/89431 useless extension candidates. Maximal degree in co-relation 328231. Up to 50914 conditions per place. [2025-01-10 01:05:15,652 INFO L140 encePairwiseOnDemand]: 65/88 looper letters, 686 selfloop transitions, 344 changer transitions 33/1073 dead transitions. [2025-01-10 01:05:15,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1073 transitions, 8084 flow [2025-01-10 01:05:15,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-10 01:05:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-01-10 01:05:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 1755 transitions. [2025-01-10 01:05:15,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31655844155844154 [2025-01-10 01:05:15,659 INFO L175 Difference]: Start difference. First operand has 217 places, 395 transitions, 2600 flow. Second operand 63 states and 1755 transitions. [2025-01-10 01:05:15,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 1073 transitions, 8084 flow [2025-01-10 01:05:22,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 1073 transitions, 7361 flow, removed 278 selfloop flow, removed 3 redundant places. [2025-01-10 01:05:22,437 INFO L231 Difference]: Finished difference. Result has 302 places, 640 transitions, 5029 flow [2025-01-10 01:05:22,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=2123, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=5029, PETRI_PLACES=302, PETRI_TRANSITIONS=640} [2025-01-10 01:05:22,438 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 216 predicate places. [2025-01-10 01:05:22,438 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 640 transitions, 5029 flow [2025-01-10 01:05:22,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 19.61904761904762) internal successors, (412), 21 states have internal predecessors, (412), 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:22,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:22,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:22,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:05:22,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2025-01-10 01:05:22,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:22,443 INFO L85 PathProgramCache]: Analyzing trace with hash -619197446, now seen corresponding path program 8 times [2025-01-10 01:05:22,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:22,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779580836] [2025-01-10 01:05:22,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:22,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:22,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 1 equivalence classes. [2025-01-10 01:05:22,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 01:05:22,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:05:22,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:22,880 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:22,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:22,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779580836] [2025-01-10 01:05:22,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779580836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:05:22,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:05:22,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-10 01:05:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659966799] [2025-01-10 01:05:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:05:22,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:05:22,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:22,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:05:22,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:05:22,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 88 [2025-01-10 01:05:22,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 640 transitions, 5029 flow. Second operand has 21 states, 21 states have (on average 19.61904761904762) internal successors, (412), 21 states have internal predecessors, (412), 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:22,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:22,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 88 [2025-01-10 01:05:22,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand