./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.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/31_simple_loop5_vs.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 d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:40:00,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:40:00,087 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:00,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:40:00,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:40:00,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:40:00,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:40:00,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:40:00,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:40:00,118 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:40:00,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:40:00,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:40:00,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:40:00,119 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:40:00,119 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:40:00,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:40:00,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:40:00,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:40:00,120 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 -> d5289904c0d34e84fc731c9bca51c5d8bc54117a73409b0419290d8896b60d2d [2025-01-10 00:40:00,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:40:00,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:40:00,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:40:00,369 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:40:00,369 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:40:00,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-01-10 00:40:01,570 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6cfc60cb8/2a4bb9d9354a421abe16bcb75e6d3503/FLAG38afdd7d4 [2025-01-10 00:40:01,852 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:40:01,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2025-01-10 00:40:01,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6cfc60cb8/2a4bb9d9354a421abe16bcb75e6d3503/FLAG38afdd7d4 [2025-01-10 00:40:02,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6cfc60cb8/2a4bb9d9354a421abe16bcb75e6d3503 [2025-01-10 00:40:02,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:40:02,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:40:02,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:40:02,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:40:02,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:40:02,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:40:02" (1/1) ... [2025-01-10 00:40:02,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1152c614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:02, skipping insertion in model container [2025-01-10 00:40:02,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:40:02" (1/1) ... [2025-01-10 00:40:02,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:40:02,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:40:02,469 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:40:02,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:40:02,537 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:40:02,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:02 WrapperNode [2025-01-10 00:40:02,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:40:02,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:40:02,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:40:02,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:40:02,547 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:02" (1/1) ... [2025-01-10 00:40:02,560 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:02" (1/1) ... [2025-01-10 00:40:02,580 INFO L138 Inliner]: procedures = 162, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-01-10 00:40:02,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:40:02,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:40:02,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:40:02,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:40:02,587 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:02" (1/1) ... [2025-01-10 00:40:02,588 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:02" (1/1) ... [2025-01-10 00:40:02,592 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:02" (1/1) ... [2025-01-10 00:40:02,602 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:02,602 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:02" (1/1) ... [2025-01-10 00:40:02,602 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:02" (1/1) ... [2025-01-10 00:40:02,606 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:02" (1/1) ... [2025-01-10 00:40:02,607 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:02" (1/1) ... [2025-01-10 00:40:02,609 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:02" (1/1) ... [2025-01-10 00:40:02,609 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:02" (1/1) ... [2025-01-10 00:40:02,610 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:02" (1/1) ... [2025-01-10 00:40:02,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:40:02,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:40:02,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:40:02,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:40:02,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:02" (1/1) ... [2025-01-10 00:40:02,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:40:02,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:40:02,640 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:02,643 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:02,663 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-01-10 00:40:02,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-01-10 00:40:02,663 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 00:40:02,663 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 00:40:02,663 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:40:02,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:40:02,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:40:02,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:40:02,663 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:40:02,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:40:02,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:40:02,664 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:02,748 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:40:02,749 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:40:02,847 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:40:02,848 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:40:02,926 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:40:02,929 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-10 00:40:02,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:40:02 BoogieIcfgContainer [2025-01-10 00:40:02,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:40:02,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:40:02,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:40:02,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:40:02,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:40:02" (1/3) ... [2025-01-10 00:40:02,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afcd5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:40:02, skipping insertion in model container [2025-01-10 00:40:02,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:02" (2/3) ... [2025-01-10 00:40:02,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afcd5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:40:02, skipping insertion in model container [2025-01-10 00:40:02,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:40:02" (3/3) ... [2025-01-10 00:40:02,941 INFO L128 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2025-01-10 00:40:02,953 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:40:02,954 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 31_simple_loop5_vs.i that has 3 procedures, 26 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-01-10 00:40:02,954 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:40:02,994 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:03,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 68 flow [2025-01-10 00:40:03,044 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-01-10 00:40:03,045 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:03,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 4/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 85 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-01-10 00:40:03,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 68 flow [2025-01-10 00:40:03,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 29 transitions, 65 flow [2025-01-10 00:40:03,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:03,064 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;@3808be23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:03,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-10 00:40:03,068 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:03,068 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 00:40:03,068 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:03,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:03,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:40:03,069 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:03,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:03,072 INFO L85 PathProgramCache]: Analyzing trace with hash 188032374, now seen corresponding path program 1 times [2025-01-10 00:40:03,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:03,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135132648] [2025-01-10 00:40:03,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:03,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:03,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:40:03,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:40:03,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:03,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:03,250 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:03,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:03,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135132648] [2025-01-10 00:40:03,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135132648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:03,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:03,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:03,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902693129] [2025-01-10 00:40:03,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:03,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:03,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:03,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:03,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:03,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 30 [2025-01-10 00:40:03,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 65 flow. Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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:03,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:03,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 30 [2025-01-10 00:40:03,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:03,331 INFO L124 PetriNetUnfolderBase]: 79/165 cut-off events. [2025-01-10 00:40:03,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:03,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 165 events. 79/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 694 event pairs, 66 based on Foata normal form. 29/190 useless extension candidates. Maximal degree in co-relation 304. Up to 136 conditions per place. [2025-01-10 00:40:03,334 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 12 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2025-01-10 00:40:03,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 73 flow [2025-01-10 00:40:03,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2025-01-10 00:40:03,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-01-10 00:40:03,344 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 65 flow. Second operand 2 states and 39 transitions. [2025-01-10 00:40:03,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 73 flow [2025-01-10 00:40:03,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 72 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:40:03,348 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 48 flow [2025-01-10 00:40:03,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=48, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-01-10 00:40:03,355 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -6 predicate places. [2025-01-10 00:40:03,356 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 48 flow [2025-01-10 00:40:03,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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:03,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:03,356 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:40:03,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:40:03,357 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:03,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:03,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1037021178, now seen corresponding path program 1 times [2025-01-10 00:40:03,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:03,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253306898] [2025-01-10 00:40:03,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:03,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:03,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:40:03,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:40:03,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:03,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:03,374 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:40:03,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:40:03,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:40:03,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:03,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:03,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:40:03,392 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:40:03,393 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-10 00:40:03,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-01-10 00:40:03,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 5 remaining) [2025-01-10 00:40:03,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-01-10 00:40:03,394 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-01-10 00:40:03,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:40:03,395 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 00:40:03,396 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:40:03,396 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:40:03,411 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:03,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions, 122 flow [2025-01-10 00:40:03,419 INFO L124 PetriNetUnfolderBase]: 5/45 cut-off events. [2025-01-10 00:40:03,419 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:40:03,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 45 events. 5/45 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 111 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 52. Up to 3 conditions per place. [2025-01-10 00:40:03,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 51 transitions, 122 flow [2025-01-10 00:40:03,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 36 transitions, 85 flow [2025-01-10 00:40:03,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:03,422 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;@3808be23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:03,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 00:40:03,424 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:03,424 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 00:40:03,424 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:03,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:03,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:40:03,424 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:03,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:03,425 INFO L85 PathProgramCache]: Analyzing trace with hash 237297749, now seen corresponding path program 1 times [2025-01-10 00:40:03,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:03,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245434417] [2025-01-10 00:40:03,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:03,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:03,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:40:03,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:40:03,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:03,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:03,443 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:03,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:03,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245434417] [2025-01-10 00:40:03,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245434417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:03,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:03,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:03,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942349126] [2025-01-10 00:40:03,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:03,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:03,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:03,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:03,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:03,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2025-01-10 00:40:03,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 85 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:03,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:03,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2025-01-10 00:40:03,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:03,598 INFO L124 PetriNetUnfolderBase]: 559/917 cut-off events. [2025-01-10 00:40:03,599 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-10 00:40:03,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1779 conditions, 917 events. 559/917 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4577 event pairs, 450 based on Foata normal form. 125/1026 useless extension candidates. Maximal degree in co-relation 1768. Up to 800 conditions per place. [2025-01-10 00:40:03,607 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 16 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2025-01-10 00:40:03,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 99 flow [2025-01-10 00:40:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2025-01-10 00:40:03,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2025-01-10 00:40:03,609 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 85 flow. Second operand 2 states and 60 transitions. [2025-01-10 00:40:03,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 99 flow [2025-01-10 00:40:03,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 98 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:40:03,611 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 66 flow [2025-01-10 00:40:03,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2025-01-10 00:40:03,612 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2025-01-10 00:40:03,612 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 66 flow [2025-01-10 00:40:03,612 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:03,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:03,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:40:03,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:40:03,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 00:40:03,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:03,614 INFO L85 PathProgramCache]: Analyzing trace with hash 340095101, now seen corresponding path program 1 times [2025-01-10 00:40:03,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:03,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965267855] [2025-01-10 00:40:03,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:03,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:03,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:40:03,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:40:03,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:03,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:03,688 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:03,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:03,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965267855] [2025-01-10 00:40:03,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965267855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:03,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:03,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:03,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429758302] [2025-01-10 00:40:03,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:03,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:40:03,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:03,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:40:03,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:40:03,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2025-01-10 00:40:03,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:03,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:03,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2025-01-10 00:40:03,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:03,852 INFO L124 PetriNetUnfolderBase]: 1203/1967 cut-off events. [2025-01-10 00:40:03,853 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-01-10 00:40:03,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3752 conditions, 1967 events. 1203/1967 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10490 event pairs, 303 based on Foata normal form. 0/1901 useless extension candidates. Maximal degree in co-relation 3747. Up to 1003 conditions per place. [2025-01-10 00:40:03,864 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 25 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-01-10 00:40:03,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 153 flow [2025-01-10 00:40:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:40:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:40:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-01-10 00:40:03,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2025-01-10 00:40:03,867 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 66 flow. Second operand 3 states and 81 transitions. [2025-01-10 00:40:03,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 153 flow [2025-01-10 00:40:03,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 153 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:03,871 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 96 flow [2025-01-10 00:40:03,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2025-01-10 00:40:03,872 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2025-01-10 00:40:03,872 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 96 flow [2025-01-10 00:40:03,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:03,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:03,872 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:40:03,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:40:03,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:03,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2111198847, now seen corresponding path program 1 times [2025-01-10 00:40:03,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:03,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589939360] [2025-01-10 00:40:03,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:03,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:03,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:40:03,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:40:03,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:03,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:03,896 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:40:03,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:40:03,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:40:03,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:03,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:03,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:40:03,920 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:40:03,921 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-10 00:40:03,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-01-10 00:40:03,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-01-10 00:40:03,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-01-10 00:40:03,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-01-10 00:40:03,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-01-10 00:40:03,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:40:03,921 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 00:40:03,921 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:40:03,922 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:40:03,943 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:03,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 72 transitions, 180 flow [2025-01-10 00:40:03,952 INFO L124 PetriNetUnfolderBase]: 6/57 cut-off events. [2025-01-10 00:40:03,952 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 00:40:03,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 57 events. 6/57 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 143 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 68. Up to 4 conditions per place. [2025-01-10 00:40:03,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 72 transitions, 180 flow [2025-01-10 00:40:03,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 43 transitions, 107 flow [2025-01-10 00:40:03,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:03,955 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;@3808be23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:03,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:40:03,956 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:03,958 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 00:40:03,958 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:03,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:03,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:40:03,958 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:03,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash 306603529, now seen corresponding path program 1 times [2025-01-10 00:40:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:03,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843431367] [2025-01-10 00:40:03,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:03,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:03,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:40:03,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:40:03,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:03,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:04,005 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:04,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:04,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843431367] [2025-01-10 00:40:04,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843431367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:04,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:04,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:04,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826245971] [2025-01-10 00:40:04,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:04,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:04,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:04,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:04,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 72 [2025-01-10 00:40:04,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 107 flow. Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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:04,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:04,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 72 [2025-01-10 00:40:04,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:04,302 INFO L124 PetriNetUnfolderBase]: 3247/4709 cut-off events. [2025-01-10 00:40:04,303 INFO L125 PetriNetUnfolderBase]: For 560/560 co-relation queries the response was YES. [2025-01-10 00:40:04,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9252 conditions, 4709 events. 3247/4709 cut-off events. For 560/560 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 25842 event pairs, 2562 based on Foata normal form. 509/5150 useless extension candidates. Maximal degree in co-relation 9240. Up to 4224 conditions per place. [2025-01-10 00:40:04,331 INFO L140 encePairwiseOnDemand]: 65/72 looper letters, 20 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2025-01-10 00:40:04,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 127 flow [2025-01-10 00:40:04,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 81 transitions. [2025-01-10 00:40:04,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-01-10 00:40:04,333 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 107 flow. Second operand 2 states and 81 transitions. [2025-01-10 00:40:04,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 127 flow [2025-01-10 00:40:04,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 124 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 00:40:04,334 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 84 flow [2025-01-10 00:40:04,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2025-01-10 00:40:04,335 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -8 predicate places. [2025-01-10 00:40:04,335 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 84 flow [2025-01-10 00:40:04,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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:04,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:04,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:40:04,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:40:04,335 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:04,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash -288525135, now seen corresponding path program 1 times [2025-01-10 00:40:04,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:04,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99430832] [2025-01-10 00:40:04,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:04,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:04,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:40:04,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:40:04,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:04,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:04,362 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:04,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:04,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99430832] [2025-01-10 00:40:04,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99430832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:04,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:04,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:04,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460305820] [2025-01-10 00:40:04,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:04,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:40:04,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:04,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:40:04,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:40:04,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 72 [2025-01-10 00:40:04,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:04,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:04,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 72 [2025-01-10 00:40:04,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:04,956 INFO L124 PetriNetUnfolderBase]: 6995/10176 cut-off events. [2025-01-10 00:40:04,957 INFO L125 PetriNetUnfolderBase]: For 665/665 co-relation queries the response was YES. [2025-01-10 00:40:04,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19680 conditions, 10176 events. 6995/10176 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 59421 event pairs, 1712 based on Foata normal form. 0/9874 useless extension candidates. Maximal degree in co-relation 19674. Up to 5767 conditions per place. [2025-01-10 00:40:05,011 INFO L140 encePairwiseOnDemand]: 66/72 looper letters, 32 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2025-01-10 00:40:05,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 200 flow [2025-01-10 00:40:05,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:40:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:40:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-01-10 00:40:05,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2025-01-10 00:40:05,015 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 84 flow. Second operand 3 states and 110 transitions. [2025-01-10 00:40:05,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 200 flow [2025-01-10 00:40:05,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:05,017 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 122 flow [2025-01-10 00:40:05,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-01-10 00:40:05,017 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2025-01-10 00:40:05,018 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 122 flow [2025-01-10 00:40:05,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:05,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:05,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:40:05,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:40:05,018 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:40:05,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:05,020 INFO L85 PathProgramCache]: Analyzing trace with hash -561152137, now seen corresponding path program 1 times [2025-01-10 00:40:05,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:05,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516115876] [2025-01-10 00:40:05,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:05,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:05,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:40:05,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:40:05,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:05,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:05,072 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:05,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:05,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516115876] [2025-01-10 00:40:05,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516115876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:05,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:05,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:40:05,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221142790] [2025-01-10 00:40:05,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:05,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:40:05,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:05,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:40:05,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:40:05,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 72 [2025-01-10 00:40:05,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:05,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:05,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 72 [2025-01-10 00:40:05,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:05,958 INFO L124 PetriNetUnfolderBase]: 9157/13439 cut-off events. [2025-01-10 00:40:05,958 INFO L125 PetriNetUnfolderBase]: For 4334/4334 co-relation queries the response was YES. [2025-01-10 00:40:05,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30068 conditions, 13439 events. 9157/13439 cut-off events. For 4334/4334 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 83197 event pairs, 1070 based on Foata normal form. 135/13497 useless extension candidates. Maximal degree in co-relation 30060. Up to 6256 conditions per place. [2025-01-10 00:40:06,013 INFO L140 encePairwiseOnDemand]: 66/72 looper letters, 43 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2025-01-10 00:40:06,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 332 flow [2025-01-10 00:40:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:40:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:40:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-01-10 00:40:06,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2025-01-10 00:40:06,017 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 122 flow. Second operand 4 states and 147 transitions. [2025-01-10 00:40:06,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 332 flow [2025-01-10 00:40:06,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 66 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:40:06,027 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 190 flow [2025-01-10 00:40:06,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2025-01-10 00:40:06,028 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2025-01-10 00:40:06,029 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 190 flow [2025-01-10 00:40:06,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:40:06,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:06,029 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:40:06,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:40:06,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 00:40:06,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:06,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2087916415, now seen corresponding path program 1 times [2025-01-10 00:40:06,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:06,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360484814] [2025-01-10 00:40:06,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:06,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:06,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:40:06,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:40:06,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:06,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:06,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:40:06,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:40:06,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:40:06,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:06,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:06,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:40:06,063 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:40:06,063 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-01-10 00:40:06,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 00:40:06,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-01-10 00:40:06,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-10 00:40:06,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-01-10 00:40:06,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-01-10 00:40:06,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:40:06,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:40:06,064 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 00:40:06,064 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:40:06,064 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 00:40:06,089 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:06,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 93 transitions, 242 flow [2025-01-10 00:40:06,093 INFO L124 PetriNetUnfolderBase]: 7/69 cut-off events. [2025-01-10 00:40:06,094 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 00:40:06,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 69 events. 7/69 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 170 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 85. Up to 5 conditions per place. [2025-01-10 00:40:06,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 93 transitions, 242 flow [2025-01-10 00:40:06,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 50 transitions, 131 flow [2025-01-10 00:40:06,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:06,095 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;@3808be23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:06,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:40:06,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:06,096 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-10 00:40:06,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:06,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:06,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:40:06,096 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:40:06,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:06,097 INFO L85 PathProgramCache]: Analyzing trace with hash 395949714, now seen corresponding path program 1 times [2025-01-10 00:40:06,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:06,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121931810] [2025-01-10 00:40:06,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:06,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:06,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:40:06,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:40:06,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:06,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:06,106 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:06,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:06,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121931810] [2025-01-10 00:40:06,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121931810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:06,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:06,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750281218] [2025-01-10 00:40:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:06,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:06,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:06,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:06,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:06,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2025-01-10 00:40:06,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 131 flow. Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 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:06,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:06,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2025-01-10 00:40:06,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:07,503 INFO L124 PetriNetUnfolderBase]: 17071/22949 cut-off events. [2025-01-10 00:40:07,503 INFO L125 PetriNetUnfolderBase]: For 4208/4208 co-relation queries the response was YES. [2025-01-10 00:40:07,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45541 conditions, 22949 events. 17071/22949 cut-off events. For 4208/4208 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 131110 event pairs, 13314 based on Foata normal form. 2045/24738 useless extension candidates. Maximal degree in co-relation 45528. Up to 20992 conditions per place. [2025-01-10 00:40:07,625 INFO L140 encePairwiseOnDemand]: 85/93 looper letters, 24 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2025-01-10 00:40:07,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 157 flow [2025-01-10 00:40:07,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2025-01-10 00:40:07,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2025-01-10 00:40:07,627 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 131 flow. Second operand 2 states and 102 transitions. [2025-01-10 00:40:07,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 157 flow [2025-01-10 00:40:07,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 150 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-10 00:40:07,633 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 102 flow [2025-01-10 00:40:07,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2025-01-10 00:40:07,633 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -9 predicate places. [2025-01-10 00:40:07,634 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 102 flow [2025-01-10 00:40:07,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 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:07,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:07,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:40:07,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:40:07,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:40:07,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash -509288379, now seen corresponding path program 1 times [2025-01-10 00:40:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:07,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181132326] [2025-01-10 00:40:07,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:07,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:07,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:40:07,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:40:07,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:07,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:07,678 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:07,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:07,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181132326] [2025-01-10 00:40:07,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181132326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:07,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:07,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:07,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20526386] [2025-01-10 00:40:07,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:07,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:40:07,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:07,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:40:07,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:40:07,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 93 [2025-01-10 00:40:07,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:07,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:07,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 93 [2025-01-10 00:40:07,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:09,909 INFO L124 PetriNetUnfolderBase]: 36336/49070 cut-off events. [2025-01-10 00:40:09,909 INFO L125 PetriNetUnfolderBase]: For 3922/3922 co-relation queries the response was YES. [2025-01-10 00:40:10,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95638 conditions, 49070 events. 36336/49070 cut-off events. For 3922/3922 co-relation queries the response was YES. Maximal size of possible extension queue 1823. Compared 297762 event pairs, 9261 based on Foata normal form. 0/47810 useless extension candidates. Maximal degree in co-relation 95631. Up to 29392 conditions per place. [2025-01-10 00:40:10,171 INFO L140 encePairwiseOnDemand]: 86/93 looper letters, 39 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2025-01-10 00:40:10,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 247 flow [2025-01-10 00:40:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:40:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:40:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-01-10 00:40:10,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4982078853046595 [2025-01-10 00:40:10,173 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 102 flow. Second operand 3 states and 139 transitions. [2025-01-10 00:40:10,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 247 flow [2025-01-10 00:40:10,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 247 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:10,183 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 148 flow [2025-01-10 00:40:10,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-01-10 00:40:10,184 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -5 predicate places. [2025-01-10 00:40:10,185 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 148 flow [2025-01-10 00:40:10,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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:10,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:10,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:40:10,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:40:10,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:40:10,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:10,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1552096254, now seen corresponding path program 1 times [2025-01-10 00:40:10,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:10,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884141800] [2025-01-10 00:40:10,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:10,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:40:10,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:40:10,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:10,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:10,244 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:10,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:10,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884141800] [2025-01-10 00:40:10,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884141800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:10,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:10,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:40:10,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151963256] [2025-01-10 00:40:10,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:10,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:40:10,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:10,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:40:10,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:40:10,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 93 [2025-01-10 00:40:10,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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:10,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:10,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 93 [2025-01-10 00:40:10,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:13,120 INFO L124 PetriNetUnfolderBase]: 43697/59953 cut-off events. [2025-01-10 00:40:13,121 INFO L125 PetriNetUnfolderBase]: For 19236/19236 co-relation queries the response was YES. [2025-01-10 00:40:13,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134697 conditions, 59953 events. 43697/59953 cut-off events. For 19236/19236 co-relation queries the response was YES. Maximal size of possible extension queue 2424. Compared 387693 event pairs, 5040 based on Foata normal form. 372/60121 useless extension candidates. Maximal degree in co-relation 134688. Up to 31321 conditions per place. [2025-01-10 00:40:13,430 INFO L140 encePairwiseOnDemand]: 86/93 looper letters, 52 selfloop transitions, 14 changer transitions 0/80 dead transitions. [2025-01-10 00:40:13,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 80 transitions, 412 flow [2025-01-10 00:40:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:40:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:40:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2025-01-10 00:40:13,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 00:40:13,432 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 148 flow. Second operand 4 states and 186 transitions. [2025-01-10 00:40:13,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 80 transitions, 412 flow [2025-01-10 00:40:13,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 80 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:40:13,451 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 235 flow [2025-01-10 00:40:13,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2025-01-10 00:40:13,451 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2025-01-10 00:40:13,451 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 235 flow [2025-01-10 00:40:13,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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:13,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:13,452 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:40:13,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:40:13,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 00:40:13,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1135064957, now seen corresponding path program 1 times [2025-01-10 00:40:13,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:13,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840714048] [2025-01-10 00:40:13,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:13,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:13,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:40:13,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:40:13,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:13,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:13,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:40:13,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:40:13,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:40:13,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:13,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:40:13,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:40:13,472 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:40:13,472 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-01-10 00:40:13,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-01-10 00:40:13,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-01-10 00:40:13,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-01-10 00:40:13,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-01-10 00:40:13,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-01-10 00:40:13,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-01-10 00:40:13,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 00:40:13,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:40:13,472 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 00:40:13,473 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:40:13,473 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-10 00:40:13,496 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:40:13,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 114 transitions, 308 flow [2025-01-10 00:40:13,501 INFO L124 PetriNetUnfolderBase]: 8/81 cut-off events. [2025-01-10 00:40:13,501 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 00:40:13,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 81 events. 8/81 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 198 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 103. Up to 6 conditions per place. [2025-01-10 00:40:13,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 114 transitions, 308 flow [2025-01-10 00:40:13,502 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 57 transitions, 157 flow [2025-01-10 00:40:13,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:40:13,503 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;@3808be23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:40:13,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-10 00:40:13,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:40:13,503 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-10 00:40:13,503 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:40:13,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:13,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:40:13,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 00:40:13,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:13,504 INFO L85 PathProgramCache]: Analyzing trace with hash 505336304, now seen corresponding path program 1 times [2025-01-10 00:40:13,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:13,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857685592] [2025-01-10 00:40:13,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:13,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:13,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:40:13,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:40:13,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:13,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:13,512 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:13,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:13,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857685592] [2025-01-10 00:40:13,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857685592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:13,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:13,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865660923] [2025-01-10 00:40:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:13,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:40:13,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:13,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:40:13,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:40:13,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 114 [2025-01-10 00:40:13,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 157 flow. Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 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:13,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:13,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 114 [2025-01-10 00:40:13,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:19,293 INFO L124 PetriNetUnfolderBase]: 84655/108197 cut-off events. [2025-01-10 00:40:19,293 INFO L125 PetriNetUnfolderBase]: For 26992/26992 co-relation queries the response was YES. [2025-01-10 00:40:19,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216294 conditions, 108197 events. 84655/108197 cut-off events. For 26992/26992 co-relation queries the response was YES. Maximal size of possible extension queue 3658. Compared 634822 event pairs, 65538 based on Foata normal form. 8189/115358 useless extension candidates. Maximal degree in co-relation 216280. Up to 100352 conditions per place. [2025-01-10 00:40:20,146 INFO L140 encePairwiseOnDemand]: 105/114 looper letters, 28 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2025-01-10 00:40:20,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 189 flow [2025-01-10 00:40:20,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:40:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:40:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 123 transitions. [2025-01-10 00:40:20,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2025-01-10 00:40:20,148 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 157 flow. Second operand 2 states and 123 transitions. [2025-01-10 00:40:20,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 189 flow [2025-01-10 00:40:20,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 176 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 00:40:20,173 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 120 flow [2025-01-10 00:40:20,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=120, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2025-01-10 00:40:20,173 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -10 predicate places. [2025-01-10 00:40:20,173 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 120 flow [2025-01-10 00:40:20,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 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:20,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:20,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:40:20,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:40:20,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 00:40:20,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:20,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1860534343, now seen corresponding path program 1 times [2025-01-10 00:40:20,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:20,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622114747] [2025-01-10 00:40:20,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:20,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:20,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:40:20,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:40:20,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:20,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:20,211 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:20,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:20,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622114747] [2025-01-10 00:40:20,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622114747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:20,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:20,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:40:20,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167218491] [2025-01-10 00:40:20,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:20,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:40:20,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:20,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:40:20,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:40:20,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 114 [2025-01-10 00:40:20,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:20,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:20,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 114 [2025-01-10 00:40:20,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:40:32,328 INFO L124 PetriNetUnfolderBase]: 178118/228693 cut-off events. [2025-01-10 00:40:32,329 INFO L125 PetriNetUnfolderBase]: For 22003/22003 co-relation queries the response was YES. [2025-01-10 00:40:32,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447878 conditions, 228693 events. 178118/228693 cut-off events. For 22003/22003 co-relation queries the response was YES. Maximal size of possible extension queue 6784. Compared 1422068 event pairs, 48026 based on Foata normal form. 0/223557 useless extension candidates. Maximal degree in co-relation 447870. Up to 141658 conditions per place. [2025-01-10 00:40:33,684 INFO L140 encePairwiseOnDemand]: 106/114 looper letters, 46 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2025-01-10 00:40:33,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 294 flow [2025-01-10 00:40:33,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:40:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:40:33,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2025-01-10 00:40:33,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2025-01-10 00:40:33,687 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 120 flow. Second operand 3 states and 168 transitions. [2025-01-10 00:40:33,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 294 flow [2025-01-10 00:40:33,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 294 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:40:33,803 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 174 flow [2025-01-10 00:40:33,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2025-01-10 00:40:33,807 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -6 predicate places. [2025-01-10 00:40:33,807 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 174 flow [2025-01-10 00:40:33,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:33,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:40:33,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:40:33,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:40:33,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 00:40:33,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:40:33,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1554262011, now seen corresponding path program 1 times [2025-01-10 00:40:33,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:40:33,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727069461] [2025-01-10 00:40:33,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:40:33,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:40:33,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:40:33,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:40:33,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:40:33,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:40:33,862 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:33,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:40:33,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727069461] [2025-01-10 00:40:33,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727069461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:40:33,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:40:33,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:40:33,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999146255] [2025-01-10 00:40:33,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:40:33,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:40:33,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:40:33,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:40:33,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:40:33,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 114 [2025-01-10 00:40:33,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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:33,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:40:33,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 114 [2025-01-10 00:40:33,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand