./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:47:44,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:47:45,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:47:45,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:47:45,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:47:45,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:47:45,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:47:45,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:47:45,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:47:45,106 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:47:45,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:47:45,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:47:45,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:47:45,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:47:45,108 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:47:45,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:47:45,109 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:47:45,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:47:45,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:47:45,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:47:45,111 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:47:45,112 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:47:45,112 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:47:45,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:47:45,113 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:47:45,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:47:45,113 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:47:45,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:47:45,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:47:45,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:47:45,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:47:45,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:47:45,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:47:45,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:47:45,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:47:45,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:47:45,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:47:45,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:47:45,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:47:45,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:47:45,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:47:45,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:47:45,118 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c [2024-11-19 09:47:45,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:47:45,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:47:45,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:47:45,401 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:47:45,401 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:47:45,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-19 09:47:46,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:47:47,071 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:47:47,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-19 09:47:47,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c9c1576/d01e993397e3491f81724aa02a2c5df9/FLAGe279bba8d [2024-11-19 09:47:47,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c9c1576/d01e993397e3491f81724aa02a2c5df9 [2024-11-19 09:47:47,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:47:47,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:47:47,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:47:47,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:47:47,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:47:47,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:47:47" (1/1) ... [2024-11-19 09:47:47,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a255a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47, skipping insertion in model container [2024-11-19 09:47:47,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:47:47" (1/1) ... [2024-11-19 09:47:47,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:47:47,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:47:47,361 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:47:47,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:47:47,396 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:47:47,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47 WrapperNode [2024-11-19 09:47:47,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:47:47,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:47:47,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:47:47,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:47:47,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47" (1/1) ... [2024-11-19 09:47:47,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47" (1/1) ... [2024-11-19 09:47:47,436 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-19 09:47:47,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:47:47,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:47:47,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:47:47,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:47:47,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47" (1/1) ... [2024-11-19 09:47:47,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47" (1/1) ... [2024-11-19 09:47:47,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47" (1/1) ... [2024-11-19 09:47:47,478 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]. [2024-11-19 09:47:47,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47" (1/1) ... [2024-11-19 09:47:47,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47" (1/1) ... [2024-11-19 09:47:47,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47" (1/1) ... [2024-11-19 09:47:47,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47" (1/1) ... [2024-11-19 09:47:47,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47" (1/1) ... [2024-11-19 09:47:47,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47" (1/1) ... [2024-11-19 09:47:47,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:47:47,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:47:47,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:47:47,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:47:47,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47" (1/1) ... [2024-11-19 09:47:47,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:47:47,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:47:47,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:47:47,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:47:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:47:47,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 09:47:47,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 09:47:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 09:47:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 09:47:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 09:47:47,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 09:47:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:47:47,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:47:47,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:47:47,596 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:47:47,713 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:47:47,714 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:47:47,891 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:47:47,892 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:47:48,066 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:47:48,067 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:47:48,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:48 BoogieIcfgContainer [2024-11-19 09:47:48,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:47:48,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:47:48,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:47:48,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:47:48,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:47:47" (1/3) ... [2024-11-19 09:47:48,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c798808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:47:48, skipping insertion in model container [2024-11-19 09:47:48,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:47:47" (2/3) ... [2024-11-19 09:47:48,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c798808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:47:48, skipping insertion in model container [2024-11-19 09:47:48,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:48" (3/3) ... [2024-11-19 09:47:48,082 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2024-11-19 09:47:48,103 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:47:48,104 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 09:47:48,104 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:47:48,168 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 09:47:48,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 43 transitions, 107 flow [2024-11-19 09:47:48,243 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2024-11-19 09:47:48,244 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:47:48,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 4/40 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 75 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-19 09:47:48,250 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 43 transitions, 107 flow [2024-11-19 09:47:48,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 39 transitions, 96 flow [2024-11-19 09:47:48,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:47:48,272 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;@32e484c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:47:48,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-19 09:47:48,284 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:47:48,284 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2024-11-19 09:47:48,284 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:47:48,285 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:47:48,285 INFO L204 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] [2024-11-19 09:47:48,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:47:48,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:47:48,291 INFO L85 PathProgramCache]: Analyzing trace with hash 977588806, now seen corresponding path program 1 times [2024-11-19 09:47:48,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:47:48,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441543159] [2024-11-19 09:47:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:47:48,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:47:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:47:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:48,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:47:48,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441543159] [2024-11-19 09:47:48,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441543159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:47:48,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:47:48,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:47:48,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434915435] [2024-11-19 09:47:48,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:47:48,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:47:48,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:47:48,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:47:48,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:47:48,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2024-11-19 09:47:48,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:47:48,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:47:48,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2024-11-19 09:47:48,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:47:49,149 INFO L124 PetriNetUnfolderBase]: 476/950 cut-off events. [2024-11-19 09:47:49,149 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-19 09:47:49,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 950 events. 476/950 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5519 event pairs, 58 based on Foata normal form. 66/912 useless extension candidates. Maximal degree in co-relation 1486. Up to 403 conditions per place. [2024-11-19 09:47:49,167 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 39 selfloop transitions, 8 changer transitions 1/64 dead transitions. [2024-11-19 09:47:49,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 266 flow [2024-11-19 09:47:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:47:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:47:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-11-19 09:47:49,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162790697674418 [2024-11-19 09:47:49,186 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 96 flow. Second operand 5 states and 154 transitions. [2024-11-19 09:47:49,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 266 flow [2024-11-19 09:47:49,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 238 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:47:49,197 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 135 flow [2024-11-19 09:47:49,201 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2024-11-19 09:47:49,206 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2024-11-19 09:47:49,207 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 135 flow [2024-11-19 09:47:49,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:47:49,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:47:49,207 INFO L204 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] [2024-11-19 09:47:49,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:47:49,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:47:49,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:47:49,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1152325274, now seen corresponding path program 2 times [2024-11-19 09:47:49,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:47:49,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308745763] [2024-11-19 09:47:49,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:47:49,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:47:49,239 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:47:49,240 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:47:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:49,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:47:49,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308745763] [2024-11-19 09:47:49,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308745763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:47:49,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:47:49,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:47:49,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753348066] [2024-11-19 09:47:49,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:47:49,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:47:49,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:47:49,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:47:49,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:47:49,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2024-11-19 09:47:49,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:47:49,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:47:49,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2024-11-19 09:47:49,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:47:49,472 INFO L124 PetriNetUnfolderBase]: 632/1187 cut-off events. [2024-11-19 09:47:49,473 INFO L125 PetriNetUnfolderBase]: For 842/842 co-relation queries the response was YES. [2024-11-19 09:47:49,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2566 conditions, 1187 events. 632/1187 cut-off events. For 842/842 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6958 event pairs, 189 based on Foata normal form. 93/1144 useless extension candidates. Maximal degree in co-relation 1474. Up to 594 conditions per place. [2024-11-19 09:47:49,482 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 26 selfloop transitions, 5 changer transitions 1/50 dead transitions. [2024-11-19 09:47:49,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 224 flow [2024-11-19 09:47:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:47:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:47:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-19 09:47:49,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2024-11-19 09:47:49,485 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 135 flow. Second operand 3 states and 90 transitions. [2024-11-19 09:47:49,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 224 flow [2024-11-19 09:47:49,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:47:49,489 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 162 flow [2024-11-19 09:47:49,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2024-11-19 09:47:49,490 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2024-11-19 09:47:49,490 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 162 flow [2024-11-19 09:47:49,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:47:49,491 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:47:49,491 INFO L204 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] [2024-11-19 09:47:49,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:47:49,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:47:49,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:47:49,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1211040988, now seen corresponding path program 1 times [2024-11-19 09:47:49,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:47:49,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859877254] [2024-11-19 09:47:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:47:49,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:47:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:47:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:49,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:47:49,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859877254] [2024-11-19 09:47:49,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859877254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:47:49,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:47:49,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:47:49,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190543576] [2024-11-19 09:47:49,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:47:49,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:47:49,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:47:49,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:47:49,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:47:49,598 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2024-11-19 09:47:49,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:47:49,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:47:49,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2024-11-19 09:47:49,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:47:49,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [Black: 61#true, 42#L88-4true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 28#L46-2true, 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,821 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:47:49,821 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,821 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,822 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [Black: 61#true, 30#L42true, 42#L88-4true, 8#L56true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,822 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 09:47:49,822 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,822 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,822 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 09:47:49,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 16#L43-2true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L55-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,823 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:47:49,823 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,823 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,823 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,840 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [5#L89true, Black: 61#true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 28#L46-2true, 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,840 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,840 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,840 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,840 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [5#L89true, Black: 61#true, 30#L42true, 8#L56true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,841 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:47:49,841 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,841 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,841 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, Black: 61#true, 16#L43-2true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L55-2true, 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,842 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,842 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,842 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,842 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [Black: 61#true, 42#L88-4true, 15#thread3EXITtrue, 28#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L55-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,843 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,843 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,843 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,843 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [Black: 61#true, 30#L42true, 42#L88-4true, 8#L56true, 15#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,844 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:47:49,844 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,844 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,844 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 15#thread3EXITtrue, 16#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L55-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,845 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,845 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,845 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,845 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [Black: 61#true, 42#L88-4true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 28#L46-2true, 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,852 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:47:49,853 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,853 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,853 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,853 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [Black: 61#true, 30#L42true, 8#L56true, 42#L88-4true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,854 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 09:47:49,854 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,854 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,854 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 09:47:49,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 16#L43-2true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L55-2true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,855 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:47:49,855 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,855 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,855 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [5#L89true, Black: 61#true, 15#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), 28#L46-2true, 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,859 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:47:49,860 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:49,860 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:49,860 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [5#L89true, Black: 61#true, 30#L42true, 8#L56true, 15#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,861 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,861 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,861 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,862 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, Black: 61#true, 15#thread3EXITtrue, 16#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L55-2true, 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,862 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:47:49,862 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:49,862 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:49,863 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,869 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([250] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [Black: 61#true, 30#L42true, 42#L88-4true, 8#L56true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,869 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:47:49,869 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:49,870 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,870 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,870 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 09:47:49,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [5#L89true, Black: 61#true, 14#L69-1true, 28#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,871 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,871 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,871 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,871 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [5#L89true, Black: 61#true, 30#L42true, 8#L56true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,872 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:47:49,872 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,872 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,872 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, Black: 61#true, 14#L69-1true, 16#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,873 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,873 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,873 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,873 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [Black: 61#true, 42#L88-4true, 15#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), 28#L46-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L55-2true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,874 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,874 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,874 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,875 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 15#thread3EXITtrue, 16#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L55-2true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,875 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,875 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,876 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,876 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][14], [Black: 61#true, 5#L89true, 9#L57true, 14#L69-1true, 16#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2024-11-19 09:47:49,879 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,879 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,879 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,879 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:49,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][34], [Black: 61#true, 5#L89true, 9#L57true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 28#L46-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2024-11-19 09:47:49,880 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,880 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,880 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:49,881 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,881 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 14#L69-1true, 16#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L55-2true, 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,881 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,882 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,882 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,882 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:47:49,882 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,883 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [Black: 61#true, 42#L88-4true, 14#L69-1true, 28#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L55-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,883 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,884 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,884 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,884 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,884 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:47:49,885 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([250] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [5#L89true, Black: 61#true, 30#L42true, 8#L56true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,885 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,885 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:47:49,886 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,886 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,886 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-19 09:47:49,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [5#L89true, Black: 61#true, 15#thread3EXITtrue, 28#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L55-2true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,887 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:47:49,887 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:49,887 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:49,887 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,887 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, Black: 61#true, 15#thread3EXITtrue, 16#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,888 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:47:49,888 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:49,888 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:49,888 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,889 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, Black: 61#true, 16#L43-2true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,889 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:47:49,890 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,890 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,890 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,890 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,891 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [5#L89true, Black: 61#true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 28#L46-2true, 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:49,891 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:47:49,891 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,891 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:49,892 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:49,892 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:47:49,893 INFO L124 PetriNetUnfolderBase]: 1351/2331 cut-off events. [2024-11-19 09:47:49,893 INFO L125 PetriNetUnfolderBase]: For 1765/1821 co-relation queries the response was YES. [2024-11-19 09:47:49,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5648 conditions, 2331 events. 1351/2331 cut-off events. For 1765/1821 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14314 event pairs, 441 based on Foata normal form. 11/1861 useless extension candidates. Maximal degree in co-relation 3065. Up to 905 conditions per place. [2024-11-19 09:47:49,912 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 34 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-11-19 09:47:49,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 292 flow [2024-11-19 09:47:49,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:47:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:47:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-19 09:47:49,916 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.751937984496124 [2024-11-19 09:47:49,917 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 162 flow. Second operand 3 states and 97 transitions. [2024-11-19 09:47:49,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 292 flow [2024-11-19 09:47:49,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:47:49,928 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 174 flow [2024-11-19 09:47:49,928 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2024-11-19 09:47:49,929 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2024-11-19 09:47:49,930 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 174 flow [2024-11-19 09:47:49,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:47:49,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:47:49,931 INFO L204 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] [2024-11-19 09:47:49,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:47:49,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:47:49,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:47:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1155677335, now seen corresponding path program 1 times [2024-11-19 09:47:49,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:47:49,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524813662] [2024-11-19 09:47:49,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:47:49,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:47:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:47:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:50,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:47:50,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524813662] [2024-11-19 09:47:50,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524813662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:47:50,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:47:50,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:47:50,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438061610] [2024-11-19 09:47:50,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:47:50,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:47:50,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:47:50,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:47:50,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:47:50,023 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2024-11-19 09:47:50,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:47:50,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:47:50,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2024-11-19 09:47:50,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:47:50,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][8], [Black: 61#true, 30#L42true, 8#L56true, Black: 68#(<= 1 (mod ~d2~0 256)), 3#L88-3true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 71#true, Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:50,180 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:47:50,180 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:50,180 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:50,180 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:50,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][8], [Black: 61#true, 30#L42true, 42#L88-4true, 8#L56true, Black: 68#(<= 1 (mod ~d2~0 256)), 66#true, 22#$Ultimate##0true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 71#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:50,192 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:47:50,192 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:50,192 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:50,192 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:50,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][8], [Black: 61#true, 5#L89true, 30#L42true, 8#L56true, Black: 68#(<= 1 (mod ~d2~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 22#$Ultimate##0true, 66#true, Black: 54#(<= 0 ~pos~0), 71#true, Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:50,206 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:47:50,206 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:47:50,206 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:50,206 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:50,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][8], [5#L89true, Black: 61#true, 30#L42true, 8#L56true, Black: 68#(<= 1 (mod ~d2~0 256)), 14#L69-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 71#true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:50,226 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 09:47:50,226 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:47:50,226 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:47:50,226 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:47:50,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][8], [Black: 61#true, 30#L42true, 42#L88-4true, 8#L56true, 15#thread3EXITtrue, Black: 68#(<= 1 (mod ~d2~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 71#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:50,227 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 09:47:50,227 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:47:50,227 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:47:50,227 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:47:50,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][8], [5#L89true, Black: 61#true, 30#L42true, 8#L56true, 15#thread3EXITtrue, Black: 68#(<= 1 (mod ~d2~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 71#true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-19 09:47:50,230 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 09:47:50,230 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:47:50,230 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:47:50,230 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:47:50,233 INFO L124 PetriNetUnfolderBase]: 1020/2054 cut-off events. [2024-11-19 09:47:50,233 INFO L125 PetriNetUnfolderBase]: For 1109/1189 co-relation queries the response was YES. [2024-11-19 09:47:50,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4817 conditions, 2054 events. 1020/2054 cut-off events. For 1109/1189 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 13660 event pairs, 400 based on Foata normal form. 9/1836 useless extension candidates. Maximal degree in co-relation 2488. Up to 751 conditions per place. [2024-11-19 09:47:50,252 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 32 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-11-19 09:47:50,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 287 flow [2024-11-19 09:47:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:47:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:47:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-19 09:47:50,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.751937984496124 [2024-11-19 09:47:50,254 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 174 flow. Second operand 3 states and 97 transitions. [2024-11-19 09:47:50,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 287 flow [2024-11-19 09:47:50,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:47:50,258 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 190 flow [2024-11-19 09:47:50,258 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2024-11-19 09:47:50,259 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-11-19 09:47:50,259 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 190 flow [2024-11-19 09:47:50,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:47:50,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:47:50,260 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:47:50,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:47:50,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:47:50,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:47:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash 431165028, now seen corresponding path program 1 times [2024-11-19 09:47:50,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:47:50,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384050692] [2024-11-19 09:47:50,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:47:50,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:47:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:47:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:50,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:47:50,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384050692] [2024-11-19 09:47:50,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384050692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:47:50,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550789577] [2024-11-19 09:47:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:47:50,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:47:50,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:47:50,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:47:50,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:47:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:47:50,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:47:50,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:47:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:50,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:47:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:50,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550789577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:47:50,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:47:50,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 9 [2024-11-19 09:47:50,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835219930] [2024-11-19 09:47:50,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:47:50,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:47:50,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:47:50,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:47:50,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:47:50,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-11-19 09:47:50,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 190 flow. Second operand has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 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) [2024-11-19 09:47:50,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:47:50,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-11-19 09:47:50,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:47:51,605 INFO L124 PetriNetUnfolderBase]: 3578/6342 cut-off events. [2024-11-19 09:47:51,606 INFO L125 PetriNetUnfolderBase]: For 4983/4983 co-relation queries the response was YES. [2024-11-19 09:47:51,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16551 conditions, 6342 events. 3578/6342 cut-off events. For 4983/4983 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 44482 event pairs, 253 based on Foata normal form. 148/6189 useless extension candidates. Maximal degree in co-relation 11346. Up to 1177 conditions per place. [2024-11-19 09:47:51,642 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 56 selfloop transitions, 16 changer transitions 53/140 dead transitions. [2024-11-19 09:47:51,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 140 transitions, 784 flow [2024-11-19 09:47:51,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:47:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:47:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 300 transitions. [2024-11-19 09:47:51,645 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2024-11-19 09:47:51,645 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 190 flow. Second operand 12 states and 300 transitions. [2024-11-19 09:47:51,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 140 transitions, 784 flow [2024-11-19 09:47:51,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 140 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:47:51,657 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 288 flow [2024-11-19 09:47:51,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=288, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2024-11-19 09:47:51,658 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2024-11-19 09:47:51,658 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 288 flow [2024-11-19 09:47:51,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 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) [2024-11-19 09:47:51,659 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:47:51,659 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:47:51,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 09:47:51,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:47:51,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:47:51,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:47:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash 537726017, now seen corresponding path program 1 times [2024-11-19 09:47:51,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:47:51,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599184428] [2024-11-19 09:47:51,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:47:51,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:47:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:47:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:52,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:47:52,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599184428] [2024-11-19 09:47:52,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599184428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:47:52,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121491589] [2024-11-19 09:47:52,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:47:52,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:47:52,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:47:52,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:47:52,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:47:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:47:52,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:47:52,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:47:52,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:52,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:47:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:52,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121491589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:47:52,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:47:52,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 8 [2024-11-19 09:47:52,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867596509] [2024-11-19 09:47:52,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:47:52,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:47:52,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:47:52,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:47:52,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:47:52,251 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-11-19 09:47:52,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 288 flow. Second operand has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:47:52,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:47:52,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-11-19 09:47:52,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:47:52,877 INFO L124 PetriNetUnfolderBase]: 2314/4350 cut-off events. [2024-11-19 09:47:52,878 INFO L125 PetriNetUnfolderBase]: For 16868/16940 co-relation queries the response was YES. [2024-11-19 09:47:52,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15444 conditions, 4350 events. 2314/4350 cut-off events. For 16868/16940 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 30095 event pairs, 151 based on Foata normal form. 170/4237 useless extension candidates. Maximal degree in co-relation 13038. Up to 1195 conditions per place. [2024-11-19 09:47:52,916 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 55 selfloop transitions, 24 changer transitions 33/129 dead transitions. [2024-11-19 09:47:52,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 129 transitions, 999 flow [2024-11-19 09:47:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:47:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:47:52,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 266 transitions. [2024-11-19 09:47:52,918 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6186046511627907 [2024-11-19 09:47:52,918 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 288 flow. Second operand 10 states and 266 transitions. [2024-11-19 09:47:52,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 129 transitions, 999 flow [2024-11-19 09:47:52,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 129 transitions, 908 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-11-19 09:47:52,942 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 487 flow [2024-11-19 09:47:52,942 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=487, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2024-11-19 09:47:52,944 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2024-11-19 09:47:52,945 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 487 flow [2024-11-19 09:47:52,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:47:52,945 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:47:52,945 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:47:52,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:47:53,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 09:47:53,147 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:47:53,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:47:53,148 INFO L85 PathProgramCache]: Analyzing trace with hash 171162274, now seen corresponding path program 2 times [2024-11-19 09:47:53,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:47:53,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979048057] [2024-11-19 09:47:53,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:47:53,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:47:53,169 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:47:53,169 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:47:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:47:53,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:47:53,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979048057] [2024-11-19 09:47:53,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979048057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:47:53,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:47:53,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:47:53,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190181802] [2024-11-19 09:47:53,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:47:53,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:47:53,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:47:53,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:47:53,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:47:53,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2024-11-19 09:47:53,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 487 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:47:53,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:47:53,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2024-11-19 09:47:53,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:47:53,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([241] L41-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0) (= (mod v_~v_assert~0_29 256) 0)) InVars {~v_assert~0=v_~v_assert~0_29} OutVars{~v_assert~0=v_~v_assert~0_29, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][61], [Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 63#(<= 1 (mod ~v_assert~0 256)), 18#thread1EXITtrue, Black: 66#true, 14#L69-1true, Black: 73#(<= 1 (mod ~d1~0 256)), 290#true, 5#L89true, 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 90#(or (= ~d1~0 1) (= ~d1~0 0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), 505#true, Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-19 09:47:53,692 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-19 09:47:53,692 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:47:53,692 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 09:47:53,692 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:47:53,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][58], [278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, 14#L69-1true, Black: 73#(<= 1 (mod ~d1~0 256)), 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, 28#L46-2true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 54#(<= 0 ~pos~0), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-19 09:47:53,749 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-19 09:47:53,749 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,749 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,749 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,750 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, 16#L43-2true, 14#L69-1true, Black: 71#true, 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-19 09:47:53,750 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-19 09:47:53,750 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,750 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,750 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][58], [Black: 61#true, 278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, Black: 73#(<= 1 (mod ~d1~0 256)), 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 15#thread3EXITtrue, Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, 28#L46-2true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-19 09:47:53,764 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-19 09:47:53,764 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:47:53,765 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:47:53,765 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:47:53,765 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][58], [Black: 61#true, 278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, 14#L69-1true, Black: 73#(<= 1 (mod ~d1~0 256)), 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, 28#L46-2true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-19 09:47:53,765 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-19 09:47:53,765 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-19 09:47:53,765 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,765 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,766 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [Black: 61#true, 278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, 16#L43-2true, Black: 71#true, 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 15#thread3EXITtrue, Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 54#(<= 0 ~pos~0), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-19 09:47:53,766 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-19 09:47:53,766 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:47:53,766 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:47:53,767 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:47:53,767 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, 16#L43-2true, 14#L69-1true, Black: 71#true, 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 54#(<= 0 ~pos~0), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-19 09:47:53,767 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-19 09:47:53,767 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,767 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-19 09:47:53,767 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,768 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][58], [Black: 61#true, 278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 42#L88-4true, Black: 66#true, Black: 73#(<= 1 (mod ~d1~0 256)), 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, 15#thread3EXITtrue, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, 28#L46-2true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-19 09:47:53,768 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-19 09:47:53,768 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,768 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,769 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 42#L88-4true, Black: 66#true, 16#L43-2true, Black: 71#true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, 15#thread3EXITtrue, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-19 09:47:53,769 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-19 09:47:53,769 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,769 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,769 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:47:53,784 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][58], [278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, Black: 73#(<= 1 (mod ~d1~0 256)), 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, 15#thread3EXITtrue, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, 28#L46-2true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 54#(<= 0 ~pos~0), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-19 09:47:53,785 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-19 09:47:53,785 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:47:53,785 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:47:53,785 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:47:53,785 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-19 09:47:53,785 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, 16#L43-2true, Black: 71#true, 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 15#thread3EXITtrue, Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 54#(<= 0 ~pos~0), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-19 09:47:53,785 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-19 09:47:53,786 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:47:53,786 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:47:53,786 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:47:53,786 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-19 09:47:53,801 INFO L124 PetriNetUnfolderBase]: 2178/3841 cut-off events. [2024-11-19 09:47:53,801 INFO L125 PetriNetUnfolderBase]: For 28929/30665 co-relation queries the response was YES. [2024-11-19 09:47:53,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16239 conditions, 3841 events. 2178/3841 cut-off events. For 28929/30665 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 25223 event pairs, 663 based on Foata normal form. 113/3138 useless extension candidates. Maximal degree in co-relation 12766. Up to 1378 conditions per place. [2024-11-19 09:47:53,840 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 62 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2024-11-19 09:47:53,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 884 flow [2024-11-19 09:47:53,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:47:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:47:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-11-19 09:47:53,841 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7674418604651163 [2024-11-19 09:47:53,841 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 487 flow. Second operand 4 states and 132 transitions. [2024-11-19 09:47:53,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 884 flow [2024-11-19 09:47:53,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 777 flow, removed 48 selfloop flow, removed 6 redundant places. [2024-11-19 09:47:53,866 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 462 flow [2024-11-19 09:47:53,867 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=462, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2024-11-19 09:47:53,867 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2024-11-19 09:47:53,867 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 462 flow [2024-11-19 09:47:53,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:47:53,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:47:53,868 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:47:53,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:47:53,868 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:47:53,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:47:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1316441462, now seen corresponding path program 2 times [2024-11-19 09:47:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:47:53,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666210384] [2024-11-19 09:47:53,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:47:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:47:53,894 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:47:53,898 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:47:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:47:53,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:47:53,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666210384] [2024-11-19 09:47:53,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666210384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:47:54,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:47:54,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:47:54,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369454869] [2024-11-19 09:47:54,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:47:54,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:47:54,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:47:54,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:47:54,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:47:54,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2024-11-19 09:47:54,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 462 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:47:54,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:47:54,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2024-11-19 09:47:54,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:47:54,088 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), 42#L88-4true, Black: 66#true, 16#L43-2true, 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 71#true, 54#(<= 0 ~pos~0), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, 512#true, 22#$Ultimate##0true, Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 507#(= (mod ~d2~0 256) 0), Black: 508#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-11-19 09:47:54,089 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-19 09:47:54,089 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-19 09:47:54,089 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-19 09:47:54,089 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-19 09:47:54,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 66#true, 16#L43-2true, 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 71#true, 54#(<= 0 ~pos~0), 5#L89true, 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 505#true, Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 512#true, 22#$Ultimate##0true, Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 507#(= (mod ~d2~0 256) 0), Black: 508#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-11-19 09:47:54,093 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-19 09:47:54,093 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-19 09:47:54,094 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-19 09:47:54,094 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-19 09:47:54,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 42#L88-4true, Black: 66#true, 16#L43-2true, 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 71#true, 508#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 512#true, 22#$Ultimate##0true, Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 505#true, Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 507#(= (mod ~d2~0 256) 0)]) [2024-11-19 09:47:54,139 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:47:54,139 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:54,140 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:47:54,140 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:47:54,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, 16#L43-2true, 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 71#true, 508#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 512#true, 22#$Ultimate##0true, Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 505#true, Black: 507#(= (mod ~d2~0 256) 0)]) [2024-11-19 09:47:54,147 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:47:54,148 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:54,148 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:47:54,148 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:47:54,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][54], [Black: 61#true, 278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 68#(<= 1 (mod ~d2~0 256)), Black: 73#(<= 1 (mod ~d1~0 256)), 514#(= (mod ~d1~0 256) 0), 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 507#(= (mod ~d2~0 256) 0), 28#L46-2true, 22#$Ultimate##0true, Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 505#true, Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 508#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-11-19 09:47:54,271 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-19 09:47:54,271 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:54,271 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:54,271 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:47:54,333 INFO L124 PetriNetUnfolderBase]: 1045/2438 cut-off events. [2024-11-19 09:47:54,333 INFO L125 PetriNetUnfolderBase]: For 6942/7380 co-relation queries the response was YES. [2024-11-19 09:47:54,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8540 conditions, 2438 events. 1045/2438 cut-off events. For 6942/7380 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 17276 event pairs, 340 based on Foata normal form. 72/2314 useless extension candidates. Maximal degree in co-relation 4107. Up to 532 conditions per place. [2024-11-19 09:47:54,359 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 46 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2024-11-19 09:47:54,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 620 flow [2024-11-19 09:47:54,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:47:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:47:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-11-19 09:47:54,361 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7383720930232558 [2024-11-19 09:47:54,361 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 462 flow. Second operand 4 states and 127 transitions. [2024-11-19 09:47:54,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 620 flow [2024-11-19 09:47:54,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 620 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:47:54,370 INFO L231 Difference]: Finished difference. Result has 72 places, 68 transitions, 483 flow [2024-11-19 09:47:54,370 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=483, PETRI_PLACES=72, PETRI_TRANSITIONS=68} [2024-11-19 09:47:54,372 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2024-11-19 09:47:54,373 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 68 transitions, 483 flow [2024-11-19 09:47:54,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:47:54,373 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:47:54,374 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:47:54,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:47:54,374 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:47:54,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:47:54,375 INFO L85 PathProgramCache]: Analyzing trace with hash -50902707, now seen corresponding path program 1 times [2024-11-19 09:47:54,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:47:54,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549885813] [2024-11-19 09:47:54,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:47:54,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:47:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:47:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:54,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:47:54,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549885813] [2024-11-19 09:47:54,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549885813] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:47:54,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455510616] [2024-11-19 09:47:54,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:47:54,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:47:54,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:47:54,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:47:54,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 09:47:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:47:54,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 09:47:54,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:47:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:54,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:47:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:54,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455510616] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:47:54,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:47:54,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 12 [2024-11-19 09:47:54,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861938967] [2024-11-19 09:47:54,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:47:54,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:47:54,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:47:54,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:47:54,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:47:54,871 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-19 09:47:54,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 483 flow. Second operand has 12 states, 12 states have (on average 18.0) internal successors, (216), 12 states have internal predecessors, (216), 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) [2024-11-19 09:47:54,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:47:54,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-19 09:47:54,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:47:56,498 INFO L124 PetriNetUnfolderBase]: 5799/10379 cut-off events. [2024-11-19 09:47:56,499 INFO L125 PetriNetUnfolderBase]: For 45065/45145 co-relation queries the response was YES. [2024-11-19 09:47:56,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42449 conditions, 10379 events. 5799/10379 cut-off events. For 45065/45145 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 74004 event pairs, 581 based on Foata normal form. 236/10525 useless extension candidates. Maximal degree in co-relation 18600. Up to 2126 conditions per place. [2024-11-19 09:47:56,587 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 93 selfloop transitions, 55 changer transitions 68/230 dead transitions. [2024-11-19 09:47:56,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 230 transitions, 2135 flow [2024-11-19 09:47:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:47:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-19 09:47:56,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 384 transitions. [2024-11-19 09:47:56,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-11-19 09:47:56,590 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 483 flow. Second operand 16 states and 384 transitions. [2024-11-19 09:47:56,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 230 transitions, 2135 flow [2024-11-19 09:47:56,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 230 transitions, 2135 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:47:56,616 INFO L231 Difference]: Finished difference. Result has 96 places, 104 transitions, 1151 flow [2024-11-19 09:47:56,616 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1151, PETRI_PLACES=96, PETRI_TRANSITIONS=104} [2024-11-19 09:47:56,617 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2024-11-19 09:47:56,617 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 104 transitions, 1151 flow [2024-11-19 09:47:56,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.0) internal successors, (216), 12 states have internal predecessors, (216), 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) [2024-11-19 09:47:56,617 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:47:56,618 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:47:56,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 09:47:56,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:47:56,823 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:47:56,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:47:56,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1218854905, now seen corresponding path program 2 times [2024-11-19 09:47:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:47:56,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558262909] [2024-11-19 09:47:56,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:47:56,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:47:56,853 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:47:56,857 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:47:57,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:57,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:47:57,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558262909] [2024-11-19 09:47:57,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558262909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:47:57,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668606216] [2024-11-19 09:47:57,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:47:57,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:47:57,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:47:57,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:47:57,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 09:47:57,126 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:47:57,127 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:47:57,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 09:47:57,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:47:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:57,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:47:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:47:57,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668606216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:47:57,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:47:57,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 13 [2024-11-19 09:47:57,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171009803] [2024-11-19 09:47:57,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:47:57,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:47:57,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:47:57,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:47:57,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:47:57,535 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-11-19 09:47:57,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 104 transitions, 1151 flow. Second operand has 13 states, 13 states have (on average 17.615384615384617) internal successors, (229), 13 states have internal predecessors, (229), 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) [2024-11-19 09:47:57,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:47:57,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-11-19 09:47:57,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:47:59,504 INFO L124 PetriNetUnfolderBase]: 7510/12740 cut-off events. [2024-11-19 09:47:59,504 INFO L125 PetriNetUnfolderBase]: For 86359/86471 co-relation queries the response was YES. [2024-11-19 09:47:59,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57716 conditions, 12740 events. 7510/12740 cut-off events. For 86359/86471 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 86569 event pairs, 633 based on Foata normal form. 260/12978 useless extension candidates. Maximal degree in co-relation 57687. Up to 4702 conditions per place. [2024-11-19 09:47:59,552 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 0 selfloop transitions, 0 changer transitions 236/236 dead transitions. [2024-11-19 09:47:59,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 236 transitions, 2877 flow [2024-11-19 09:47:59,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:47:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-19 09:47:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 289 transitions. [2024-11-19 09:47:59,554 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.516994633273703 [2024-11-19 09:47:59,554 INFO L175 Difference]: Start difference. First operand has 96 places, 104 transitions, 1151 flow. Second operand 13 states and 289 transitions. [2024-11-19 09:47:59,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 236 transitions, 2877 flow [2024-11-19 09:47:59,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 236 transitions, 2452 flow, removed 201 selfloop flow, removed 10 redundant places. [2024-11-19 09:47:59,692 INFO L231 Difference]: Finished difference. Result has 86 places, 0 transitions, 0 flow [2024-11-19 09:47:59,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=86, PETRI_TRANSITIONS=0} [2024-11-19 09:47:59,693 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 41 predicate places. [2024-11-19 09:47:59,693 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 0 transitions, 0 flow [2024-11-19 09:47:59,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.615384615384617) internal successors, (229), 13 states have internal predecessors, (229), 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) [2024-11-19 09:47:59,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-19 09:47:59,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-19 09:47:59,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-19 09:47:59,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-19 09:47:59,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-19 09:47:59,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 09:47:59,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:47:59,899 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1] [2024-11-19 09:47:59,903 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:47:59,903 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:47:59,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:47:59 BasicIcfg [2024-11-19 09:47:59,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:47:59,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:47:59,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:47:59,914 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:47:59,916 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:47:48" (3/4) ... [2024-11-19 09:47:59,919 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 09:47:59,922 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 09:47:59,922 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 09:47:59,922 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 09:47:59,926 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2024-11-19 09:47:59,927 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-19 09:47:59,927 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-19 09:47:59,927 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 09:48:00,011 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 09:48:00,012 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 09:48:00,012 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:48:00,012 INFO L158 Benchmark]: Toolchain (without parser) took 12917.96ms. Allocated memory was 192.9MB in the beginning and 1.1GB in the end (delta: 885.0MB). Free memory was 121.2MB in the beginning and 763.4MB in the end (delta: -642.1MB). Peak memory consumption was 245.8MB. Max. memory is 16.1GB. [2024-11-19 09:48:00,013 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:48:00,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.85ms. Allocated memory is still 192.9MB. Free memory was 121.1MB in the beginning and 107.9MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 09:48:00,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.33ms. Allocated memory is still 192.9MB. Free memory was 107.9MB in the beginning and 106.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:48:00,014 INFO L158 Benchmark]: Boogie Preprocessor took 60.64ms. Allocated memory is still 192.9MB. Free memory was 106.1MB in the beginning and 104.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:48:00,014 INFO L158 Benchmark]: RCFGBuilder took 569.13ms. Allocated memory is still 192.9MB. Free memory was 104.0MB in the beginning and 157.2MB in the end (delta: -53.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 09:48:00,014 INFO L158 Benchmark]: TraceAbstraction took 11841.56ms. Allocated memory was 192.9MB in the beginning and 1.1GB in the end (delta: 885.0MB). Free memory was 156.1MB in the beginning and 768.8MB in the end (delta: -612.7MB). Peak memory consumption was 334.4MB. Max. memory is 16.1GB. [2024-11-19 09:48:00,014 INFO L158 Benchmark]: Witness Printer took 97.97ms. Allocated memory is still 1.1GB. Free memory was 768.8MB in the beginning and 763.4MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 09:48:00,016 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.85ms. Allocated memory is still 192.9MB. Free memory was 121.1MB in the beginning and 107.9MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.33ms. Allocated memory is still 192.9MB. Free memory was 107.9MB in the beginning and 106.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.64ms. Allocated memory is still 192.9MB. Free memory was 106.1MB in the beginning and 104.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 569.13ms. Allocated memory is still 192.9MB. Free memory was 104.0MB in the beginning and 157.2MB in the end (delta: -53.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11841.56ms. Allocated memory was 192.9MB in the beginning and 1.1GB in the end (delta: 885.0MB). Free memory was 156.1MB in the beginning and 768.8MB in the end (delta: -612.7MB). Peak memory consumption was 334.4MB. Max. memory is 16.1GB. * Witness Printer took 97.97ms. Allocated memory is still 1.1GB. Free memory was 768.8MB in the beginning and 763.4MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 74]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 63 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.7s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 650 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 615 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 180 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1766 IncrementalHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 25 mSDtfsCounter, 1766 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 377 GetRequests, 280 SyntacticMatches, 16 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1151occurred in iteration=9, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 466 NumberOfCodeBlocks, 466 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 594 ConstructedInterpolants, 0 QuantifiedInterpolants, 1616 SizeOfPredicates, 22 NumberOfNonLiveVariables, 652 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 74/119 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 09:48:00,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE