./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i -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 c35b909c90b92e30d40b0275e3d226db26dbebaf39dc73a31d7e72eee871d214 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:52:08,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:52:08,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 18:52:08,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:52:08,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:52:08,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:52:08,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:52:08,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:52:08,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:52:08,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:52:08,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:52:08,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:52:08,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:52:08,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:52:08,906 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:52:08,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:52:08,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 18:52:08,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:52:08,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 18:52:08,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:52:08,910 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:52:08,912 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:52:08,912 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:52:08,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:52:08,913 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:52:08,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:52:08,913 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:52:08,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 18:52:08,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:52:08,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:52:08,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:52:08,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:52:08,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:52:08,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:52:08,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:52:08,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:52:08,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 18:52:08,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 18:52:08,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:52:08,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:52:08,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:52:08,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:52:08,917 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 -> c35b909c90b92e30d40b0275e3d226db26dbebaf39dc73a31d7e72eee871d214 [2024-10-24 18:52:09,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:52:09,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:52:09,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:52:09,198 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:52:09,199 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:52:09,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i [2024-10-24 18:52:10,732 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:52:10,993 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:52:10,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i [2024-10-24 18:52:11,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb958dc3a/fd0de29842c1462c8a927c53e9d7725f/FLAG0cd93ffc5 [2024-10-24 18:52:11,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb958dc3a/fd0de29842c1462c8a927c53e9d7725f [2024-10-24 18:52:11,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:52:11,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:52:11,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:52:11,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:52:11,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:52:11,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:52:11" (1/1) ... [2024-10-24 18:52:11,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9e2380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11, skipping insertion in model container [2024-10-24 18:52:11,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:52:11" (1/1) ... [2024-10-24 18:52:11,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:52:11,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:52:11,482 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 18:52:11,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:52:11,578 INFO L204 MainTranslator]: Completed translation [2024-10-24 18:52:11,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11 WrapperNode [2024-10-24 18:52:11,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:52:11,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 18:52:11,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 18:52:11,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 18:52:11,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11" (1/1) ... [2024-10-24 18:52:11,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11" (1/1) ... [2024-10-24 18:52:11,638 INFO L138 Inliner]: procedures = 169, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 193 [2024-10-24 18:52:11,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 18:52:11,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 18:52:11,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 18:52:11,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 18:52:11,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11" (1/1) ... [2024-10-24 18:52:11,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11" (1/1) ... [2024-10-24 18:52:11,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11" (1/1) ... [2024-10-24 18:52:11,679 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-10-24 18:52:11,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11" (1/1) ... [2024-10-24 18:52:11,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11" (1/1) ... [2024-10-24 18:52:11,684 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11" (1/1) ... [2024-10-24 18:52:11,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11" (1/1) ... [2024-10-24 18:52:11,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11" (1/1) ... [2024-10-24 18:52:11,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11" (1/1) ... [2024-10-24 18:52:11,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 18:52:11,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 18:52:11,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 18:52:11,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 18:52:11,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11" (1/1) ... [2024-10-24 18:52:11,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:52:11,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 18:52:11,731 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-10-24 18:52:11,733 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-10-24 18:52:11,768 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-10-24 18:52:11,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-10-24 18:52:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-24 18:52:11,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-24 18:52:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 18:52:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 18:52:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 18:52:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 18:52:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 18:52:11,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 18:52:11,771 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 18:52:11,879 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 18:52:11,882 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 18:52:12,072 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 18:52:12,072 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 18:52:12,141 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 18:52:12,141 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-24 18:52:12,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:52:12 BoogieIcfgContainer [2024-10-24 18:52:12,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 18:52:12,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 18:52:12,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 18:52:12,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 18:52:12,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:52:11" (1/3) ... [2024-10-24 18:52:12,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4513b8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:52:12, skipping insertion in model container [2024-10-24 18:52:12,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:11" (2/3) ... [2024-10-24 18:52:12,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4513b8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:52:12, skipping insertion in model container [2024-10-24 18:52:12,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:52:12" (3/3) ... [2024-10-24 18:52:12,154 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport.i [2024-10-24 18:52:12,170 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 18:52:12,171 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-24 18:52:12,171 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 18:52:12,242 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-24 18:52:12,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 96 transitions, 206 flow [2024-10-24 18:52:12,318 INFO L124 PetriNetUnfolderBase]: 20/94 cut-off events. [2024-10-24 18:52:12,318 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 18:52:12,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 94 events. 20/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 250 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 89. Up to 4 conditions per place. [2024-10-24 18:52:12,325 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 96 transitions, 206 flow [2024-10-24 18:52:12,331 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 93 transitions, 198 flow [2024-10-24 18:52:12,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 18:52:12,345 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;@50bb6782, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 18:52:12,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-24 18:52:12,353 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 18:52:12,353 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-10-24 18:52:12,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 18:52:12,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:12,354 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:12,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 18:52:12,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash -111778890, now seen corresponding path program 1 times [2024-10-24 18:52:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:12,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514538629] [2024-10-24 18:52:12,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:52:12,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:12,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514538629] [2024-10-24 18:52:12,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514538629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:12,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:12,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:52:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561326617] [2024-10-24 18:52:12,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:12,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 18:52:12,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:12,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 18:52:12,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 18:52:12,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 96 [2024-10-24 18:52:12,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 93 transitions, 198 flow. Second operand has 2 states, 2 states have (on average 70.0) internal successors, (140), 2 states have internal predecessors, (140), 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-10-24 18:52:12,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:12,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 96 [2024-10-24 18:52:12,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:12,800 INFO L124 PetriNetUnfolderBase]: 234/657 cut-off events. [2024-10-24 18:52:12,800 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-24 18:52:12,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 657 events. 234/657 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3888 event pairs, 78 based on Foata normal form. 101/659 useless extension candidates. Maximal degree in co-relation 904. Up to 276 conditions per place. [2024-10-24 18:52:12,815 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 19 selfloop transitions, 0 changer transitions 0/83 dead transitions. [2024-10-24 18:52:12,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 83 transitions, 216 flow [2024-10-24 18:52:12,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 18:52:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-24 18:52:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 163 transitions. [2024-10-24 18:52:12,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8489583333333334 [2024-10-24 18:52:12,829 INFO L175 Difference]: Start difference. First operand has 80 places, 93 transitions, 198 flow. Second operand 2 states and 163 transitions. [2024-10-24 18:52:12,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 83 transitions, 216 flow [2024-10-24 18:52:12,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 83 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 18:52:12,836 INFO L231 Difference]: Finished difference. Result has 75 places, 83 transitions, 170 flow [2024-10-24 18:52:12,838 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=170, PETRI_PLACES=75, PETRI_TRANSITIONS=83} [2024-10-24 18:52:12,843 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, -5 predicate places. [2024-10-24 18:52:12,843 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 83 transitions, 170 flow [2024-10-24 18:52:12,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 70.0) internal successors, (140), 2 states have internal predecessors, (140), 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-10-24 18:52:12,845 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:12,845 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:12,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 18:52:12,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 18:52:12,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2103402310, now seen corresponding path program 1 times [2024-10-24 18:52:12,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:12,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617145142] [2024-10-24 18:52:12,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:12,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:52:12,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:12,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617145142] [2024-10-24 18:52:12,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617145142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:12,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:12,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:52:12,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940727467] [2024-10-24 18:52:12,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:12,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:52:12,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:12,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:52:12,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:52:12,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 96 [2024-10-24 18:52:12,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 83 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-10-24 18:52:12,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:12,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 96 [2024-10-24 18:52:12,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:13,137 INFO L124 PetriNetUnfolderBase]: 283/742 cut-off events. [2024-10-24 18:52:13,137 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-24 18:52:13,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 742 events. 283/742 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4568 event pairs, 58 based on Foata normal form. 16/650 useless extension candidates. Maximal degree in co-relation 1128. Up to 216 conditions per place. [2024-10-24 18:52:13,144 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 30 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2024-10-24 18:52:13,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 94 transitions, 260 flow [2024-10-24 18:52:13,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:52:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 18:52:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2024-10-24 18:52:13,149 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7986111111111112 [2024-10-24 18:52:13,150 INFO L175 Difference]: Start difference. First operand has 75 places, 83 transitions, 170 flow. Second operand 3 states and 230 transitions. [2024-10-24 18:52:13,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 94 transitions, 260 flow [2024-10-24 18:52:13,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 94 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 18:52:13,154 INFO L231 Difference]: Finished difference. Result has 79 places, 84 transitions, 190 flow [2024-10-24 18:52:13,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=79, PETRI_TRANSITIONS=84} [2024-10-24 18:52:13,155 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, -1 predicate places. [2024-10-24 18:52:13,156 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 84 transitions, 190 flow [2024-10-24 18:52:13,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-10-24 18:52:13,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:13,156 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:13,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 18:52:13,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 18:52:13,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:13,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1563080630, now seen corresponding path program 1 times [2024-10-24 18:52:13,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:13,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702037275] [2024-10-24 18:52:13,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:13,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:52:13,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:13,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702037275] [2024-10-24 18:52:13,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702037275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:13,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:13,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:52:13,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088738730] [2024-10-24 18:52:13,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:13,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:52:13,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:13,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:52:13,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:52:13,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 96 [2024-10-24 18:52:13,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 84 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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-10-24 18:52:13,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:13,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 96 [2024-10-24 18:52:13,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:13,367 INFO L124 PetriNetUnfolderBase]: 264/711 cut-off events. [2024-10-24 18:52:13,367 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2024-10-24 18:52:13,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 711 events. 264/711 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4328 event pairs, 79 based on Foata normal form. 21/631 useless extension candidates. Maximal degree in co-relation 1194. Up to 261 conditions per place. [2024-10-24 18:52:13,376 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 30 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2024-10-24 18:52:13,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 93 transitions, 274 flow [2024-10-24 18:52:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:52:13,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 18:52:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2024-10-24 18:52:13,379 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7951388888888888 [2024-10-24 18:52:13,379 INFO L175 Difference]: Start difference. First operand has 79 places, 84 transitions, 190 flow. Second operand 3 states and 229 transitions. [2024-10-24 18:52:13,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 93 transitions, 274 flow [2024-10-24 18:52:13,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 93 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 18:52:13,386 INFO L231 Difference]: Finished difference. Result has 80 places, 84 transitions, 194 flow [2024-10-24 18:52:13,386 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=80, PETRI_TRANSITIONS=84} [2024-10-24 18:52:13,387 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places. [2024-10-24 18:52:13,388 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 194 flow [2024-10-24 18:52:13,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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-10-24 18:52:13,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:13,389 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:13,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 18:52:13,390 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 18:52:13,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:13,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1076584090, now seen corresponding path program 1 times [2024-10-24 18:52:13,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:13,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025868038] [2024-10-24 18:52:13,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:13,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:52:13,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:13,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025868038] [2024-10-24 18:52:13,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025868038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:13,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:13,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:52:13,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356560077] [2024-10-24 18:52:13,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:13,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:52:13,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:13,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:52:13,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:52:13,545 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 96 [2024-10-24 18:52:13,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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-10-24 18:52:13,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:13,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 96 [2024-10-24 18:52:13,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:13,854 INFO L124 PetriNetUnfolderBase]: 849/2118 cut-off events. [2024-10-24 18:52:13,854 INFO L125 PetriNetUnfolderBase]: For 192/202 co-relation queries the response was YES. [2024-10-24 18:52:13,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3569 conditions, 2118 events. 849/2118 cut-off events. For 192/202 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 15424 event pairs, 198 based on Foata normal form. 62/2055 useless extension candidates. Maximal degree in co-relation 3563. Up to 647 conditions per place. [2024-10-24 18:52:13,868 INFO L140 encePairwiseOnDemand]: 82/96 looper letters, 58 selfloop transitions, 15 changer transitions 0/127 dead transitions. [2024-10-24 18:52:13,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 127 transitions, 432 flow [2024-10-24 18:52:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:52:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 18:52:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 366 transitions. [2024-10-24 18:52:13,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7625 [2024-10-24 18:52:13,871 INFO L175 Difference]: Start difference. First operand has 80 places, 84 transitions, 194 flow. Second operand 5 states and 366 transitions. [2024-10-24 18:52:13,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 127 transitions, 432 flow [2024-10-24 18:52:13,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 127 transitions, 430 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 18:52:13,878 INFO L231 Difference]: Finished difference. Result has 87 places, 99 transitions, 326 flow [2024-10-24 18:52:13,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=87, PETRI_TRANSITIONS=99} [2024-10-24 18:52:13,880 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 7 predicate places. [2024-10-24 18:52:13,880 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 99 transitions, 326 flow [2024-10-24 18:52:13,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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-10-24 18:52:13,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:13,881 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:13,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 18:52:13,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 18:52:13,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash -398138120, now seen corresponding path program 2 times [2024-10-24 18:52:13,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:13,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766308485] [2024-10-24 18:52:13,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:52:13,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:13,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766308485] [2024-10-24 18:52:13,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766308485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:13,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:13,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:52:13,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659745778] [2024-10-24 18:52:13,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:13,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:52:13,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:13,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:52:13,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:52:14,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 96 [2024-10-24 18:52:14,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 99 transitions, 326 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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-10-24 18:52:14,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:14,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 96 [2024-10-24 18:52:14,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:14,368 INFO L124 PetriNetUnfolderBase]: 1085/2828 cut-off events. [2024-10-24 18:52:14,368 INFO L125 PetriNetUnfolderBase]: For 1318/1494 co-relation queries the response was YES. [2024-10-24 18:52:14,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5903 conditions, 2828 events. 1085/2828 cut-off events. For 1318/1494 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 21652 event pairs, 309 based on Foata normal form. 140/2853 useless extension candidates. Maximal degree in co-relation 5894. Up to 1020 conditions per place. [2024-10-24 18:52:14,389 INFO L140 encePairwiseOnDemand]: 82/96 looper letters, 60 selfloop transitions, 16 changer transitions 0/140 dead transitions. [2024-10-24 18:52:14,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 140 transitions, 603 flow [2024-10-24 18:52:14,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:52:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 18:52:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 364 transitions. [2024-10-24 18:52:14,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7583333333333333 [2024-10-24 18:52:14,392 INFO L175 Difference]: Start difference. First operand has 87 places, 99 transitions, 326 flow. Second operand 5 states and 364 transitions. [2024-10-24 18:52:14,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 140 transitions, 603 flow [2024-10-24 18:52:14,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 140 transitions, 603 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 18:52:14,400 INFO L231 Difference]: Finished difference. Result has 95 places, 114 transitions, 476 flow [2024-10-24 18:52:14,401 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=476, PETRI_PLACES=95, PETRI_TRANSITIONS=114} [2024-10-24 18:52:14,401 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 15 predicate places. [2024-10-24 18:52:14,402 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 114 transitions, 476 flow [2024-10-24 18:52:14,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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-10-24 18:52:14,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:14,402 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:14,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 18:52:14,403 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 18:52:14,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:14,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1528319360, now seen corresponding path program 3 times [2024-10-24 18:52:14,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:14,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310280612] [2024-10-24 18:52:14,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:14,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:52:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310280612] [2024-10-24 18:52:14,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310280612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:14,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:14,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:52:14,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483524649] [2024-10-24 18:52:14,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:14,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:52:14,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:14,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:52:14,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:52:14,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 96 [2024-10-24 18:52:14,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 114 transitions, 476 flow. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 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-10-24 18:52:14,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:14,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 96 [2024-10-24 18:52:14,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:14,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L840-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thr2Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork1_#res#1.offset=|v_thr2Thread1of1ForFork1_#res#1.offset_1|, thr2Thread1of1ForFork1_#res#1.base=|v_thr2Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_#res#1.offset, thr2Thread1of1ForFork1_#res#1.base][82], [Black: 99#(= ~y~0 1), Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), 107#true, 86#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 117#true, 71#L710true, 97#true, 95#(= ~X~0 1), Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 109#(= 2 ~y~0), 64#thr2EXITtrue, 48#L847true, Black: 90#(= ~X~0 0)]) [2024-10-24 18:52:14,910 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-24 18:52:14,910 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 18:52:14,910 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:14,910 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-24 18:52:15,136 INFO L124 PetriNetUnfolderBase]: 1908/5784 cut-off events. [2024-10-24 18:52:15,137 INFO L125 PetriNetUnfolderBase]: For 3525/4002 co-relation queries the response was YES. [2024-10-24 18:52:15,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12668 conditions, 5784 events. 1908/5784 cut-off events. For 3525/4002 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 53979 event pairs, 350 based on Foata normal form. 232/5645 useless extension candidates. Maximal degree in co-relation 12655. Up to 775 conditions per place. [2024-10-24 18:52:15,188 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 64 selfloop transitions, 6 changer transitions 0/161 dead transitions. [2024-10-24 18:52:15,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 161 transitions, 786 flow [2024-10-24 18:52:15,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:52:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 18:52:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 391 transitions. [2024-10-24 18:52:15,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8145833333333333 [2024-10-24 18:52:15,190 INFO L175 Difference]: Start difference. First operand has 95 places, 114 transitions, 476 flow. Second operand 5 states and 391 transitions. [2024-10-24 18:52:15,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 161 transitions, 786 flow [2024-10-24 18:52:15,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 161 transitions, 784 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-24 18:52:15,206 INFO L231 Difference]: Finished difference. Result has 103 places, 120 transitions, 524 flow [2024-10-24 18:52:15,206 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=524, PETRI_PLACES=103, PETRI_TRANSITIONS=120} [2024-10-24 18:52:15,208 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 23 predicate places. [2024-10-24 18:52:15,209 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 120 transitions, 524 flow [2024-10-24 18:52:15,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 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-10-24 18:52:15,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:15,209 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:15,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 18:52:15,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 18:52:15,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:15,210 INFO L85 PathProgramCache]: Analyzing trace with hash -160150336, now seen corresponding path program 4 times [2024-10-24 18:52:15,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:15,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887682031] [2024-10-24 18:52:15,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:15,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:52:15,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:15,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887682031] [2024-10-24 18:52:15,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887682031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:15,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:15,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:52:15,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9516049] [2024-10-24 18:52:15,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:15,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:52:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:15,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:52:15,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:52:15,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 96 [2024-10-24 18:52:15,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 120 transitions, 524 flow. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 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-10-24 18:52:15,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:15,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 96 [2024-10-24 18:52:15,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:16,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L770-->thr1EXIT: Formula: (and (= |v_thr1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thr1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_1|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_#res#1.base][151], [Black: 95#(= ~X~0 1), 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 99#(= ~y~0 1), 107#true, Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), 86#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 97#true, 119#(= 2 ~x~0), 5#L846-4true, Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), 17#L780true, Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), 74#thr1EXITtrue, Black: 109#(= 2 ~y~0), Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 88#true, Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 117#true]) [2024-10-24 18:52:16,090 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-10-24 18:52:16,090 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 18:52:16,091 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 18:52:16,091 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 18:52:16,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L770-->thr1EXIT: Formula: (and (= |v_thr1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thr1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_1|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_#res#1.base][151], [130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 95#(= ~X~0 1), Black: 99#(= ~y~0 1), Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), 107#true, 86#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 97#true, 119#(= 2 ~x~0), 17#L780true, Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 109#(= 2 ~y~0), 74#thr1EXITtrue, Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), 48#L847true, Black: 88#true, Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 117#true]) [2024-10-24 18:52:16,113 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-10-24 18:52:16,114 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 18:52:16,114 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-10-24 18:52:16,114 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 18:52:16,345 INFO L124 PetriNetUnfolderBase]: 2792/8624 cut-off events. [2024-10-24 18:52:16,345 INFO L125 PetriNetUnfolderBase]: For 6256/6985 co-relation queries the response was YES. [2024-10-24 18:52:16,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19752 conditions, 8624 events. 2792/8624 cut-off events. For 6256/6985 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 85042 event pairs, 499 based on Foata normal form. 349/8615 useless extension candidates. Maximal degree in co-relation 19735. Up to 1286 conditions per place. [2024-10-24 18:52:16,490 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 68 selfloop transitions, 11 changer transitions 0/172 dead transitions. [2024-10-24 18:52:16,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 172 transitions, 896 flow [2024-10-24 18:52:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:52:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 18:52:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 394 transitions. [2024-10-24 18:52:16,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8208333333333333 [2024-10-24 18:52:16,493 INFO L175 Difference]: Start difference. First operand has 103 places, 120 transitions, 524 flow. Second operand 5 states and 394 transitions. [2024-10-24 18:52:16,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 172 transitions, 896 flow [2024-10-24 18:52:16,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 172 transitions, 896 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 18:52:16,506 INFO L231 Difference]: Finished difference. Result has 111 places, 128 transitions, 618 flow [2024-10-24 18:52:16,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=618, PETRI_PLACES=111, PETRI_TRANSITIONS=128} [2024-10-24 18:52:16,508 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 31 predicate places. [2024-10-24 18:52:16,508 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 128 transitions, 618 flow [2024-10-24 18:52:16,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 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-10-24 18:52:16,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:16,509 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:16,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 18:52:16,509 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 18:52:16,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:16,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1773422197, now seen corresponding path program 1 times [2024-10-24 18:52:16,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:16,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798479946] [2024-10-24 18:52:16,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:16,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:52:16,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:16,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798479946] [2024-10-24 18:52:16,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798479946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:16,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:16,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:52:16,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238389500] [2024-10-24 18:52:16,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:16,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:52:16,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:16,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:52:16,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:52:16,568 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 96 [2024-10-24 18:52:16,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 128 transitions, 618 flow. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 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-10-24 18:52:16,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:16,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 96 [2024-10-24 18:52:16,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:16,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][18], [Black: 95#(= ~X~0 1), 139#(= ~b2~0 1), 99#(= ~y~0 1), Black: 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 132#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 129#(= ~x~0 1), Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), 107#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 86#true, 53#L733true, Black: 97#true, 119#(= 2 ~x~0), 5#L846-4true, 17#L780true, Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 109#(= 2 ~y~0), Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), 127#true, Black: 88#true, Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 117#true]) [2024-10-24 18:52:16,728 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-24 18:52:16,728 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-24 18:52:16,728 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 18:52:16,728 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 18:52:16,746 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][18], [Black: 95#(= ~X~0 1), 139#(= ~b2~0 1), 99#(= ~y~0 1), Black: 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 132#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 129#(= ~x~0 1), Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), 107#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 86#true, Black: 97#true, 53#L733true, 119#(= 2 ~x~0), 17#L780true, Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 109#(= 2 ~y~0), Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), 48#L847true, Black: 88#true, 127#true, Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 117#true]) [2024-10-24 18:52:16,747 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-24 18:52:16,747 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-24 18:52:16,747 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 18:52:16,747 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 18:52:16,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L737-->L744: Formula: (= v_~b2~0_5 |v_thr1Thread1of1ForFork0_~b21~0#1_1|) InVars {~b2~0=v_~b2~0_5} OutVars{thr1Thread1of1ForFork0_~b21~0#1=|v_thr1Thread1of1ForFork0_~b21~0#1_1|, ~b2~0=v_~b2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~b21~0#1][41], [Black: 95#(= ~X~0 1), 99#(= ~y~0 1), Black: 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 132#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), 107#true, Black: 127#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 86#true, 56#L777true, Black: 97#true, 117#true, 5#L846-4true, 40#L744true, Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 109#(= 2 ~y~0), Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), 129#(= ~x~0 1), Black: 88#true, Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), 142#(and (= |thr1Thread1of1ForFork0_~b21~0#1| 1) (= ~b2~0 1)), Black: 119#(= 2 ~x~0)]) [2024-10-24 18:52:16,769 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-24 18:52:16,769 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 18:52:16,769 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 18:52:16,769 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 18:52:16,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L737-->L744: Formula: (= v_~b2~0_5 |v_thr1Thread1of1ForFork0_~b21~0#1_1|) InVars {~b2~0=v_~b2~0_5} OutVars{thr1Thread1of1ForFork0_~b21~0#1=|v_thr1Thread1of1ForFork0_~b21~0#1_1|, ~b2~0=v_~b2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~b21~0#1][41], [Black: 95#(= ~X~0 1), 99#(= ~y~0 1), Black: 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 132#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), 107#true, Black: 127#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 86#true, Black: 97#true, 56#L777true, 117#true, 40#L744true, Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 109#(= 2 ~y~0), Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), 129#(= ~x~0 1), 48#L847true, Black: 88#true, Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 119#(= 2 ~x~0), 142#(and (= |thr1Thread1of1ForFork0_~b21~0#1| 1) (= ~b2~0 1))]) [2024-10-24 18:52:16,794 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-24 18:52:16,794 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:16,795 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:16,795 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 18:52:17,049 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([388] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][18], [Black: 95#(= ~X~0 1), 139#(= ~b2~0 1), 99#(= ~y~0 1), Black: 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 132#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 129#(= ~x~0 1), 107#true, Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), 86#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), Black: 97#true, 53#L733true, 119#(= 2 ~x~0), 5#L846-4true, Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), 17#L780true, Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 109#(= 2 ~y~0), Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 88#true, Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), 127#true, Black: 117#true]) [2024-10-24 18:52:17,049 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-24 18:52:17,049 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-24 18:52:17,049 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-24 18:52:17,050 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 18:52:17,050 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 18:52:17,073 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([388] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][18], [Black: 95#(= ~X~0 1), 139#(= ~b2~0 1), 99#(= ~y~0 1), Black: 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 132#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 129#(= ~x~0 1), Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), 107#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 86#true, Black: 97#true, 53#L733true, 119#(= 2 ~x~0), Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), 17#L780true, Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 109#(= 2 ~y~0), 48#L847true, Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 88#true, 127#true, Black: 117#true]) [2024-10-24 18:52:17,073 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-24 18:52:17,074 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-24 18:52:17,074 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 18:52:17,074 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 18:52:17,074 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 18:52:17,103 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([449] L737-->L744: Formula: (= v_~b2~0_5 |v_thr1Thread1of1ForFork0_~b21~0#1_1|) InVars {~b2~0=v_~b2~0_5} OutVars{thr1Thread1of1ForFork0_~b21~0#1=|v_thr1Thread1of1ForFork0_~b21~0#1_1|, ~b2~0=v_~b2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~b21~0#1][41], [Black: 95#(= ~X~0 1), 99#(= ~y~0 1), Black: 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 132#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), 107#true, Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 127#true, 86#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), Black: 97#true, 56#L777true, 117#true, 5#L846-4true, 40#L744true, Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 109#(= 2 ~y~0), Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), 129#(= ~x~0 1), Black: 88#true, Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), 142#(and (= |thr1Thread1of1ForFork0_~b21~0#1| 1) (= ~b2~0 1)), Black: 119#(= 2 ~x~0)]) [2024-10-24 18:52:17,103 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-24 18:52:17,104 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 18:52:17,104 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-24 18:52:17,104 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 18:52:17,104 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 18:52:17,130 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([449] L737-->L744: Formula: (= v_~b2~0_5 |v_thr1Thread1of1ForFork0_~b21~0#1_1|) InVars {~b2~0=v_~b2~0_5} OutVars{thr1Thread1of1ForFork0_~b21~0#1=|v_thr1Thread1of1ForFork0_~b21~0#1_1|, ~b2~0=v_~b2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~b21~0#1][41], [Black: 95#(= ~X~0 1), 99#(= ~y~0 1), Black: 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 132#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), 107#true, Black: 127#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 86#true, Black: 97#true, 56#L777true, 117#true, 40#L744true, Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 109#(= 2 ~y~0), 129#(= ~x~0 1), 48#L847true, Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 88#true, 142#(and (= |thr1Thread1of1ForFork0_~b21~0#1| 1) (= ~b2~0 1)), Black: 119#(= 2 ~x~0)]) [2024-10-24 18:52:17,130 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-10-24 18:52:17,130 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:17,131 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 18:52:17,131 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:17,131 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-24 18:52:17,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L770-->thr1EXIT: Formula: (and (= |v_thr1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thr1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_1|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_#res#1.base][64], [Black: 95#(= ~X~0 1), 132#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 99#(= ~y~0 1), Black: 129#(= ~x~0 1), Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 127#true, 137#true, 107#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 86#true, 117#true, 97#true, Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), 74#thr1EXITtrue, Black: 109#(= 2 ~y~0), 12#L823-1true, 48#L847true, Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 88#true, Black: 119#(= 2 ~x~0)]) [2024-10-24 18:52:17,461 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2024-10-24 18:52:17,461 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 18:52:17,461 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 18:52:17,461 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-24 18:52:17,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L770-->thr1EXIT: Formula: (and (= |v_thr1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thr1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_1|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_#res#1.base][63], [Black: 95#(= ~X~0 1), 139#(= ~b2~0 1), 132#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 99#(= ~y~0 1), Black: 129#(= ~x~0 1), Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 127#true, 107#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 86#true, 56#L777true, 117#true, 97#true, Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), 74#thr1EXITtrue, Black: 109#(= 2 ~y~0), 48#L847true, Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 88#true, Black: 119#(= 2 ~x~0)]) [2024-10-24 18:52:17,468 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2024-10-24 18:52:17,469 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 18:52:17,469 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 18:52:17,469 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 18:52:17,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([388] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][121], [Black: 95#(= ~X~0 1), 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), 139#(= ~b2~0 1), 99#(= ~y~0 1), Black: 132#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 129#(= ~x~0 1), 107#true, Black: 127#true, Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), 86#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), Black: 97#true, 53#L733true, 119#(= 2 ~x~0), Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), 17#L780true, Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 109#(= 2 ~y~0), 48#L847true, Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 88#true, Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 117#true]) [2024-10-24 18:52:17,474 INFO L294 olderBase$Statistics]: this new event has 65 ancestors and is cut-off event [2024-10-24 18:52:17,474 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 18:52:17,474 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-10-24 18:52:17,474 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2024-10-24 18:52:17,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([449] L737-->L744: Formula: (= v_~b2~0_5 |v_thr1Thread1of1ForFork0_~b21~0#1_1|) InVars {~b2~0=v_~b2~0_5} OutVars{thr1Thread1of1ForFork0_~b21~0#1=|v_thr1Thread1of1ForFork0_~b21~0#1_1|, ~b2~0=v_~b2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~b21~0#1][41], [Black: 95#(= ~X~0 1), 132#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), 99#(= ~y~0 1), Black: 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 129#(= ~x~0 1), 107#true, Black: 127#true, Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), 86#true, Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), Black: 97#true, 56#L777true, 117#true, Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), 40#L744true, Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 109#(= 2 ~y~0), 48#L847true, Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 88#true, Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), 142#(and (= |thr1Thread1of1ForFork0_~b21~0#1| 1) (= ~b2~0 1)), Black: 119#(= 2 ~x~0)]) [2024-10-24 18:52:17,476 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is cut-off event [2024-10-24 18:52:17,477 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-10-24 18:52:17,477 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 18:52:17,477 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2024-10-24 18:52:17,479 INFO L124 PetriNetUnfolderBase]: 2993/8578 cut-off events. [2024-10-24 18:52:17,479 INFO L125 PetriNetUnfolderBase]: For 5341/5790 co-relation queries the response was YES. [2024-10-24 18:52:17,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19777 conditions, 8578 events. 2993/8578 cut-off events. For 5341/5790 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 82498 event pairs, 955 based on Foata normal form. 292/8390 useless extension candidates. Maximal degree in co-relation 19756. Up to 2934 conditions per place. [2024-10-24 18:52:17,543 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 40 selfloop transitions, 11 changer transitions 0/152 dead transitions. [2024-10-24 18:52:17,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 152 transitions, 789 flow [2024-10-24 18:52:17,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:52:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 18:52:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 363 transitions. [2024-10-24 18:52:17,545 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75625 [2024-10-24 18:52:17,545 INFO L175 Difference]: Start difference. First operand has 111 places, 128 transitions, 618 flow. Second operand 5 states and 363 transitions. [2024-10-24 18:52:17,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 152 transitions, 789 flow [2024-10-24 18:52:17,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 152 transitions, 785 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-10-24 18:52:17,564 INFO L231 Difference]: Finished difference. Result has 118 places, 134 transitions, 671 flow [2024-10-24 18:52:17,564 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=671, PETRI_PLACES=118, PETRI_TRANSITIONS=134} [2024-10-24 18:52:17,566 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 38 predicate places. [2024-10-24 18:52:17,566 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 134 transitions, 671 flow [2024-10-24 18:52:17,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 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-10-24 18:52:17,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:17,567 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:17,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 18:52:17,567 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 18:52:17,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:17,568 INFO L85 PathProgramCache]: Analyzing trace with hash -919585953, now seen corresponding path program 1 times [2024-10-24 18:52:17,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:17,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32667053] [2024-10-24 18:52:17,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:17,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:17,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:52:17,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:17,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32667053] [2024-10-24 18:52:17,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32667053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:17,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:17,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:52:17,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386392769] [2024-10-24 18:52:17,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:17,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:52:17,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:17,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:52:17,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:52:17,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 96 [2024-10-24 18:52:17,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 134 transitions, 671 flow. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 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-10-24 18:52:17,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:17,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 96 [2024-10-24 18:52:17,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:18,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L840-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thr2Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork1_#res#1.offset=|v_thr2Thread1of1ForFork1_#res#1.offset_1|, thr2Thread1of1ForFork1_#res#1.base=|v_thr2Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_#res#1.offset, thr2Thread1of1ForFork1_#res#1.base][85], [30#L707true, Black: 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 132#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 129#(= ~x~0 1), 137#true, 107#true, 86#true, 95#(= ~X~0 1), 119#(= 2 ~x~0), Black: 139#(= ~b2~0 1), Black: 140#(= |thr1Thread1of1ForFork0_~b21~0#1| 1), Black: 142#(and (= |thr1Thread1of1ForFork0_~b21~0#1| 1) (= ~b2~0 1)), Black: 90#(= ~X~0 0), 48#L847true, Black: 99#(= ~y~0 1), Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 148#(= ~b1~0 1), 97#true, Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 109#(= 2 ~y~0), 64#thr2EXITtrue, Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), 127#true, Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), Black: 117#true]) [2024-10-24 18:52:18,101 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-10-24 18:52:18,101 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:18,101 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:18,102 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-24 18:52:18,586 INFO L124 PetriNetUnfolderBase]: 2448/7425 cut-off events. [2024-10-24 18:52:18,587 INFO L125 PetriNetUnfolderBase]: For 5087/5354 co-relation queries the response was YES. [2024-10-24 18:52:18,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18095 conditions, 7425 events. 2448/7425 cut-off events. For 5087/5354 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 71170 event pairs, 848 based on Foata normal form. 231/7364 useless extension candidates. Maximal degree in co-relation 18070. Up to 2315 conditions per place. [2024-10-24 18:52:18,648 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 38 selfloop transitions, 11 changer transitions 0/150 dead transitions. [2024-10-24 18:52:18,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 150 transitions, 803 flow [2024-10-24 18:52:18,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:52:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 18:52:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2024-10-24 18:52:18,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7520833333333333 [2024-10-24 18:52:18,650 INFO L175 Difference]: Start difference. First operand has 118 places, 134 transitions, 671 flow. Second operand 5 states and 361 transitions. [2024-10-24 18:52:18,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 150 transitions, 803 flow [2024-10-24 18:52:18,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 150 transitions, 793 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-10-24 18:52:18,676 INFO L231 Difference]: Finished difference. Result has 118 places, 132 transitions, 682 flow [2024-10-24 18:52:18,676 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=682, PETRI_PLACES=118, PETRI_TRANSITIONS=132} [2024-10-24 18:52:18,677 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 38 predicate places. [2024-10-24 18:52:18,677 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 132 transitions, 682 flow [2024-10-24 18:52:18,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 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-10-24 18:52:18,677 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:18,678 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:18,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 18:52:18,678 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-24 18:52:18,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:18,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2121175144, now seen corresponding path program 1 times [2024-10-24 18:52:18,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:18,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667503890] [2024-10-24 18:52:18,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:18,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:52:18,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:18,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667503890] [2024-10-24 18:52:18,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667503890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:18,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:18,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:52:18,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061802166] [2024-10-24 18:52:18,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:18,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:52:18,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:18,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:52:18,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:52:18,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 96 [2024-10-24 18:52:18,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 132 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-10-24 18:52:18,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:18,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 96 [2024-10-24 18:52:18,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:19,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L840-->thr2EXIT: Formula: (and (= |v_thr2Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thr2Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thr2Thread1of1ForFork1_#res#1.offset=|v_thr2Thread1of1ForFork1_#res#1.offset_1|, thr2Thread1of1ForFork1_#res#1.base=|v_thr2Thread1of1ForFork1_#res#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_#res#1.offset, thr2Thread1of1ForFork1_#res#1.base][81], [Black: 130#(= |thr2Thread1of1ForFork1_~x2~0#1| 1), Black: 132#(and (= ~x~0 1) (= |thr2Thread1of1ForFork1_~x2~0#1| 1)), Black: 129#(= ~x~0 1), 107#true, 157#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 137#true, 86#true, 95#(= ~X~0 1), Black: 139#(= ~b2~0 1), 119#(= 2 ~x~0), Black: 140#(= |thr1Thread1of1ForFork0_~b21~0#1| 1), Black: 142#(and (= |thr1Thread1of1ForFork0_~b21~0#1| 1) (= ~b2~0 1)), 49#L753-1true, Black: 148#(= ~b1~0 1), Black: 151#(and (= |thr2Thread1of1ForFork1_~b12~0#1| 1) (= ~b1~0 1)), Black: 149#(= |thr2Thread1of1ForFork1_~b12~0#1| 1), 48#L847true, Black: 90#(= ~X~0 0), Black: 99#(= ~y~0 1), Black: 102#(and (= |thr2Thread1of1ForFork1_~y2~0#1| 1) (= ~y~0 1)), Black: 100#(= |thr2Thread1of1ForFork1_~y2~0#1| 1), 97#true, 146#true, Black: 112#(and (= |thr1Thread1of1ForFork0_~y1~0#1| 2) (= 2 ~y~0)), Black: 110#(= |thr1Thread1of1ForFork0_~y1~0#1| 2), Black: 109#(= 2 ~y~0), 64#thr2EXITtrue, Black: 120#(= |thr1Thread1of1ForFork0_~x1~0#1| 2), Black: 122#(and (= 2 ~x~0) (= |thr1Thread1of1ForFork0_~x1~0#1| 2)), 127#true, Black: 117#true]) [2024-10-24 18:52:19,206 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-10-24 18:52:19,206 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:19,206 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:19,206 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 18:52:19,231 INFO L124 PetriNetUnfolderBase]: 1545/5136 cut-off events. [2024-10-24 18:52:19,231 INFO L125 PetriNetUnfolderBase]: For 4055/4243 co-relation queries the response was YES. [2024-10-24 18:52:19,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13043 conditions, 5136 events. 1545/5136 cut-off events. For 4055/4243 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 48758 event pairs, 603 based on Foata normal form. 82/4794 useless extension candidates. Maximal degree in co-relation 13015. Up to 1528 conditions per place. [2024-10-24 18:52:19,255 INFO L140 encePairwiseOnDemand]: 94/96 looper letters, 0 selfloop transitions, 0 changer transitions 131/131 dead transitions. [2024-10-24 18:52:19,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 131 transitions, 714 flow [2024-10-24 18:52:19,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:52:19,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 18:52:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2024-10-24 18:52:19,257 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7604166666666666 [2024-10-24 18:52:19,257 INFO L175 Difference]: Start difference. First operand has 118 places, 132 transitions, 682 flow. Second operand 3 states and 219 transitions. [2024-10-24 18:52:19,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 131 transitions, 714 flow [2024-10-24 18:52:19,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 131 transitions, 711 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 18:52:19,277 INFO L231 Difference]: Finished difference. Result has 118 places, 0 transitions, 0 flow [2024-10-24 18:52:19,277 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=118, PETRI_TRANSITIONS=0} [2024-10-24 18:52:19,278 INFO L277 CegarLoopForPetriNet]: 80 programPoint places, 38 predicate places. [2024-10-24 18:52:19,278 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 0 transitions, 0 flow [2024-10-24 18:52:19,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-10-24 18:52:19,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-10-24 18:52:19,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-10-24 18:52:19,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-10-24 18:52:19,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-24 18:52:19,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-24 18:52:19,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-10-24 18:52:19,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-10-24 18:52:19,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 18:52:19,283 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:19,289 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 18:52:19,290 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 18:52:19,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:52:19 BasicIcfg [2024-10-24 18:52:19,297 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 18:52:19,298 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 18:52:19,298 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 18:52:19,298 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 18:52:19,298 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:52:12" (3/4) ... [2024-10-24 18:52:19,300 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 18:52:19,303 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2024-10-24 18:52:19,303 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2024-10-24 18:52:19,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2024-10-24 18:52:19,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-24 18:52:19,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-24 18:52:19,308 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 18:52:19,388 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 18:52:19,389 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 18:52:19,389 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 18:52:19,391 INFO L158 Benchmark]: Toolchain (without parser) took 8363.89ms. Allocated memory was 192.9MB in the beginning and 763.4MB in the end (delta: 570.4MB). Free memory was 124.5MB in the beginning and 403.7MB in the end (delta: -279.2MB). Peak memory consumption was 293.6MB. Max. memory is 16.1GB. [2024-10-24 18:52:19,391 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:52:19,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.69ms. Allocated memory is still 192.9MB. Free memory was 124.3MB in the beginning and 156.6MB in the end (delta: -32.2MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-10-24 18:52:19,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.72ms. Allocated memory is still 192.9MB. Free memory was 156.6MB in the beginning and 154.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 18:52:19,392 INFO L158 Benchmark]: Boogie Preprocessor took 52.36ms. Allocated memory is still 192.9MB. Free memory was 154.5MB in the beginning and 152.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 18:52:19,392 INFO L158 Benchmark]: RCFGBuilder took 447.64ms. Allocated memory is still 192.9MB. Free memory was 152.4MB in the beginning and 131.5MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 18:52:19,392 INFO L158 Benchmark]: TraceAbstraction took 7153.78ms. Allocated memory was 192.9MB in the beginning and 763.4MB in the end (delta: 570.4MB). Free memory was 131.5MB in the beginning and 407.9MB in the end (delta: -276.4MB). Peak memory consumption was 328.0MB. Max. memory is 16.1GB. [2024-10-24 18:52:19,393 INFO L158 Benchmark]: Witness Printer took 91.91ms. Allocated memory is still 763.4MB. Free memory was 407.9MB in the beginning and 403.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 18:52:19,394 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.69ms. Allocated memory is still 192.9MB. Free memory was 124.3MB in the beginning and 156.6MB in the end (delta: -32.2MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.72ms. Allocated memory is still 192.9MB. Free memory was 156.6MB in the beginning and 154.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.36ms. Allocated memory is still 192.9MB. Free memory was 154.5MB in the beginning and 152.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 447.64ms. Allocated memory is still 192.9MB. Free memory was 152.4MB in the beginning and 131.5MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7153.78ms. Allocated memory was 192.9MB in the beginning and 763.4MB in the end (delta: 570.4MB). Free memory was 131.5MB in the beginning and 407.9MB in the end (delta: -276.4MB). Peak memory consumption was 328.0MB. Max. memory is 16.1GB. * Witness Printer took 91.91ms. Allocated memory is still 763.4MB. Free memory was 407.9MB in the beginning and 403.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 843]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 145 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 284 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 836 IncrementalHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 50 mSDtfsCounter, 836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=682occurred in iteration=9, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 457 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-24 18:52:19,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE