./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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-ticket-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 ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:26:03,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:26:03,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 16:26:03,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:26:03,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:26:03,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:26:03,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:26:03,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:26:03,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:26:03,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:26:03,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:26:03,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:26:03,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:26:03,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:26:03,904 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:26:03,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:26:03,905 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:26:03,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:26:03,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:26:03,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:26:03,906 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:26:03,906 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:26:03,907 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:26:03,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:26:03,907 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:26:03,907 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:26:03,908 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:26:03,908 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:26:03,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:26:03,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:26:03,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:26:03,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:26:03,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:26:03,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:26:03,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:26:03,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:26:03,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:26:03,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:26:03,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:26:03,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:26:03,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:26:03,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:26:03,912 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 -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2024-11-12 16:26:04,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:26:04,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:26:04,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:26:04,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:26:04,141 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:26:04,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-12 16:26:05,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:26:05,615 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:26:05,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-12 16:26:05,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3bc9f7f0/0d26c98a6b6846f286a4f4c766796ef6/FLAG7872ab343 [2024-11-12 16:26:05,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3bc9f7f0/0d26c98a6b6846f286a4f4c766796ef6 [2024-11-12 16:26:05,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:26:05,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:26:05,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:26:05,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:26:05,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:26:05,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:26:05" (1/1) ... [2024-11-12 16:26:05,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51a4198c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05, skipping insertion in model container [2024-11-12 16:26:05,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:26:05" (1/1) ... [2024-11-12 16:26:05,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:26:05,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:26:05,862 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:26:05,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:26:05,897 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:26:05,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05 WrapperNode [2024-11-12 16:26:05,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:26:05,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:26:05,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:26:05,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:26:05,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05" (1/1) ... [2024-11-12 16:26:05,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05" (1/1) ... [2024-11-12 16:26:05,931 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 174 [2024-11-12 16:26:05,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:26:05,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:26:05,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:26:05,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:26:05,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05" (1/1) ... [2024-11-12 16:26:05,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05" (1/1) ... [2024-11-12 16:26:05,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05" (1/1) ... [2024-11-12 16:26:05,956 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-12 16:26:05,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05" (1/1) ... [2024-11-12 16:26:05,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05" (1/1) ... [2024-11-12 16:26:05,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05" (1/1) ... [2024-11-12 16:26:05,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05" (1/1) ... [2024-11-12 16:26:05,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05" (1/1) ... [2024-11-12 16:26:05,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05" (1/1) ... [2024-11-12 16:26:05,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:26:05,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:26:05,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:26:05,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:26:05,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05" (1/1) ... [2024-11-12 16:26:05,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:26:05,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:26:06,008 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-12 16:26:06,011 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-12 16:26:06,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:26:06,055 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 16:26:06,055 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 16:26:06,055 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 16:26:06,055 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 16:26:06,055 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-12 16:26:06,055 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-12 16:26:06,056 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-12 16:26:06,056 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-12 16:26:06,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 16:26:06,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:26:06,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:26:06,057 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:26:06,154 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:26:06,159 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:26:06,380 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:26:06,380 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:26:06,524 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:26:06,524 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 16:26:06,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:26:06 BoogieIcfgContainer [2024-11-12 16:26:06,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:26:06,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:26:06,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:26:06,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:26:06,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:26:05" (1/3) ... [2024-11-12 16:26:06,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10110cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:26:06, skipping insertion in model container [2024-11-12 16:26:06,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:05" (2/3) ... [2024-11-12 16:26:06,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10110cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:26:06, skipping insertion in model container [2024-11-12 16:26:06,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:26:06" (3/3) ... [2024-11-12 16:26:06,532 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2024-11-12 16:26:06,547 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:26:06,547 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 16:26:06,547 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:26:06,623 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-12 16:26:06,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 61 transitions, 150 flow [2024-11-12 16:26:06,697 INFO L124 PetriNetUnfolderBase]: 3/57 cut-off events. [2024-11-12 16:26:06,697 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 16:26:06,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 57 events. 3/57 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-12 16:26:06,701 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 61 transitions, 150 flow [2024-11-12 16:26:06,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 56 transitions, 136 flow [2024-11-12 16:26:06,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:26:06,716 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;@56c15231, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:26:06,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-12 16:26:06,731 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:26:06,731 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2024-11-12 16:26:06,731 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 16:26:06,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:06,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:06,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:06,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:06,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1673393006, now seen corresponding path program 1 times [2024-11-12 16:26:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:06,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216632392] [2024-11-12 16:26:06,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:06,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:07,147 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-12 16:26:07,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:07,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216632392] [2024-11-12 16:26:07,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216632392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:07,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:07,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:26:07,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281751674] [2024-11-12 16:26:07,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:07,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:26:07,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:07,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:26:07,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:26:07,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2024-11-12 16:26:07,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:07,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:07,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2024-11-12 16:26:07,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:08,653 INFO L124 PetriNetUnfolderBase]: 12679/17507 cut-off events. [2024-11-12 16:26:08,653 INFO L125 PetriNetUnfolderBase]: For 1243/1243 co-relation queries the response was YES. [2024-11-12 16:26:08,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35337 conditions, 17507 events. 12679/17507 cut-off events. For 1243/1243 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 101536 event pairs, 4419 based on Foata normal form. 2/17033 useless extension candidates. Maximal degree in co-relation 32049. Up to 10696 conditions per place. [2024-11-12 16:26:08,768 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 59 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2024-11-12 16:26:08,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 338 flow [2024-11-12 16:26:08,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:26:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:26:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-11-12 16:26:08,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7158469945355191 [2024-11-12 16:26:08,781 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 136 flow. Second operand 3 states and 131 transitions. [2024-11-12 16:26:08,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 338 flow [2024-11-12 16:26:08,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 310 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-12 16:26:08,812 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2024-11-12 16:26:08,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2024-11-12 16:26:08,816 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2024-11-12 16:26:08,818 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2024-11-12 16:26:08,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:08,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:08,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:08,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:26:08,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:08,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2047081064, now seen corresponding path program 1 times [2024-11-12 16:26:08,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:08,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115976326] [2024-11-12 16:26:08,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:08,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:08,906 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-12 16:26:08,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115976326] [2024-11-12 16:26:08,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115976326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:08,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:08,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:26:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781806783] [2024-11-12 16:26:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:08,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:26:08,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:08,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:26:08,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:26:08,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2024-11-12 16:26:08,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:08,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:08,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2024-11-12 16:26:08,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:10,839 INFO L124 PetriNetUnfolderBase]: 21965/30404 cut-off events. [2024-11-12 16:26:10,840 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2024-11-12 16:26:10,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61554 conditions, 30404 events. 21965/30404 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 1155. Compared 181776 event pairs, 16979 based on Foata normal form. 0/29844 useless extension candidates. Maximal degree in co-relation 41623. Up to 26138 conditions per place. [2024-11-12 16:26:10,953 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 58 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2024-11-12 16:26:10,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 329 flow [2024-11-12 16:26:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:26:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:26:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-11-12 16:26:10,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.639344262295082 [2024-11-12 16:26:10,956 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 3 states and 117 transitions. [2024-11-12 16:26:10,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 329 flow [2024-11-12 16:26:10,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:26:10,960 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 196 flow [2024-11-12 16:26:10,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2024-11-12 16:26:10,961 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2024-11-12 16:26:10,962 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 196 flow [2024-11-12 16:26:10,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:10,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:10,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:10,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:26:10,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:10,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:10,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2121097810, now seen corresponding path program 1 times [2024-11-12 16:26:10,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:10,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052661535] [2024-11-12 16:26:10,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:10,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:11,166 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-12 16:26:11,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:11,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052661535] [2024-11-12 16:26:11,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052661535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:11,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:11,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 16:26:11,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151006108] [2024-11-12 16:26:11,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:11,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 16:26:11,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:11,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 16:26:11,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 16:26:11,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-12 16:26:11,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:11,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:11,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-12 16:26:11,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:13,085 INFO L124 PetriNetUnfolderBase]: 18572/28993 cut-off events. [2024-11-12 16:26:13,085 INFO L125 PetriNetUnfolderBase]: For 1566/1670 co-relation queries the response was YES. [2024-11-12 16:26:13,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59625 conditions, 28993 events. 18572/28993 cut-off events. For 1566/1670 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 225280 event pairs, 3513 based on Foata normal form. 358/27918 useless extension candidates. Maximal degree in co-relation 37875. Up to 9172 conditions per place. [2024-11-12 16:26:13,250 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 105 selfloop transitions, 41 changer transitions 1/172 dead transitions. [2024-11-12 16:26:13,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 172 transitions, 732 flow [2024-11-12 16:26:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 16:26:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-12 16:26:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 357 transitions. [2024-11-12 16:26:13,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2024-11-12 16:26:13,253 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 196 flow. Second operand 9 states and 357 transitions. [2024-11-12 16:26:13,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 172 transitions, 732 flow [2024-11-12 16:26:13,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 172 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:13,282 INFO L231 Difference]: Finished difference. Result has 71 places, 97 transitions, 366 flow [2024-11-12 16:26:13,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=366, PETRI_PLACES=71, PETRI_TRANSITIONS=97} [2024-11-12 16:26:13,284 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2024-11-12 16:26:13,284 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 97 transitions, 366 flow [2024-11-12 16:26:13,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:13,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:13,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:13,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:26:13,285 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:13,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:13,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1623899882, now seen corresponding path program 2 times [2024-11-12 16:26:13,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:13,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722974617] [2024-11-12 16:26:13,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:13,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:13,440 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-12 16:26:13,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:13,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722974617] [2024-11-12 16:26:13,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722974617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:13,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:13,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:26:13,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391058152] [2024-11-12 16:26:13,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:13,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:26:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:13,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:26:13,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:26:13,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-12 16:26:13,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 97 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:13,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:13,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-12 16:26:13,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:15,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [5#L100-4true, 30#L76-1true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 100#true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-12 16:26:15,758 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-12 16:26:15,758 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:15,758 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:15,759 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:15,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 7#L44-1true, 86#(<= (+ ~s~0 1) ~t~0), 46#L56-1true, 100#true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-12 16:26:15,759 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-12 16:26:15,759 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:15,759 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:15,759 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:15,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [30#L76-1true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 46#L56-1true, 43#L66-1true, 48#L101true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-12 16:26:15,972 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,972 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,974 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,974 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 46#L56-1true, 48#L101true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-12 16:26:15,974 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,974 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,974 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,975 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,975 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 7#L44-1true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue]) [2024-11-12 16:26:15,975 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,975 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,975 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,976 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,976 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 46#L56-1true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-12 16:26:15,976 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,976 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,976 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,977 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [5#L100-4true, 30#L76-1true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-12 16:26:15,977 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,977 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,977 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,977 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 7#L44-1true, 86#(<= (+ ~s~0 1) ~t~0), 46#L56-1true, 100#true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-12 16:26:15,977 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,977 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,978 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:15,978 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:16,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 48#L101true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue]) [2024-11-12 16:26:16,272 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,272 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,272 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,272 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 100#true, 48#L101true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-12 16:26:16,273 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,273 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,273 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,273 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [30#L76-1true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 48#L101true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-12 16:26:16,273 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,273 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,273 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,273 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 46#L56-1true, 48#L101true, 43#L66-1true, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-12 16:26:16,274 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,274 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,274 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,274 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-12 16:26:16,274 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,274 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,274 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,274 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [5#L100-4true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-12 16:26:16,275 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,275 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,275 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,275 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:16,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 86#(<= (+ ~s~0 1) ~t~0), 7#L44-1true, 100#true, 48#L101true, 43#L66-1true, 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0)]) [2024-11-12 16:26:16,381 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-12 16:26:16,381 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:16,381 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:16,381 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:16,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 100#true, 43#L66-1true, 48#L101true, Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue]) [2024-11-12 16:26:16,382 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-12 16:26:16,382 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:16,382 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:16,382 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:16,503 INFO L124 PetriNetUnfolderBase]: 31017/48718 cut-off events. [2024-11-12 16:26:16,504 INFO L125 PetriNetUnfolderBase]: For 23066/23594 co-relation queries the response was YES. [2024-11-12 16:26:16,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120023 conditions, 48718 events. 31017/48718 cut-off events. For 23066/23594 co-relation queries the response was YES. Maximal size of possible extension queue 2591. Compared 401587 event pairs, 7493 based on Foata normal form. 523/47334 useless extension candidates. Maximal degree in co-relation 77638. Up to 18165 conditions per place. [2024-11-12 16:26:16,785 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 104 selfloop transitions, 55 changer transitions 4/188 dead transitions. [2024-11-12 16:26:16,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 188 transitions, 998 flow [2024-11-12 16:26:16,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:26:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:26:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2024-11-12 16:26:16,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7147540983606557 [2024-11-12 16:26:16,787 INFO L175 Difference]: Start difference. First operand has 71 places, 97 transitions, 366 flow. Second operand 5 states and 218 transitions. [2024-11-12 16:26:16,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 188 transitions, 998 flow [2024-11-12 16:26:16,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 188 transitions, 991 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:26:16,910 INFO L231 Difference]: Finished difference. Result has 77 places, 134 transitions, 759 flow [2024-11-12 16:26:16,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=759, PETRI_PLACES=77, PETRI_TRANSITIONS=134} [2024-11-12 16:26:16,911 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2024-11-12 16:26:16,911 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 134 transitions, 759 flow [2024-11-12 16:26:16,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:16,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:16,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:16,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 16:26:16,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:16,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1796716772, now seen corresponding path program 1 times [2024-11-12 16:26:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:16,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915822818] [2024-11-12 16:26:16,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:16,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:17,179 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-12 16:26:17,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:17,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915822818] [2024-11-12 16:26:17,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915822818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:17,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:17,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:26:17,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137676831] [2024-11-12 16:26:17,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:17,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:26:17,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:17,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:26:17,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:26:17,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-12 16:26:17,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 134 transitions, 759 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:17,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:17,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-12 16:26:17,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:19,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 5#L100-4true, Black: 78#true, 7#L44-1true, 46#L56-1true]) [2024-11-12 16:26:19,375 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-12 16:26:19,376 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:19,376 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:19,376 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:19,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 5#L100-4true, Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true]) [2024-11-12 16:26:19,376 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-12 16:26:19,376 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:19,377 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:19,377 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:19,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 78#true, 7#L44-1true, 46#L56-1true, 48#L101true]) [2024-11-12 16:26:19,578 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,578 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,578 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,578 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 48#L101true]) [2024-11-12 16:26:19,579 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,579 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,579 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,579 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 5#L100-4true, Black: 78#true, 7#L44-1true]) [2024-11-12 16:26:19,579 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,580 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,580 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,580 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 5#L100-4true, Black: 78#true, 7#L44-1true, 46#L56-1true]) [2024-11-12 16:26:19,580 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,580 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,580 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,580 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 5#L100-4true, Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true]) [2024-11-12 16:26:19,580 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,580 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,580 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,581 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 5#L100-4true, Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true]) [2024-11-12 16:26:19,581 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,581 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,581 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,581 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:19,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, Black: 78#true, 7#L44-1true, 48#L101true]) [2024-11-12 16:26:19,750 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,750 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,750 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,750 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,750 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 7#L44-1true, 46#L56-1true, 48#L101true]) [2024-11-12 16:26:19,750 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,750 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,750 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,750 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 48#L101true]) [2024-11-12 16:26:19,751 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,751 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,751 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,751 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 48#L101true]) [2024-11-12 16:26:19,751 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,751 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,751 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,751 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, 5#L100-4true, Black: 78#true, 7#L44-1true]) [2024-11-12 16:26:19,752 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,752 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,752 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,752 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,752 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, Black: 103#(<= (+ ~s~0 1) ~t~0), 5#L100-4true, Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true]) [2024-11-12 16:26:19,752 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,752 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,752 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:19,752 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:20,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 86#(<= (+ ~s~0 1) ~t~0), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 7#L44-1true, 48#L101true]) [2024-11-12 16:26:20,023 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-12 16:26:20,023 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:20,023 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:20,023 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:20,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), Black: 78#true, 85#(<= ~s~0 ~t~0), 7#L44-1true, 48#L101true]) [2024-11-12 16:26:20,024 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-12 16:26:20,024 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:20,024 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:20,024 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:20,171 INFO L124 PetriNetUnfolderBase]: 28896/45634 cut-off events. [2024-11-12 16:26:20,172 INFO L125 PetriNetUnfolderBase]: For 66816/68251 co-relation queries the response was YES. [2024-11-12 16:26:20,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139415 conditions, 45634 events. 28896/45634 cut-off events. For 66816/68251 co-relation queries the response was YES. Maximal size of possible extension queue 2401. Compared 374953 event pairs, 7274 based on Foata normal form. 952/44887 useless extension candidates. Maximal degree in co-relation 86598. Up to 17640 conditions per place. [2024-11-12 16:26:20,437 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 107 selfloop transitions, 68 changer transitions 0/200 dead transitions. [2024-11-12 16:26:20,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 200 transitions, 1397 flow [2024-11-12 16:26:20,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:26:20,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:26:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2024-11-12 16:26:20,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7114754098360656 [2024-11-12 16:26:20,439 INFO L175 Difference]: Start difference. First operand has 77 places, 134 transitions, 759 flow. Second operand 5 states and 217 transitions. [2024-11-12 16:26:20,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 200 transitions, 1397 flow [2024-11-12 16:26:20,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 200 transitions, 1382 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-12 16:26:20,575 INFO L231 Difference]: Finished difference. Result has 82 places, 147 transitions, 1057 flow [2024-11-12 16:26:20,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1057, PETRI_PLACES=82, PETRI_TRANSITIONS=147} [2024-11-12 16:26:20,576 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places. [2024-11-12 16:26:20,576 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 147 transitions, 1057 flow [2024-11-12 16:26:20,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:20,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:20,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:20,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 16:26:20,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:20,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:20,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1269143448, now seen corresponding path program 3 times [2024-11-12 16:26:20,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:20,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861152091] [2024-11-12 16:26:20,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:20,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:20,727 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-12 16:26:20,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:20,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861152091] [2024-11-12 16:26:20,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861152091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:20,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:20,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 16:26:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028569745] [2024-11-12 16:26:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:20,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:26:20,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:26:20,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:26:20,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-12 16:26:20,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 147 transitions, 1057 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:20,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:20,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-12 16:26:20,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:23,517 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true]) [2024-11-12 16:26:23,517 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-12 16:26:23,517 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:23,517 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:23,517 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:23,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 48#L101true]) [2024-11-12 16:26:23,765 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:23,765 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:23,765 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:23,765 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:23,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true]) [2024-11-12 16:26:23,766 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:23,766 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:23,766 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:23,766 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:23,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, 110#true, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true]) [2024-11-12 16:26:23,766 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:23,766 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:23,766 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:23,766 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:24,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 48#L101true]) [2024-11-12 16:26:24,179 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:24,179 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:24,179 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:24,180 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:24,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L56-1true, 48#L101true]) [2024-11-12 16:26:24,180 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:24,180 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:24,180 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:24,180 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:24,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), 52#thread2EXITtrue, Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true]) [2024-11-12 16:26:24,180 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:24,180 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:24,180 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:24,180 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:24,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 110#true, 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), 52#thread2EXITtrue, Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 48#L101true]) [2024-11-12 16:26:24,326 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-12 16:26:24,326 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:24,326 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:24,326 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:24,538 INFO L124 PetriNetUnfolderBase]: 32470/50995 cut-off events. [2024-11-12 16:26:24,538 INFO L125 PetriNetUnfolderBase]: For 103810/106170 co-relation queries the response was YES. [2024-11-12 16:26:24,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169020 conditions, 50995 events. 32470/50995 cut-off events. For 103810/106170 co-relation queries the response was YES. Maximal size of possible extension queue 2826. Compared 425346 event pairs, 6385 based on Foata normal form. 1598/50204 useless extension candidates. Maximal degree in co-relation 105849. Up to 17284 conditions per place. [2024-11-12 16:26:24,875 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 107 selfloop transitions, 106 changer transitions 4/242 dead transitions. [2024-11-12 16:26:24,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 242 transitions, 1922 flow [2024-11-12 16:26:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:26:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:26:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 263 transitions. [2024-11-12 16:26:24,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7185792349726776 [2024-11-12 16:26:24,876 INFO L175 Difference]: Start difference. First operand has 82 places, 147 transitions, 1057 flow. Second operand 6 states and 263 transitions. [2024-11-12 16:26:24,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 242 transitions, 1922 flow [2024-11-12 16:26:25,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 242 transitions, 1836 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:25,198 INFO L231 Difference]: Finished difference. Result has 87 places, 175 transitions, 1487 flow [2024-11-12 16:26:25,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1487, PETRI_PLACES=87, PETRI_TRANSITIONS=175} [2024-11-12 16:26:25,198 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 21 predicate places. [2024-11-12 16:26:25,199 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 175 transitions, 1487 flow [2024-11-12 16:26:25,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:25,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:25,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:25,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:26:25,199 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:25,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:25,200 INFO L85 PathProgramCache]: Analyzing trace with hash -549382550, now seen corresponding path program 4 times [2024-11-12 16:26:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:25,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956538143] [2024-11-12 16:26:25,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:25,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:25,362 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-12 16:26:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:25,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956538143] [2024-11-12 16:26:25,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956538143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:25,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:25,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 16:26:25,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667540811] [2024-11-12 16:26:25,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:25,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 16:26:25,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:25,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 16:26:25,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:26:25,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-12 16:26:25,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 175 transitions, 1487 flow. Second operand has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:25,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:25,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-12 16:26:25,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:28,107 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][208], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-12 16:26:28,107 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-12 16:26:28,107 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:28,107 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:28,107 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-12 16:26:28,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][208], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 48#L101true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-12 16:26:28,607 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:28,607 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:28,607 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:28,607 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:28,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][208], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 52#thread2EXITtrue, 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-12 16:26:28,607 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:28,607 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:28,608 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:28,608 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:28,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][208], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-12 16:26:28,608 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-12 16:26:28,608 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:28,608 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:28,608 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-12 16:26:28,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][208], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 30#L76-1true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 52#thread2EXITtrue, 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 129#true, 48#L101true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-12 16:26:28,828 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:28,828 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:28,828 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:28,828 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:28,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][208], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 9#thread4EXITtrue, 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 46#L56-1true, 129#true, 48#L101true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-12 16:26:28,829 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:28,829 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:28,829 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:28,829 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:28,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][208], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 43#L66-1true, Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 52#thread2EXITtrue, 119#true, 5#L100-4true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 85#(<= ~s~0 ~t~0), 7#L44-1true, 129#true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-12 16:26:28,829 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-12 16:26:28,829 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:28,829 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:28,829 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-12 16:26:28,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([444] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][208], [Black: 121#(<= ~s~0 ~t~0), Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 100#true, 43#L66-1true, Black: 106#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 102#(<= ~s~0 ~t~0), Black: 76#(= (mod ~b~0 256) 0), Black: 103#(<= (+ ~s~0 1) ~t~0), 52#thread2EXITtrue, 119#true, Black: 78#true, Black: 113#(<= (+ ~s~0 1) ~t~0), 85#(<= ~s~0 ~t~0), Black: 116#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 129#true, 48#L101true, Black: 126#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|))]) [2024-11-12 16:26:28,996 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-12 16:26:28,996 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:28,996 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:28,996 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-12 16:26:29,444 INFO L124 PetriNetUnfolderBase]: 33384/52574 cut-off events. [2024-11-12 16:26:29,448 INFO L125 PetriNetUnfolderBase]: For 173455/176099 co-relation queries the response was YES. [2024-11-12 16:26:29,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188514 conditions, 52574 events. 33384/52574 cut-off events. For 173455/176099 co-relation queries the response was YES. Maximal size of possible extension queue 2897. Compared 442362 event pairs, 6641 based on Foata normal form. 1948/52119 useless extension candidates. Maximal degree in co-relation 117618. Up to 16795 conditions per place. [2024-11-12 16:26:29,854 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 124 selfloop transitions, 115 changer transitions 1/265 dead transitions. [2024-11-12 16:26:29,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 265 transitions, 2315 flow [2024-11-12 16:26:29,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 16:26:29,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-12 16:26:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 338 transitions. [2024-11-12 16:26:29,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6926229508196722 [2024-11-12 16:26:29,855 INFO L175 Difference]: Start difference. First operand has 87 places, 175 transitions, 1487 flow. Second operand 8 states and 338 transitions. [2024-11-12 16:26:29,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 265 transitions, 2315 flow [2024-11-12 16:26:30,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 265 transitions, 2258 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:30,280 INFO L231 Difference]: Finished difference. Result has 94 places, 184 transitions, 1828 flow [2024-11-12 16:26:30,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1828, PETRI_PLACES=94, PETRI_TRANSITIONS=184} [2024-11-12 16:26:30,281 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 28 predicate places. [2024-11-12 16:26:30,282 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 184 transitions, 1828 flow [2024-11-12 16:26:30,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:30,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:30,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:30,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 16:26:30,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:30,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:30,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1900671934, now seen corresponding path program 2 times [2024-11-12 16:26:30,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:30,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941809582] [2024-11-12 16:26:30,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:30,442 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-12 16:26:30,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:30,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941809582] [2024-11-12 16:26:30,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941809582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:30,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:30,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 16:26:30,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201533716] [2024-11-12 16:26:30,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:30,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 16:26:30,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:30,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 16:26:30,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:26:30,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-12 16:26:30,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 184 transitions, 1828 flow. Second operand has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:30,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:30,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-12 16:26:30,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:34,672 INFO L124 PetriNetUnfolderBase]: 33115/52821 cut-off events. [2024-11-12 16:26:34,672 INFO L125 PetriNetUnfolderBase]: For 238032/240703 co-relation queries the response was YES. [2024-11-12 16:26:34,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205143 conditions, 52821 events. 33115/52821 cut-off events. For 238032/240703 co-relation queries the response was YES. Maximal size of possible extension queue 2903. Compared 452710 event pairs, 6616 based on Foata normal form. 2317/52716 useless extension candidates. Maximal degree in co-relation 130936. Up to 17233 conditions per place. [2024-11-12 16:26:35,088 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 134 selfloop transitions, 147 changer transitions 2/308 dead transitions. [2024-11-12 16:26:35,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 308 transitions, 3151 flow [2024-11-12 16:26:35,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 16:26:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-12 16:26:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 344 transitions. [2024-11-12 16:26:35,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7049180327868853 [2024-11-12 16:26:35,090 INFO L175 Difference]: Start difference. First operand has 94 places, 184 transitions, 1828 flow. Second operand 8 states and 344 transitions. [2024-11-12 16:26:35,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 308 transitions, 3151 flow [2024-11-12 16:26:35,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 308 transitions, 2929 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-12 16:26:35,544 INFO L231 Difference]: Finished difference. Result has 99 places, 215 transitions, 2404 flow [2024-11-12 16:26:35,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2404, PETRI_PLACES=99, PETRI_TRANSITIONS=215} [2024-11-12 16:26:35,545 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 33 predicate places. [2024-11-12 16:26:35,545 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 215 transitions, 2404 flow [2024-11-12 16:26:35,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:35,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:35,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:35,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 16:26:35,546 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:35,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1357401666, now seen corresponding path program 2 times [2024-11-12 16:26:35,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:35,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357175066] [2024-11-12 16:26:35,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:35,675 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-12 16:26:35,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:35,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357175066] [2024-11-12 16:26:35,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357175066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:35,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:35,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:26:35,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841938008] [2024-11-12 16:26:35,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:35,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:26:35,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:35,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:26:35,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:26:35,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-12 16:26:35,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 215 transitions, 2404 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:35,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:35,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-12 16:26:35,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:39,813 INFO L124 PetriNetUnfolderBase]: 31340/51549 cut-off events. [2024-11-12 16:26:39,813 INFO L125 PetriNetUnfolderBase]: For 256617/257779 co-relation queries the response was YES. [2024-11-12 16:26:40,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199054 conditions, 51549 events. 31340/51549 cut-off events. For 256617/257779 co-relation queries the response was YES. Maximal size of possible extension queue 2757. Compared 456959 event pairs, 8738 based on Foata normal form. 686/50581 useless extension candidates. Maximal degree in co-relation 126862. Up to 22761 conditions per place. [2024-11-12 16:26:40,188 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 126 selfloop transitions, 127 changer transitions 14/292 dead transitions. [2024-11-12 16:26:40,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 292 transitions, 3522 flow [2024-11-12 16:26:40,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:26:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:26:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2024-11-12 16:26:40,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7180327868852459 [2024-11-12 16:26:40,189 INFO L175 Difference]: Start difference. First operand has 99 places, 215 transitions, 2404 flow. Second operand 5 states and 219 transitions. [2024-11-12 16:26:40,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 292 transitions, 3522 flow [2024-11-12 16:26:40,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 292 transitions, 3464 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:40,574 INFO L231 Difference]: Finished difference. Result has 103 places, 229 transitions, 2929 flow [2024-11-12 16:26:40,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2330, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2929, PETRI_PLACES=103, PETRI_TRANSITIONS=229} [2024-11-12 16:26:40,575 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 37 predicate places. [2024-11-12 16:26:40,575 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 229 transitions, 2929 flow [2024-11-12 16:26:40,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:40,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:40,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:40,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 16:26:40,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:40,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:40,577 INFO L85 PathProgramCache]: Analyzing trace with hash 485535886, now seen corresponding path program 5 times [2024-11-12 16:26:40,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:40,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477779195] [2024-11-12 16:26:40,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:40,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:40,699 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-12 16:26:40,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:40,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477779195] [2024-11-12 16:26:40,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477779195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:40,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:40,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:26:40,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279807356] [2024-11-12 16:26:40,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:40,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:26:40,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:40,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:26:40,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:26:40,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-12 16:26:40,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 229 transitions, 2929 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:40,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:40,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-12 16:26:40,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:43,168 INFO L124 PetriNetUnfolderBase]: 19839/32646 cut-off events. [2024-11-12 16:26:43,169 INFO L125 PetriNetUnfolderBase]: For 175036/176378 co-relation queries the response was YES. [2024-11-12 16:26:43,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124356 conditions, 32646 events. 19839/32646 cut-off events. For 175036/176378 co-relation queries the response was YES. Maximal size of possible extension queue 1745. Compared 270940 event pairs, 5780 based on Foata normal form. 1016/32554 useless extension candidates. Maximal degree in co-relation 98264. Up to 16284 conditions per place. [2024-11-12 16:26:43,351 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 112 selfloop transitions, 113 changer transitions 24/274 dead transitions. [2024-11-12 16:26:43,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 274 transitions, 3579 flow [2024-11-12 16:26:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:26:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:26:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2024-11-12 16:26:43,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7081967213114754 [2024-11-12 16:26:43,353 INFO L175 Difference]: Start difference. First operand has 103 places, 229 transitions, 2929 flow. Second operand 5 states and 216 transitions. [2024-11-12 16:26:43,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 274 transitions, 3579 flow [2024-11-12 16:26:43,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 274 transitions, 3435 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:43,493 INFO L231 Difference]: Finished difference. Result has 107 places, 209 transitions, 2770 flow [2024-11-12 16:26:43,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2401, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2770, PETRI_PLACES=107, PETRI_TRANSITIONS=209} [2024-11-12 16:26:43,494 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 41 predicate places. [2024-11-12 16:26:43,494 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 209 transitions, 2770 flow [2024-11-12 16:26:43,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:43,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:43,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:43,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 16:26:43,494 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:43,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:43,495 INFO L85 PathProgramCache]: Analyzing trace with hash 384483030, now seen corresponding path program 6 times [2024-11-12 16:26:43,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:43,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494758274] [2024-11-12 16:26:43,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:43,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:43,603 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-12 16:26:43,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:43,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494758274] [2024-11-12 16:26:43,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494758274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:43,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:43,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 16:26:43,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779870745] [2024-11-12 16:26:43,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:43,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 16:26:43,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:43,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 16:26:43,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:26:43,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-12 16:26:43,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 209 transitions, 2770 flow. Second operand has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:43,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:43,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-12 16:26:43,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:45,757 INFO L124 PetriNetUnfolderBase]: 13487/22226 cut-off events. [2024-11-12 16:26:45,757 INFO L125 PetriNetUnfolderBase]: For 114241/115285 co-relation queries the response was YES. [2024-11-12 16:26:45,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85845 conditions, 22226 events. 13487/22226 cut-off events. For 114241/115285 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 173099 event pairs, 3104 based on Foata normal form. 828/22424 useless extension candidates. Maximal degree in co-relation 71314. Up to 6370 conditions per place. [2024-11-12 16:26:45,911 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 112 selfloop transitions, 138 changer transitions 37/311 dead transitions. [2024-11-12 16:26:45,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 311 transitions, 4072 flow [2024-11-12 16:26:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 16:26:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-12 16:26:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 336 transitions. [2024-11-12 16:26:45,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2024-11-12 16:26:45,912 INFO L175 Difference]: Start difference. First operand has 107 places, 209 transitions, 2770 flow. Second operand 8 states and 336 transitions. [2024-11-12 16:26:45,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 311 transitions, 4072 flow [2024-11-12 16:26:45,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 311 transitions, 3826 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:26:45,997 INFO L231 Difference]: Finished difference. Result has 113 places, 202 transitions, 2782 flow [2024-11-12 16:26:45,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2526, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2782, PETRI_PLACES=113, PETRI_TRANSITIONS=202} [2024-11-12 16:26:45,998 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 47 predicate places. [2024-11-12 16:26:45,998 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 202 transitions, 2782 flow [2024-11-12 16:26:45,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:45,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:45,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:45,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 16:26:45,998 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:45,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:45,999 INFO L85 PathProgramCache]: Analyzing trace with hash -174536736, now seen corresponding path program 7 times [2024-11-12 16:26:45,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:45,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780887581] [2024-11-12 16:26:45,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:45,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:46,103 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-12 16:26:46,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:46,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780887581] [2024-11-12 16:26:46,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780887581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:46,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:46,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 16:26:46,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101486346] [2024-11-12 16:26:46,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:46,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 16:26:46,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:46,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 16:26:46,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 16:26:46,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-12 16:26:46,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 202 transitions, 2782 flow. Second operand has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:46,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:46,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-12 16:26:46,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:47,981 INFO L124 PetriNetUnfolderBase]: 12333/20002 cut-off events. [2024-11-12 16:26:47,981 INFO L125 PetriNetUnfolderBase]: For 117310/118102 co-relation queries the response was YES. [2024-11-12 16:26:48,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79523 conditions, 20002 events. 12333/20002 cut-off events. For 117310/118102 co-relation queries the response was YES. Maximal size of possible extension queue 1054. Compared 151746 event pairs, 2965 based on Foata normal form. 412/19663 useless extension candidates. Maximal degree in co-relation 64695. Up to 7359 conditions per place. [2024-11-12 16:26:48,080 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 100 selfloop transitions, 138 changer transitions 31/293 dead transitions. [2024-11-12 16:26:48,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 293 transitions, 3831 flow [2024-11-12 16:26:48,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 16:26:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-12 16:26:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 357 transitions. [2024-11-12 16:26:48,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6502732240437158 [2024-11-12 16:26:48,082 INFO L175 Difference]: Start difference. First operand has 113 places, 202 transitions, 2782 flow. Second operand 9 states and 357 transitions. [2024-11-12 16:26:48,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 293 transitions, 3831 flow [2024-11-12 16:26:48,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 293 transitions, 3699 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:26:48,158 INFO L231 Difference]: Finished difference. Result has 119 places, 191 transitions, 2738 flow [2024-11-12 16:26:48,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2738, PETRI_PLACES=119, PETRI_TRANSITIONS=191} [2024-11-12 16:26:48,158 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 53 predicate places. [2024-11-12 16:26:48,159 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 191 transitions, 2738 flow [2024-11-12 16:26:48,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.5) internal successors, (220), 8 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:48,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:48,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:48,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 16:26:48,159 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:48,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:48,159 INFO L85 PathProgramCache]: Analyzing trace with hash 832276790, now seen corresponding path program 8 times [2024-11-12 16:26:48,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:48,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828261403] [2024-11-12 16:26:48,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:48,244 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-12 16:26:48,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:48,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828261403] [2024-11-12 16:26:48,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828261403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:48,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:48,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 16:26:48,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215375587] [2024-11-12 16:26:48,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:48,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 16:26:48,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:48,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 16:26:48,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 16:26:48,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-12 16:26:48,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 191 transitions, 2738 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:48,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:48,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-12 16:26:48,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:49,911 INFO L124 PetriNetUnfolderBase]: 11602/19042 cut-off events. [2024-11-12 16:26:49,911 INFO L125 PetriNetUnfolderBase]: For 130376/131382 co-relation queries the response was YES. [2024-11-12 16:26:49,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76793 conditions, 19042 events. 11602/19042 cut-off events. For 130376/131382 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 145802 event pairs, 2893 based on Foata normal form. 644/19060 useless extension candidates. Maximal degree in co-relation 61771. Up to 6983 conditions per place. [2024-11-12 16:26:50,036 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 109 selfloop transitions, 136 changer transitions 19/288 dead transitions. [2024-11-12 16:26:50,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 288 transitions, 3743 flow [2024-11-12 16:26:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 16:26:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 16:26:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 447 transitions. [2024-11-12 16:26:50,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.610655737704918 [2024-11-12 16:26:50,038 INFO L175 Difference]: Start difference. First operand has 119 places, 191 transitions, 2738 flow. Second operand 12 states and 447 transitions. [2024-11-12 16:26:50,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 288 transitions, 3743 flow [2024-11-12 16:26:50,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 288 transitions, 3559 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-12 16:26:50,141 INFO L231 Difference]: Finished difference. Result has 127 places, 190 transitions, 2782 flow [2024-11-12 16:26:50,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2782, PETRI_PLACES=127, PETRI_TRANSITIONS=190} [2024-11-12 16:26:50,142 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 61 predicate places. [2024-11-12 16:26:50,142 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 190 transitions, 2782 flow [2024-11-12 16:26:50,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:50,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:50,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:50,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 16:26:50,143 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:50,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:50,143 INFO L85 PathProgramCache]: Analyzing trace with hash 262703156, now seen corresponding path program 9 times [2024-11-12 16:26:50,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:50,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79177462] [2024-11-12 16:26:50,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:50,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:50,244 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-12 16:26:50,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:50,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79177462] [2024-11-12 16:26:50,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79177462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:50,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:50,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 16:26:50,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669912975] [2024-11-12 16:26:50,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:50,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 16:26:50,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:50,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 16:26:50,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 16:26:50,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-12 16:26:50,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 190 transitions, 2782 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:50,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:50,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-12 16:26:50,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:52,120 INFO L124 PetriNetUnfolderBase]: 11593/18921 cut-off events. [2024-11-12 16:26:52,120 INFO L125 PetriNetUnfolderBase]: For 146007/146859 co-relation queries the response was YES. [2024-11-12 16:26:52,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78286 conditions, 18921 events. 11593/18921 cut-off events. For 146007/146859 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 143951 event pairs, 3101 based on Foata normal form. 412/18644 useless extension candidates. Maximal degree in co-relation 62811. Up to 7053 conditions per place. [2024-11-12 16:26:52,217 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 94 selfloop transitions, 128 changer transitions 50/296 dead transitions. [2024-11-12 16:26:52,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 296 transitions, 3955 flow [2024-11-12 16:26:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 16:26:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 16:26:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 450 transitions. [2024-11-12 16:26:52,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6147540983606558 [2024-11-12 16:26:52,218 INFO L175 Difference]: Start difference. First operand has 127 places, 190 transitions, 2782 flow. Second operand 12 states and 450 transitions. [2024-11-12 16:26:52,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 296 transitions, 3955 flow [2024-11-12 16:26:52,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 296 transitions, 3697 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-11-12 16:26:52,330 INFO L231 Difference]: Finished difference. Result has 132 places, 181 transitions, 2659 flow [2024-11-12 16:26:52,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2659, PETRI_PLACES=132, PETRI_TRANSITIONS=181} [2024-11-12 16:26:52,331 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 66 predicate places. [2024-11-12 16:26:52,331 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 181 transitions, 2659 flow [2024-11-12 16:26:52,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:52,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:52,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:52,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 16:26:52,332 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 16:26:52,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:52,332 INFO L85 PathProgramCache]: Analyzing trace with hash 890076392, now seen corresponding path program 3 times [2024-11-12 16:26:52,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:52,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631290247] [2024-11-12 16:26:52,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:52,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:52,426 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-12 16:26:52,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:52,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631290247] [2024-11-12 16:26:52,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631290247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:52,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:52,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 16:26:52,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093357567] [2024-11-12 16:26:52,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:52,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 16:26:52,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:52,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 16:26:52,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 16:26:52,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 61 [2024-11-12 16:26:52,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 181 transitions, 2659 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:52,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:52,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 61 [2024-11-12 16:26:52,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand