./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/40_barrier_vf.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-ext/40_barrier_vf.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e83225601d835c9b02ede9a5751213533e33817a9795ca1ab6ec7c2abd672056 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:40:35,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:40:35,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:40:35,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:40:35,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:40:35,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:40:35,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:40:35,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:40:35,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:40:35,726 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:40:35,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:40:35,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:40:35,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:40:35,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:40:35,726 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:40:35,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:40:35,726 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:40:35,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:40:35,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:40:35,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:40:35,726 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:40:35,726 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:40:35,727 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:40:35,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:40:35,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:40:35,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:40:35,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:40:35,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:40:35,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:40:35,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:40:35,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:40:35,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:40:35,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:40:35,728 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e83225601d835c9b02ede9a5751213533e33817a9795ca1ab6ec7c2abd672056 [2025-01-10 00:40:35,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:40:35,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:40:35,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:40:35,969 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:40:35,969 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:40:35,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2025-01-10 00:40:37,181 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83492271f/da3ce769a3cf402d80ee469f0e12fb9c/FLAG0af969c92 [2025-01-10 00:40:37,460 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:40:37,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2025-01-10 00:40:37,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83492271f/da3ce769a3cf402d80ee469f0e12fb9c/FLAG0af969c92 [2025-01-10 00:40:37,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83492271f/da3ce769a3cf402d80ee469f0e12fb9c [2025-01-10 00:40:37,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:40:37,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:40:37,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:40:37,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:40:37,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:40:37,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2598433d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:37, skipping insertion in model container [2025-01-10 00:40:37,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:40:37" (1/1) ... [2025-01-10 00:40:37,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:40:37,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:40:38,015 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:40:38,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:40:38,067 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:40:38,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38 WrapperNode [2025-01-10 00:40:38,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:40:38,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:40:38,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:40:38,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:40:38,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38" (1/1) ... [2025-01-10 00:40:38,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38" (1/1) ... [2025-01-10 00:40:38,094 INFO L138 Inliner]: procedures = 164, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 168 [2025-01-10 00:40:38,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:40:38,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:40:38,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:40:38,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:40:38,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38" (1/1) ... [2025-01-10 00:40:38,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38" (1/1) ... [2025-01-10 00:40:38,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38" (1/1) ... [2025-01-10 00:40:38,118 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-01-10 00:40:38,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38" (1/1) ... [2025-01-10 00:40:38,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38" (1/1) ... [2025-01-10 00:40:38,128 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38" (1/1) ... [2025-01-10 00:40:38,129 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38" (1/1) ... [2025-01-10 00:40:38,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38" (1/1) ... [2025-01-10 00:40:38,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38" (1/1) ... [2025-01-10 00:40:38,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38" (1/1) ... [2025-01-10 00:40:38,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:40:38,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:40:38,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:40:38,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:40:38,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38" (1/1) ... [2025-01-10 00:40:38,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:40:38,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:40:38,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:40:38,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:40:38,212 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 00:40:38,213 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 00:40:38,213 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:40:38,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:40:38,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:40:38,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:40:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:40:38,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:40:38,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:40:38,215 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:40:38,332 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:40:38,333 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:40:38,556 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:40:38,556 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:40:39,242 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:40:39,243 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 00:40:39,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:40:39 BoogieIcfgContainer [2025-01-10 00:40:39,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:40:39,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:40:39,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:40:39,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:40:39,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:40:37" (1/3) ... [2025-01-10 00:40:39,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5153f781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:40:39, skipping insertion in model container [2025-01-10 00:40:39,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:38" (2/3) ... [2025-01-10 00:40:39,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5153f781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:40:39, skipping insertion in model container [2025-01-10 00:40:39,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:40:39" (3/3) ... [2025-01-10 00:40:39,253 INFO L128 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2025-01-10 00:40:39,263 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:40:39,264 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 40_barrier_vf.i that has 2 procedures, 23 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-10 00:40:39,264 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:40:39,298 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:39,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 27 transitions, 58 flow [2025-01-10 00:40:39,357 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-01-10 00:40:39,359 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:39,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 31 events. 4/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-01-10 00:40:39,363 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 27 transitions, 58 flow [2025-01-10 00:40:39,365 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 27 transitions, 58 flow [2025-01-10 00:40:39,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:39,383 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;@55603865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:39,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 00:40:39,401 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:39,402 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:40:39,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:39,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:39,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:40:39,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:40:39,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:39,407 INFO L85 PathProgramCache]: Analyzing trace with hash 416091, now seen corresponding path program 1 times [2025-01-10 00:40:39,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:39,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501910275] [2025-01-10 00:40:39,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:39,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:40:39,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:40:39,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:39,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:39,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:39,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501910275] [2025-01-10 00:40:39,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501910275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:39,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:39,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:39,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31631869] [2025-01-10 00:40:39,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:39,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:39,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:39,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:39,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:39,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-01-10 00:40:39,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 27 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:39,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:39,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-01-10 00:40:39,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:39,856 INFO L124 PetriNetUnfolderBase]: 20/63 cut-off events. [2025-01-10 00:40:39,857 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:39,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 63 events. 20/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 142 event pairs, 14 based on Foata normal form. 9/69 useless extension candidates. Maximal degree in co-relation 98. Up to 44 conditions per place. [2025-01-10 00:40:39,859 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 12 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2025-01-10 00:40:39,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 19 transitions, 66 flow [2025-01-10 00:40:39,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2025-01-10 00:40:39,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2025-01-10 00:40:39,869 INFO L175 Difference]: Start difference. First operand has 26 places, 27 transitions, 58 flow. Second operand 2 states and 32 transitions. [2025-01-10 00:40:39,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 19 transitions, 66 flow [2025-01-10 00:40:39,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 19 transitions, 66 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:39,875 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 42 flow [2025-01-10 00:40:39,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2025-01-10 00:40:39,880 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, -5 predicate places. [2025-01-10 00:40:39,880 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 42 flow [2025-01-10 00:40:39,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:39,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:39,882 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 00:40:39,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:40:39,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-10 00:40:39,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash -486798673, now seen corresponding path program 1 times [2025-01-10 00:40:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:39,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309008779] [2025-01-10 00:40:39,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:39,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:40,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:40:40,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:40:40,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:40,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:40,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:40:40,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:40:40,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:40:40,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:40,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:40,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:40:40,058 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:40:40,059 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-10 00:40:40,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-01-10 00:40:40,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 4 remaining) [2025-01-10 00:40:40,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2025-01-10 00:40:40,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:40:40,061 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 00:40:40,063 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:40:40,063 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:40:40,087 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:40,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 47 transitions, 104 flow [2025-01-10 00:40:40,108 INFO L124 PetriNetUnfolderBase]: 8/56 cut-off events. [2025-01-10 00:40:40,109 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:40:40,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 56 events. 8/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 143 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 43. Up to 3 conditions per place. [2025-01-10 00:40:40,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 47 transitions, 104 flow [2025-01-10 00:40:40,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 47 transitions, 104 flow [2025-01-10 00:40:40,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:40,113 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;@55603865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:40,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-10 00:40:40,121 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:40,121 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:40:40,121 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:40,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:40,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:40:40,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:40:40,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash 462762, now seen corresponding path program 1 times [2025-01-10 00:40:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:40,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520943906] [2025-01-10 00:40:40,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:40,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:40:40,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:40:40,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:40,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:40,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:40,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520943906] [2025-01-10 00:40:40,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520943906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:40,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:40,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:40,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557117003] [2025-01-10 00:40:40,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:40,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:40,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:40,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:40,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:40,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2025-01-10 00:40:40,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 47 transitions, 104 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:40,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:40,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2025-01-10 00:40:40,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:40,469 INFO L124 PetriNetUnfolderBase]: 435/893 cut-off events. [2025-01-10 00:40:40,472 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-10 00:40:40,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1555 conditions, 893 events. 435/893 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4625 event pairs, 330 based on Foata normal form. 159/992 useless extension candidates. Maximal degree in co-relation 1110. Up to 633 conditions per place. [2025-01-10 00:40:40,488 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 21 selfloop transitions, 0 changer transitions 0/34 dead transitions. [2025-01-10 00:40:40,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 120 flow [2025-01-10 00:40:40,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2025-01-10 00:40:40,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2025-01-10 00:40:40,493 INFO L175 Difference]: Start difference. First operand has 44 places, 47 transitions, 104 flow. Second operand 2 states and 56 transitions. [2025-01-10 00:40:40,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 120 flow [2025-01-10 00:40:40,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:40,496 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 78 flow [2025-01-10 00:40:40,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-01-10 00:40:40,497 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -8 predicate places. [2025-01-10 00:40:40,497 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 78 flow [2025-01-10 00:40:40,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:40,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:40,497 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-10 00:40:40,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:40:40,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 00:40:40,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1315863875, now seen corresponding path program 1 times [2025-01-10 00:40:40,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:40,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949345827] [2025-01-10 00:40:40,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:40,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:40,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:40:40,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:40:40,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:40,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:40,583 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:40:40,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:40:40,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:40:40,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:40,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:40,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:40:40,611 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:40:40,611 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-10 00:40:40,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-01-10 00:40:40,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-01-10 00:40:40,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-01-10 00:40:40,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-01-10 00:40:40,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:40:40,612 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 00:40:40,613 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:40:40,613 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:40:40,660 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:40,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 67 transitions, 152 flow [2025-01-10 00:40:40,671 INFO L124 PetriNetUnfolderBase]: 12/81 cut-off events. [2025-01-10 00:40:40,671 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 00:40:40,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 81 events. 12/81 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 237 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 63. Up to 4 conditions per place. [2025-01-10 00:40:40,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 67 transitions, 152 flow [2025-01-10 00:40:40,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 67 transitions, 152 flow [2025-01-10 00:40:40,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:40,674 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;@55603865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:40,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 00:40:40,676 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:40,676 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:40:40,676 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:40,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:40,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:40:40,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:40:40,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:40,677 INFO L85 PathProgramCache]: Analyzing trace with hash 529293, now seen corresponding path program 1 times [2025-01-10 00:40:40,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:40,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915504958] [2025-01-10 00:40:40,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:40,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:40,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:40:40,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:40:40,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:40,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:40,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:40,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915504958] [2025-01-10 00:40:40,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915504958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:40,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:40,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:40,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174706743] [2025-01-10 00:40:40,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:40,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:40,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:40,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:40,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2025-01-10 00:40:40,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 67 transitions, 152 flow. Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:40,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:40,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2025-01-10 00:40:40,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:41,469 INFO L124 PetriNetUnfolderBase]: 6191/10474 cut-off events. [2025-01-10 00:40:41,470 INFO L125 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2025-01-10 00:40:41,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18721 conditions, 10474 events. 6191/10474 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 72434 event pairs, 4937 based on Foata normal form. 2112/11974 useless extension candidates. Maximal degree in co-relation 2971. Up to 7925 conditions per place. [2025-01-10 00:40:41,607 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 30 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2025-01-10 00:40:41,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 176 flow [2025-01-10 00:40:41,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2025-01-10 00:40:41,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5970149253731343 [2025-01-10 00:40:41,610 INFO L175 Difference]: Start difference. First operand has 62 places, 67 transitions, 152 flow. Second operand 2 states and 80 transitions. [2025-01-10 00:40:41,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 176 flow [2025-01-10 00:40:41,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 174 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:41,612 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 114 flow [2025-01-10 00:40:41,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2025-01-10 00:40:41,613 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -11 predicate places. [2025-01-10 00:40:41,613 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 114 flow [2025-01-10 00:40:41,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:41,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:41,614 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-01-10 00:40:41,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:40:41,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:40:41,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:41,615 INFO L85 PathProgramCache]: Analyzing trace with hash 430348686, now seen corresponding path program 1 times [2025-01-10 00:40:41,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:41,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438046205] [2025-01-10 00:40:41,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:41,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:41,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:40:41,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:40:41,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:41,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:41,740 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:40:41,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:40:41,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:40:41,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:41,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:41,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:40:41,766 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:40:41,766 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-10 00:40:41,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-01-10 00:40:41,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-01-10 00:40:41,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-01-10 00:40:41,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-01-10 00:40:41,766 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-01-10 00:40:41,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:40:41,766 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 00:40:41,767 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:40:41,767 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 00:40:41,798 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:41,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 87 transitions, 202 flow [2025-01-10 00:40:41,811 INFO L124 PetriNetUnfolderBase]: 16/106 cut-off events. [2025-01-10 00:40:41,811 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 00:40:41,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 106 events. 16/106 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 324 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 93. Up to 5 conditions per place. [2025-01-10 00:40:41,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 87 transitions, 202 flow [2025-01-10 00:40:41,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 87 transitions, 202 flow [2025-01-10 00:40:41,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:41,813 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;@55603865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:41,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:40:41,818 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:41,818 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:40:41,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:41,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:41,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:40:41,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:40:41,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:41,819 INFO L85 PathProgramCache]: Analyzing trace with hash 615684, now seen corresponding path program 1 times [2025-01-10 00:40:41,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:41,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430551352] [2025-01-10 00:40:41,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:41,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:41,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:40:41,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:40:41,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:41,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:41,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:41,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430551352] [2025-01-10 00:40:41,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430551352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:41,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:41,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:41,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145585933] [2025-01-10 00:40:41,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:41,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:41,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:41,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:41,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:41,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 87 [2025-01-10 00:40:41,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 87 transitions, 202 flow. Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:41,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:41,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 87 [2025-01-10 00:40:41,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:47,395 INFO L124 PetriNetUnfolderBase]: 75790/114504 cut-off events. [2025-01-10 00:40:47,395 INFO L125 PetriNetUnfolderBase]: For 8091/8091 co-relation queries the response was YES. [2025-01-10 00:40:47,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209470 conditions, 114504 events. 75790/114504 cut-off events. For 8091/8091 co-relation queries the response was YES. Maximal size of possible extension queue 3964. Compared 919853 event pairs, 62218 based on Foata normal form. 25604/134533 useless extension candidates. Maximal degree in co-relation 18798. Up to 91348 conditions per place. [2025-01-10 00:40:48,313 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 39 selfloop transitions, 0 changer transitions 0/64 dead transitions. [2025-01-10 00:40:48,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 234 flow [2025-01-10 00:40:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2025-01-10 00:40:48,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2025-01-10 00:40:48,315 INFO L175 Difference]: Start difference. First operand has 80 places, 87 transitions, 202 flow. Second operand 2 states and 104 transitions. [2025-01-10 00:40:48,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 234 flow [2025-01-10 00:40:48,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 228 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:48,320 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 150 flow [2025-01-10 00:40:48,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=150, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2025-01-10 00:40:48,321 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -14 predicate places. [2025-01-10 00:40:48,321 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 150 flow [2025-01-10 00:40:48,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:48,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:48,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:40:48,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:40:48,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:40:48,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:48,322 INFO L85 PathProgramCache]: Analyzing trace with hash 86101765, now seen corresponding path program 1 times [2025-01-10 00:40:48,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:48,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779138616] [2025-01-10 00:40:48,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:48,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:48,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:40:48,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:40:48,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:48,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:40:48,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:48,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779138616] [2025-01-10 00:40:48,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779138616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:48,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:48,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:40:48,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406960763] [2025-01-10 00:40:48,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:48,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:40:48,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:48,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:40:48,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:40:48,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 87 [2025-01-10 00:40:48,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:48,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:48,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 87 [2025-01-10 00:40:48,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:59,629 INFO L124 PetriNetUnfolderBase]: 148268/234028 cut-off events. [2025-01-10 00:40:59,629 INFO L125 PetriNetUnfolderBase]: For 4050/4050 co-relation queries the response was YES. [2025-01-10 00:41:00,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419069 conditions, 234028 events. 148268/234028 cut-off events. For 4050/4050 co-relation queries the response was YES. Maximal size of possible extension queue 11501. Compared 2290473 event pairs, 41632 based on Foata normal form. 11832/234195 useless extension candidates. Maximal degree in co-relation 419062. Up to 73569 conditions per place. [2025-01-10 00:41:01,545 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 91 selfloop transitions, 13 changer transitions 0/129 dead transitions. [2025-01-10 00:41:01,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 129 transitions, 513 flow [2025-01-10 00:41:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:41:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:41:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2025-01-10 00:41:01,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2025-01-10 00:41:01,547 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 150 flow. Second operand 4 states and 216 transitions. [2025-01-10 00:41:01,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 129 transitions, 513 flow [2025-01-10 00:41:01,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 129 transitions, 513 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:41:01,555 INFO L231 Difference]: Finished difference. Result has 69 places, 72 transitions, 200 flow [2025-01-10 00:41:01,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=69, PETRI_TRANSITIONS=72} [2025-01-10 00:41:01,555 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -11 predicate places. [2025-01-10 00:41:01,555 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 72 transitions, 200 flow [2025-01-10 00:41:01,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:01,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:01,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:01,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:41:01,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:41:01,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:01,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1722454024, now seen corresponding path program 1 times [2025-01-10 00:41:01,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:01,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991776126] [2025-01-10 00:41:01,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:01,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:01,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:41:01,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:41:01,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:01,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:01,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:01,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991776126] [2025-01-10 00:41:01,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991776126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:01,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:01,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:01,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586430102] [2025-01-10 00:41:01,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:01,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:41:01,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:01,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:41:01,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:41:01,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-01-10 00:41:01,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 72 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:01,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:01,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-01-10 00:41:01,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:41:10,937 INFO L124 PetriNetUnfolderBase]: 124939/191400 cut-off events. [2025-01-10 00:41:10,938 INFO L125 PetriNetUnfolderBase]: For 11908/11908 co-relation queries the response was YES. [2025-01-10 00:41:11,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364088 conditions, 191400 events. 124939/191400 cut-off events. For 11908/11908 co-relation queries the response was YES. Maximal size of possible extension queue 8148. Compared 1729644 event pairs, 36811 based on Foata normal form. 4062/194154 useless extension candidates. Maximal degree in co-relation 364080. Up to 140026 conditions per place. [2025-01-10 00:41:12,134 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 78 selfloop transitions, 5 changer transitions 0/104 dead transitions. [2025-01-10 00:41:12,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 104 transitions, 464 flow [2025-01-10 00:41:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:41:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:41:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2025-01-10 00:41:12,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2025-01-10 00:41:12,138 INFO L175 Difference]: Start difference. First operand has 69 places, 72 transitions, 200 flow. Second operand 3 states and 141 transitions. [2025-01-10 00:41:12,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 104 transitions, 464 flow [2025-01-10 00:41:12,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 104 transitions, 464 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:41:12,146 INFO L231 Difference]: Finished difference. Result has 72 places, 76 transitions, 247 flow [2025-01-10 00:41:12,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=72, PETRI_TRANSITIONS=76} [2025-01-10 00:41:12,148 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -8 predicate places. [2025-01-10 00:41:12,148 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 76 transitions, 247 flow [2025-01-10 00:41:12,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:12,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:12,148 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 00:41:12,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:41:12,149 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:41:12,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:12,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1615839492, now seen corresponding path program 1 times [2025-01-10 00:41:12,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:12,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501267730] [2025-01-10 00:41:12,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:12,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:12,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:41:12,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:41:12,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:12,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:41:12,289 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:41:12,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:41:12,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:41:12,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:12,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:41:12,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:41:12,319 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:41:12,320 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-01-10 00:41:12,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 00:41:12,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-01-10 00:41:12,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-01-10 00:41:12,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-01-10 00:41:12,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-01-10 00:41:12,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:41:12,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:41:12,320 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 00:41:12,320 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:41:12,320 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-10 00:41:12,350 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:41:12,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 107 transitions, 254 flow [2025-01-10 00:41:12,360 INFO L124 PetriNetUnfolderBase]: 20/131 cut-off events. [2025-01-10 00:41:12,360 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 00:41:12,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 131 events. 20/131 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 414 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 124. Up to 6 conditions per place. [2025-01-10 00:41:12,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 107 transitions, 254 flow [2025-01-10 00:41:12,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 107 transitions, 254 flow [2025-01-10 00:41:12,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:41:12,363 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;@55603865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:41:12,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:41:12,365 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:41:12,368 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:41:12,368 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:41:12,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:41:12,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:41:12,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:41:12,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:41:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash 721935, now seen corresponding path program 1 times [2025-01-10 00:41:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:41:12,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476802955] [2025-01-10 00:41:12,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:41:12,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:41:12,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:41:12,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:41:12,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:41:12,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:41:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:41:12,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:41:12,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476802955] [2025-01-10 00:41:12,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476802955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:41:12,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:41:12,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:41:12,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520980835] [2025-01-10 00:41:12,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:41:12,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:41:12,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:41:12,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:41:12,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:41:12,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 107 [2025-01-10 00:41:12,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 107 transitions, 254 flow. Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:41:12,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:41:12,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 107 [2025-01-10 00:41:12,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand