./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-100.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-theta/unwind3-100.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 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:16:49,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:16:49,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:16:49,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:16:49,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:16:49,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:16:49,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:16:49,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:16:49,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:16:49,370 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:16:49,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:16:49,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:16:49,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:16:49,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:16:49,371 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:16:49,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:16:49,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:16:49,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:16:49,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:16:49,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:16:49,372 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:16:49,372 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:16:49,372 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:16:49,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:16:49,373 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:16:49,373 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:16:49,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:16:49,373 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:16:49,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:16:49,373 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:16:49,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:16:49,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:16:49,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:16:49,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:49,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:16:49,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:16:49,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:16:49,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:16:49,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:49,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:16:49,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:16:49,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:16:49,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:16:49,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:16:49,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:16:49,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:16:49,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:16:49,375 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 -> 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 [2025-01-10 01:16:49,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:16:49,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:16:49,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:16:49,641 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:16:49,641 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:16:49,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-01-10 01:16:50,794 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/912aee393/c8e11d28b958434bac9e7ffc1334a9e2/FLAG0a9e9be85 [2025-01-10 01:16:51,081 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:16:51,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-01-10 01:16:51,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/912aee393/c8e11d28b958434bac9e7ffc1334a9e2/FLAG0a9e9be85 [2025-01-10 01:16:51,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/912aee393/c8e11d28b958434bac9e7ffc1334a9e2 [2025-01-10 01:16:51,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:16:51,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:16:51,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:16:51,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:16:51,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:16:51,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c2bb789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51, skipping insertion in model container [2025-01-10 01:16:51,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:16:51,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:16:51,374 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:16:51,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:16:51,450 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:16:51,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51 WrapperNode [2025-01-10 01:16:51,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:16:51,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:16:51,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:16:51,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:16:51,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,489 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 60 [2025-01-10 01:16:51,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:16:51,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:16:51,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:16:51,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:16:51,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,515 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:16:51,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:16:51,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:16:51,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:16:51,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:16:51,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51" (1/1) ... [2025-01-10 01:16:51,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:16:51,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:16:51,556 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 01:16:51,559 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 01:16:51,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:16:51,577 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-10 01:16:51,577 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-10 01:16:51,577 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-10 01:16:51,577 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-10 01:16:51,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:16:51,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:16:51,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:16:51,579 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 01:16:51,688 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:16:51,690 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:16:51,816 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:16:51,816 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:16:51,897 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:16:51,898 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:16:51,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:16:51 BoogieIcfgContainer [2025-01-10 01:16:51,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:16:51,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:16:51,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:16:51,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:16:51,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:16:51" (1/3) ... [2025-01-10 01:16:51,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3126bdd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:16:51, skipping insertion in model container [2025-01-10 01:16:51,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:16:51" (2/3) ... [2025-01-10 01:16:51,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3126bdd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:16:51, skipping insertion in model container [2025-01-10 01:16:51,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:16:51" (3/3) ... [2025-01-10 01:16:51,905 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-01-10 01:16:51,917 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:16:51,919 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-10 01:16:51,919 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:16:51,958 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:16:51,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2025-01-10 01:16:52,005 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2025-01-10 01:16:52,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:52,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 43 events. 6/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2025-01-10 01:16:52,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2025-01-10 01:16:52,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 59 flow [2025-01-10 01:16:52,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:52,031 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:52,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-10 01:16:52,039 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:52,039 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-01-10 01:16:52,039 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:52,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:52,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:52,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:16:52,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:52,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2030658168, now seen corresponding path program 1 times [2025-01-10 01:16:52,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:52,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177778690] [2025-01-10 01:16:52,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:52,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:52,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:16:52,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:16:52,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:52,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:52,239 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 01:16:52,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:52,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177778690] [2025-01-10 01:16:52,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177778690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:52,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:52,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:52,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673987401] [2025-01-10 01:16:52,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:52,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:52,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:52,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:52,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:52,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-01-10 01:16:52,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 01:16:52,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:52,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-01-10 01:16:52,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:52,392 INFO L124 PetriNetUnfolderBase]: 69/163 cut-off events. [2025-01-10 01:16:52,393 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 01:16:52,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 163 events. 69/163 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 613 event pairs, 41 based on Foata normal form. 18/166 useless extension candidates. Maximal degree in co-relation 287. Up to 124 conditions per place. [2025-01-10 01:16:52,396 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 16 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2025-01-10 01:16:52,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 97 flow [2025-01-10 01:16:52,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-01-10 01:16:52,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 01:16:52,408 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 59 flow. Second operand 4 states and 54 transitions. [2025-01-10 01:16:52,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 97 flow [2025-01-10 01:16:52,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:52,413 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 62 flow [2025-01-10 01:16:52,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2025-01-10 01:16:52,417 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-01-10 01:16:52,417 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 62 flow [2025-01-10 01:16:52,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 01:16:52,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:52,418 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:52,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:16:52,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-10 01:16:52,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:52,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1475079309, now seen corresponding path program 1 times [2025-01-10 01:16:52,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:52,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915705881] [2025-01-10 01:16:52,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:52,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:52,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:16:52,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:16:52,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:52,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:52,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:16:52,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:16:52,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:16:52,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:52,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:52,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:16:52,457 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:16:52,459 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-10 01:16:52,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-01-10 01:16:52,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-10 01:16:52,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 5 remaining) [2025-01-10 01:16:52,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2025-01-10 01:16:52,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:16:52,461 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 01:16:52,463 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 01:16:52,463 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 01:16:52,483 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:16:52,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 106 flow [2025-01-10 01:16:52,506 INFO L124 PetriNetUnfolderBase]: 9/65 cut-off events. [2025-01-10 01:16:52,507 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:16:52,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 65 events. 9/65 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 188 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 76. Up to 6 conditions per place. [2025-01-10 01:16:52,508 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 106 flow [2025-01-10 01:16:52,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 30 transitions, 73 flow [2025-01-10 01:16:52,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:52,511 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:52,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:16:52,514 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:52,516 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-01-10 01:16:52,516 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:52,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:52,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:52,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:16:52,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:52,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1250603487, now seen corresponding path program 1 times [2025-01-10 01:16:52,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:52,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401818052] [2025-01-10 01:16:52,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:52,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:52,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:16:52,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:16:52,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:52,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:52,580 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 01:16:52,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:52,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401818052] [2025-01-10 01:16:52,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401818052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:52,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:52,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:52,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209302060] [2025-01-10 01:16:52,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:52,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:52,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:52,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:52,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:52,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2025-01-10 01:16:52,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 01:16:52,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:52,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2025-01-10 01:16:52,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:52,687 INFO L124 PetriNetUnfolderBase]: 390/755 cut-off events. [2025-01-10 01:16:52,688 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-10 01:16:52,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 755 events. 390/755 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3995 event pairs, 204 based on Foata normal form. 72/776 useless extension candidates. Maximal degree in co-relation 402. Up to 616 conditions per place. [2025-01-10 01:16:52,693 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 20 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-01-10 01:16:52,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 121 flow [2025-01-10 01:16:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2025-01-10 01:16:52,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43023255813953487 [2025-01-10 01:16:52,695 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 73 flow. Second operand 4 states and 74 transitions. [2025-01-10 01:16:52,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 121 flow [2025-01-10 01:16:52,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 120 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:52,698 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 80 flow [2025-01-10 01:16:52,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2025-01-10 01:16:52,698 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-01-10 01:16:52,699 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 80 flow [2025-01-10 01:16:52,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 01:16:52,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:52,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:52,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:16:52,700 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:16:52,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1218368193, now seen corresponding path program 1 times [2025-01-10 01:16:52,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:52,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172564445] [2025-01-10 01:16:52,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:52,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:16:52,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:16:52,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:52,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:52,742 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 01:16:52,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:52,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172564445] [2025-01-10 01:16:52,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172564445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:52,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:52,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:52,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703434429] [2025-01-10 01:16:52,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:52,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:52,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:52,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:52,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:52,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2025-01-10 01:16:52,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 01:16:52,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:52,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2025-01-10 01:16:52,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:52,833 INFO L124 PetriNetUnfolderBase]: 390/743 cut-off events. [2025-01-10 01:16:52,833 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-01-10 01:16:52,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 743 events. 390/743 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3872 event pairs, 354 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 517. Up to 620 conditions per place. [2025-01-10 01:16:52,839 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 17 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2025-01-10 01:16:52,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 116 flow [2025-01-10 01:16:52,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-01-10 01:16:52,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4263565891472868 [2025-01-10 01:16:52,842 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 80 flow. Second operand 3 states and 55 transitions. [2025-01-10 01:16:52,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 116 flow [2025-01-10 01:16:52,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:52,844 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 74 flow [2025-01-10 01:16:52,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2025-01-10 01:16:52,845 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2025-01-10 01:16:52,845 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 74 flow [2025-01-10 01:16:52,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 01:16:52,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:52,845 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:52,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:16:52,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-01-10 01:16:52,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:52,847 INFO L85 PathProgramCache]: Analyzing trace with hash 886324398, now seen corresponding path program 1 times [2025-01-10 01:16:52,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:52,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941214238] [2025-01-10 01:16:52,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:52,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:52,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:16:52,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:16:52,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:52,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:52,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:16:52,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:16:52,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:16:52,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:52,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:52,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:16:52,881 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:16:52,882 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-01-10 01:16:52,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-01-10 01:16:52,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-01-10 01:16:52,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-01-10 01:16:52,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-01-10 01:16:52,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-01-10 01:16:52,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:16:52,882 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 01:16:52,883 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 01:16:52,883 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 01:16:52,912 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:16:52,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 59 transitions, 154 flow [2025-01-10 01:16:52,918 INFO L124 PetriNetUnfolderBase]: 12/87 cut-off events. [2025-01-10 01:16:52,919 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 01:16:52,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 87 events. 12/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 277 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 104. Up to 8 conditions per place. [2025-01-10 01:16:52,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 59 transitions, 154 flow [2025-01-10 01:16:52,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 34 transitions, 89 flow [2025-01-10 01:16:52,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:52,921 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:52,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 01:16:52,923 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:52,923 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-01-10 01:16:52,923 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:52,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:52,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:52,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 01:16:52,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1317943498, now seen corresponding path program 1 times [2025-01-10 01:16:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:52,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347356590] [2025-01-10 01:16:52,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:52,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:16:52,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:16:52,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:52,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:52,957 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 01:16:52,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:52,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347356590] [2025-01-10 01:16:52,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347356590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:52,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:52,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:52,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758248435] [2025-01-10 01:16:52,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:52,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:52,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:52,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:52,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:52,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-01-10 01:16:52,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 01:16:52,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:52,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-01-10 01:16:52,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:53,195 INFO L124 PetriNetUnfolderBase]: 1695/2834 cut-off events. [2025-01-10 01:16:53,195 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-01-10 01:16:53,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5404 conditions, 2834 events. 1695/2834 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 16696 event pairs, 1331 based on Foata normal form. 234/2909 useless extension candidates. Maximal degree in co-relation 1466. Up to 2434 conditions per place. [2025-01-10 01:16:53,210 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 23 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2025-01-10 01:16:53,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 143 flow [2025-01-10 01:16:53,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-01-10 01:16:53,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3940677966101695 [2025-01-10 01:16:53,211 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 89 flow. Second operand 4 states and 93 transitions. [2025-01-10 01:16:53,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 143 flow [2025-01-10 01:16:53,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 140 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:53,213 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 94 flow [2025-01-10 01:16:53,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2025-01-10 01:16:53,214 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-01-10 01:16:53,214 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 94 flow [2025-01-10 01:16:53,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 01:16:53,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:53,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:53,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:16:53,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 01:16:53,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:53,215 INFO L85 PathProgramCache]: Analyzing trace with hash -743782402, now seen corresponding path program 1 times [2025-01-10 01:16:53,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:53,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281082272] [2025-01-10 01:16:53,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:53,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:53,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:16:53,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:16:53,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:53,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:53,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 01:16:53,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:53,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281082272] [2025-01-10 01:16:53,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281082272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:53,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:53,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:53,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420715003] [2025-01-10 01:16:53,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:53,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:53,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:53,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:53,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:53,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-01-10 01:16:53,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 01:16:53,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:53,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-01-10 01:16:53,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:53,424 INFO L124 PetriNetUnfolderBase]: 1695/2825 cut-off events. [2025-01-10 01:16:53,425 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-01-10 01:16:53,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5469 conditions, 2825 events. 1695/2825 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16535 event pairs, 1578 based on Foata normal form. 0/2701 useless extension candidates. Maximal degree in co-relation 1976. Up to 2438 conditions per place. [2025-01-10 01:16:53,439 INFO L140 encePairwiseOnDemand]: 57/59 looper letters, 20 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2025-01-10 01:16:53,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 136 flow [2025-01-10 01:16:53,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-01-10 01:16:53,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3954802259887006 [2025-01-10 01:16:53,440 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 94 flow. Second operand 3 states and 70 transitions. [2025-01-10 01:16:53,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 136 flow [2025-01-10 01:16:53,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:53,442 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 88 flow [2025-01-10 01:16:53,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2025-01-10 01:16:53,442 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2025-01-10 01:16:53,442 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 88 flow [2025-01-10 01:16:53,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 01:16:53,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:53,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:53,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:16:53,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 01:16:53,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:53,443 INFO L85 PathProgramCache]: Analyzing trace with hash -264479601, now seen corresponding path program 1 times [2025-01-10 01:16:53,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:53,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909711807] [2025-01-10 01:16:53,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:53,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:53,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:16:53,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:16:53,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:53,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:53,544 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 01:16:53,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:53,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909711807] [2025-01-10 01:16:53,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909711807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:53,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:53,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:16:53,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418532276] [2025-01-10 01:16:53,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:53,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:16:53,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:53,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:16:53,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:16:53,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-01-10 01:16:53,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 01:16:53,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:53,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-01-10 01:16:53,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:53,873 INFO L124 PetriNetUnfolderBase]: 2541/4013 cut-off events. [2025-01-10 01:16:53,874 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-01-10 01:16:53,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7851 conditions, 4013 events. 2541/4013 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 23561 event pairs, 1296 based on Foata normal form. 0/3631 useless extension candidates. Maximal degree in co-relation 7841. Up to 2039 conditions per place. [2025-01-10 01:16:53,888 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 27 selfloop transitions, 3 changer transitions 19/57 dead transitions. [2025-01-10 01:16:53,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 240 flow [2025-01-10 01:16:53,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:16:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:16:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-01-10 01:16:53,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4096045197740113 [2025-01-10 01:16:53,892 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 88 flow. Second operand 6 states and 145 transitions. [2025-01-10 01:16:53,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 240 flow [2025-01-10 01:16:53,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 239 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:53,894 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 101 flow [2025-01-10 01:16:53,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2025-01-10 01:16:53,895 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2025-01-10 01:16:53,895 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 101 flow [2025-01-10 01:16:53,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 01:16:53,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:53,895 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:53,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:16:53,896 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 01:16:53,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:53,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1337914188, now seen corresponding path program 1 times [2025-01-10 01:16:53,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:53,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296478719] [2025-01-10 01:16:53,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:53,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:53,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:16:53,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:16:53,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:53,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:53,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:16:53,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:16:53,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:16:53,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:53,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:53,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:16:53,917 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:16:53,917 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-01-10 01:16:53,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 01:16:53,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-01-10 01:16:53,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 7 remaining) [2025-01-10 01:16:53,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-01-10 01:16:53,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-01-10 01:16:53,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 01:16:53,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:16:53,918 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 01:16:53,918 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 01:16:53,918 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 01:16:53,946 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:16:53,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 75 transitions, 206 flow [2025-01-10 01:16:53,954 INFO L124 PetriNetUnfolderBase]: 15/109 cut-off events. [2025-01-10 01:16:53,954 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 01:16:53,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 109 events. 15/109 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 376 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 133. Up to 10 conditions per place. [2025-01-10 01:16:53,955 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 75 transitions, 206 flow [2025-01-10 01:16:53,956 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 107 flow [2025-01-10 01:16:53,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:53,957 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:53,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 01:16:53,958 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:53,958 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-01-10 01:16:53,958 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:53,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:53,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:53,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 01:16:53,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:53,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1380015491, now seen corresponding path program 1 times [2025-01-10 01:16:53,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:53,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836817675] [2025-01-10 01:16:53,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:53,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:53,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:16:53,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:16:53,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:53,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:54,009 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 01:16:54,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:54,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836817675] [2025-01-10 01:16:54,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836817675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:54,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:54,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:54,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480138870] [2025-01-10 01:16:54,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:54,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:54,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:54,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:54,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:54,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-01-10 01:16:54,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 01:16:54,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:54,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-01-10 01:16:54,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:54,583 INFO L124 PetriNetUnfolderBase]: 6636/10115 cut-off events. [2025-01-10 01:16:54,583 INFO L125 PetriNetUnfolderBase]: For 501/501 co-relation queries the response was YES. [2025-01-10 01:16:54,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19463 conditions, 10115 events. 6636/10115 cut-off events. For 501/501 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 64609 event pairs, 5516 based on Foata normal form. 720/10352 useless extension candidates. Maximal degree in co-relation 5468. Up to 8914 conditions per place. [2025-01-10 01:16:54,634 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 26 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2025-01-10 01:16:54,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 167 flow [2025-01-10 01:16:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-01-10 01:16:54,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2025-01-10 01:16:54,636 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 107 flow. Second operand 4 states and 112 transitions. [2025-01-10 01:16:54,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 167 flow [2025-01-10 01:16:54,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 160 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:54,642 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 108 flow [2025-01-10 01:16:54,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-01-10 01:16:54,643 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-01-10 01:16:54,643 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 108 flow [2025-01-10 01:16:54,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 01:16:54,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:54,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:54,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:16:54,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 01:16:54,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:54,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1635740861, now seen corresponding path program 1 times [2025-01-10 01:16:54,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:54,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170128672] [2025-01-10 01:16:54,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:54,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:54,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:16:54,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:16:54,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:54,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:54,671 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 01:16:54,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:54,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170128672] [2025-01-10 01:16:54,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170128672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:54,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:54,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:54,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802287946] [2025-01-10 01:16:54,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:54,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:54,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:54,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:54,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:54,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-01-10 01:16:54,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 01:16:54,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:54,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-01-10 01:16:54,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:55,236 INFO L124 PetriNetUnfolderBase]: 6636/10069 cut-off events. [2025-01-10 01:16:55,237 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2025-01-10 01:16:55,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19599 conditions, 10069 events. 6636/10069 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 63698 event pairs, 6276 based on Foata normal form. 0/9705 useless extension candidates. Maximal degree in co-relation 19562. Up to 8918 conditions per place. [2025-01-10 01:16:55,264 INFO L140 encePairwiseOnDemand]: 73/75 looper letters, 23 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-01-10 01:16:55,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 156 flow [2025-01-10 01:16:55,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:16:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:16:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-01-10 01:16:55,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2025-01-10 01:16:55,267 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 108 flow. Second operand 3 states and 85 transitions. [2025-01-10 01:16:55,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 156 flow [2025-01-10 01:16:55,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:16:55,268 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 102 flow [2025-01-10 01:16:55,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2025-01-10 01:16:55,269 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2025-01-10 01:16:55,270 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 102 flow [2025-01-10 01:16:55,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 01:16:55,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:55,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:55,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:16:55,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 01:16:55,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:55,271 INFO L85 PathProgramCache]: Analyzing trace with hash -298239948, now seen corresponding path program 1 times [2025-01-10 01:16:55,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:55,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544408058] [2025-01-10 01:16:55,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:55,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:55,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:16:55,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:16:55,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:55,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:55,345 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 01:16:55,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:55,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544408058] [2025-01-10 01:16:55,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544408058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:55,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:55,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:16:55,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532950047] [2025-01-10 01:16:55,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:55,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:16:55,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:55,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:16:55,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:16:55,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-01-10 01:16:55,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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 01:16:55,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:55,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-01-10 01:16:55,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:56,063 INFO L124 PetriNetUnfolderBase]: 9912/14254 cut-off events. [2025-01-10 01:16:56,063 INFO L125 PetriNetUnfolderBase]: For 395/395 co-relation queries the response was YES. [2025-01-10 01:16:56,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28137 conditions, 14254 events. 9912/14254 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 88130 event pairs, 5184 based on Foata normal form. 0/13143 useless extension candidates. Maximal degree in co-relation 28126. Up to 7466 conditions per place. [2025-01-10 01:16:56,116 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 32 selfloop transitions, 3 changer transitions 23/67 dead transitions. [2025-01-10 01:16:56,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 284 flow [2025-01-10 01:16:56,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:16:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:16:56,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2025-01-10 01:16:56,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39555555555555555 [2025-01-10 01:16:56,118 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 102 flow. Second operand 6 states and 178 transitions. [2025-01-10 01:16:56,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 284 flow [2025-01-10 01:16:56,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:56,120 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 115 flow [2025-01-10 01:16:56,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-01-10 01:16:56,120 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2025-01-10 01:16:56,120 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 115 flow [2025-01-10 01:16:56,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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 01:16:56,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:56,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:56,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:16:56,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 01:16:56,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash -656489425, now seen corresponding path program 1 times [2025-01-10 01:16:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:56,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861839458] [2025-01-10 01:16:56,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:56,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:56,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:16:56,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:16:56,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:56,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:16:56,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:56,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861839458] [2025-01-10 01:16:56,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861839458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:56,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:56,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:16:56,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296333370] [2025-01-10 01:16:56,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:56,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:16:56,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:56,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:16:56,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:16:56,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2025-01-10 01:16:56,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 01:16:56,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:56,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2025-01-10 01:16:56,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:56,738 INFO L124 PetriNetUnfolderBase]: 6571/9981 cut-off events. [2025-01-10 01:16:56,738 INFO L125 PetriNetUnfolderBase]: For 1812/1812 co-relation queries the response was YES. [2025-01-10 01:16:56,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21496 conditions, 9981 events. 6571/9981 cut-off events. For 1812/1812 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 61851 event pairs, 3258 based on Foata normal form. 3/9543 useless extension candidates. Maximal degree in co-relation 21482. Up to 8776 conditions per place. [2025-01-10 01:16:56,780 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 31 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2025-01-10 01:16:56,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 205 flow [2025-01-10 01:16:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:16:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:16:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-01-10 01:16:56,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36 [2025-01-10 01:16:56,781 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 115 flow. Second operand 5 states and 135 transitions. [2025-01-10 01:16:56,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 205 flow [2025-01-10 01:16:56,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 197 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:16:56,800 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 125 flow [2025-01-10 01:16:56,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2025-01-10 01:16:56,800 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2025-01-10 01:16:56,801 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 125 flow [2025-01-10 01:16:56,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 01:16:56,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:56,801 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:56,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:16:56,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-01-10 01:16:56,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:56,802 INFO L85 PathProgramCache]: Analyzing trace with hash -317930383, now seen corresponding path program 1 times [2025-01-10 01:16:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:56,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978546961] [2025-01-10 01:16:56,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:56,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:56,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:16:56,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:16:56,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:56,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:56,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:16:56,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:16:56,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:16:56,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:56,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:16:56,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:16:56,830 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:16:56,830 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-01-10 01:16:56,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-01-10 01:16:56,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2025-01-10 01:16:56,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 8 remaining) [2025-01-10 01:16:56,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-01-10 01:16:56,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-01-10 01:16:56,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-01-10 01:16:56,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 01:16:56,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:16:56,830 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 01:16:56,831 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 01:16:56,831 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-10 01:16:56,861 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:16:56,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 91 transitions, 262 flow [2025-01-10 01:16:56,866 INFO L124 PetriNetUnfolderBase]: 18/131 cut-off events. [2025-01-10 01:16:56,867 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 01:16:56,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 131 events. 18/131 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 462 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 163. Up to 12 conditions per place. [2025-01-10 01:16:56,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 91 transitions, 262 flow [2025-01-10 01:16:56,867 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 42 transitions, 127 flow [2025-01-10 01:16:56,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:16:56,868 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:16:56,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-10 01:16:56,869 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:16:56,869 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-01-10 01:16:56,869 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:16:56,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:56,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:56,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 01:16:56,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:56,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1064387508, now seen corresponding path program 1 times [2025-01-10 01:16:56,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:56,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728451511] [2025-01-10 01:16:56,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:56,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:56,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:16:56,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:16:56,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:56,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:56,900 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 01:16:56,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:56,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728451511] [2025-01-10 01:16:56,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728451511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:56,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:56,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:16:56,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213652045] [2025-01-10 01:16:56,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:56,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:16:56,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:56,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:16:56,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:16:56,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 91 [2025-01-10 01:16:56,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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 01:16:56,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:56,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 91 [2025-01-10 01:16:56,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:16:58,405 INFO L124 PetriNetUnfolderBase]: 24537/35051 cut-off events. [2025-01-10 01:16:58,405 INFO L125 PetriNetUnfolderBase]: For 2412/2412 co-relation queries the response was YES. [2025-01-10 01:16:58,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67890 conditions, 35051 events. 24537/35051 cut-off events. For 2412/2412 co-relation queries the response was YES. Maximal size of possible extension queue 1496. Compared 234212 event pairs, 18852 based on Foata normal form. 2178/35765 useless extension candidates. Maximal degree in co-relation 19558. Up to 31432 conditions per place. [2025-01-10 01:16:58,588 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 29 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-01-10 01:16:58,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 43 transitions, 193 flow [2025-01-10 01:16:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:16:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:16:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-01-10 01:16:58,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3598901098901099 [2025-01-10 01:16:58,589 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 127 flow. Second operand 4 states and 131 transitions. [2025-01-10 01:16:58,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 43 transitions, 193 flow [2025-01-10 01:16:58,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 180 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 01:16:58,598 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 122 flow [2025-01-10 01:16:58,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2025-01-10 01:16:58,599 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2025-01-10 01:16:58,599 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 122 flow [2025-01-10 01:16:58,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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 01:16:58,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:16:58,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:16:58,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:16:58,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 01:16:58,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:16:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1625234300, now seen corresponding path program 1 times [2025-01-10 01:16:58,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:16:58,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367454819] [2025-01-10 01:16:58,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:16:58,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:16:58,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:16:58,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:16:58,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:16:58,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:16:58,620 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 01:16:58,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:16:58,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367454819] [2025-01-10 01:16:58,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367454819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:16:58,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:16:58,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:16:58,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001142986] [2025-01-10 01:16:58,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:16:58,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:16:58,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:16:58,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:16:58,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:16:58,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 91 [2025-01-10 01:16:58,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:16:58,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:16:58,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 91 [2025-01-10 01:16:58,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:00,194 INFO L124 PetriNetUnfolderBase]: 24537/34919 cut-off events. [2025-01-10 01:17:00,195 INFO L125 PetriNetUnfolderBase]: For 1569/1569 co-relation queries the response was YES. [2025-01-10 01:17:00,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68183 conditions, 34919 events. 24537/34919 cut-off events. For 1569/1569 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 232339 event pairs, 23448 based on Foata normal form. 0/33823 useless extension candidates. Maximal degree in co-relation 24248. Up to 31436 conditions per place. [2025-01-10 01:17:00,332 INFO L140 encePairwiseOnDemand]: 89/91 looper letters, 26 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2025-01-10 01:17:00,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 39 transitions, 176 flow [2025-01-10 01:17:00,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:17:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:17:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-01-10 01:17:00,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3663003663003663 [2025-01-10 01:17:00,333 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 122 flow. Second operand 3 states and 100 transitions. [2025-01-10 01:17:00,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 39 transitions, 176 flow [2025-01-10 01:17:00,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 39 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:17:00,335 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 116 flow [2025-01-10 01:17:00,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2025-01-10 01:17:00,335 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2025-01-10 01:17:00,335 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 116 flow [2025-01-10 01:17:00,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:17:00,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:00,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:00,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:17:00,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 01:17:00,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:00,336 INFO L85 PathProgramCache]: Analyzing trace with hash 225869832, now seen corresponding path program 1 times [2025-01-10 01:17:00,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:17:00,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420061331] [2025-01-10 01:17:00,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:17:00,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:17:00,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:17:00,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:17:00,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:00,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:00,397 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 01:17:00,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:17:00,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420061331] [2025-01-10 01:17:00,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420061331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:17:00,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:17:00,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:17:00,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372841427] [2025-01-10 01:17:00,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:17:00,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:17:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:17:00,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:17:00,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:17:00,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 91 [2025-01-10 01:17:00,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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 01:17:00,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:00,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 91 [2025-01-10 01:17:00,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:02,795 INFO L124 PetriNetUnfolderBase]: 36561/49553 cut-off events. [2025-01-10 01:17:02,795 INFO L125 PetriNetUnfolderBase]: For 1568/1568 co-relation queries the response was YES. [2025-01-10 01:17:02,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98105 conditions, 49553 events. 36561/49553 cut-off events. For 1568/1568 co-relation queries the response was YES. Maximal size of possible extension queue 2081. Compared 315641 event pairs, 19440 based on Foata normal form. 0/46255 useless extension candidates. Maximal degree in co-relation 98093. Up to 26339 conditions per place. [2025-01-10 01:17:02,964 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 37 selfloop transitions, 3 changer transitions 27/77 dead transitions. [2025-01-10 01:17:02,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 328 flow [2025-01-10 01:17:02,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:17:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:17:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2025-01-10 01:17:02,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38644688644688646 [2025-01-10 01:17:02,966 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 116 flow. Second operand 6 states and 211 transitions. [2025-01-10 01:17:02,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 328 flow [2025-01-10 01:17:02,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 327 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:17:02,968 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 129 flow [2025-01-10 01:17:02,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2025-01-10 01:17:02,969 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2025-01-10 01:17:02,969 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 129 flow [2025-01-10 01:17:02,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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 01:17:02,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:02,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:02,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:17:02,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 01:17:02,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:02,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1588955346, now seen corresponding path program 1 times [2025-01-10 01:17:02,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:17:02,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062900145] [2025-01-10 01:17:02,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:17:02,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:17:02,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:17:02,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:17:02,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:02,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:17:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:17:03,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062900145] [2025-01-10 01:17:03,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062900145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:17:03,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:17:03,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:17:03,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145653931] [2025-01-10 01:17:03,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:17:03,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:17:03,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:17:03,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:17:03,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:17:03,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 91 [2025-01-10 01:17:03,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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 01:17:03,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:03,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 91 [2025-01-10 01:17:03,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:04,264 INFO L124 PetriNetUnfolderBase]: 24472/34398 cut-off events. [2025-01-10 01:17:04,264 INFO L125 PetriNetUnfolderBase]: For 6684/6684 co-relation queries the response was YES. [2025-01-10 01:17:04,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74021 conditions, 34398 events. 24472/34398 cut-off events. For 6684/6684 co-relation queries the response was YES. Maximal size of possible extension queue 1404. Compared 220630 event pairs, 16552 based on Foata normal form. 3/33285 useless extension candidates. Maximal degree in co-relation 74006. Up to 31294 conditions per place. [2025-01-10 01:17:04,641 INFO L140 encePairwiseOnDemand]: 87/91 looper letters, 34 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-01-10 01:17:04,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 225 flow [2025-01-10 01:17:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:17:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:17:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2025-01-10 01:17:04,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34725274725274724 [2025-01-10 01:17:04,642 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 129 flow. Second operand 5 states and 158 transitions. [2025-01-10 01:17:04,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 225 flow [2025-01-10 01:17:04,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 217 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:17:04,736 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 139 flow [2025-01-10 01:17:04,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2025-01-10 01:17:04,737 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2025-01-10 01:17:04,737 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 139 flow [2025-01-10 01:17:04,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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 01:17:04,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:04,737 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:04,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:17:04,737 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 01:17:04,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:04,737 INFO L85 PathProgramCache]: Analyzing trace with hash 86184733, now seen corresponding path program 1 times [2025-01-10 01:17:04,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:17:04,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239626672] [2025-01-10 01:17:04,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:17:04,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:17:04,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:17:04,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:17:04,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:04,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:17:04,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:17:04,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239626672] [2025-01-10 01:17:04,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239626672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:17:04,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:17:04,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:17:04,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833059099] [2025-01-10 01:17:04,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:17:04,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:17:04,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:17:04,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:17:04,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:17:04,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 91 [2025-01-10 01:17:04,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 39 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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 01:17:04,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:04,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 91 [2025-01-10 01:17:04,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:06,338 INFO L124 PetriNetUnfolderBase]: 24181/33684 cut-off events. [2025-01-10 01:17:06,338 INFO L125 PetriNetUnfolderBase]: For 3647/3647 co-relation queries the response was YES. [2025-01-10 01:17:06,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70248 conditions, 33684 events. 24181/33684 cut-off events. For 3647/3647 co-relation queries the response was YES. Maximal size of possible extension queue 1376. Compared 212410 event pairs, 9790 based on Foata normal form. 9/32613 useless extension candidates. Maximal degree in co-relation 70233. Up to 30754 conditions per place. [2025-01-10 01:17:06,530 INFO L140 encePairwiseOnDemand]: 87/91 looper letters, 41 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-01-10 01:17:06,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 267 flow [2025-01-10 01:17:06,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:17:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:17:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2025-01-10 01:17:06,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34798534798534797 [2025-01-10 01:17:06,531 INFO L175 Difference]: Start difference. First operand has 58 places, 39 transitions, 139 flow. Second operand 6 states and 190 transitions. [2025-01-10 01:17:06,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 267 flow [2025-01-10 01:17:06,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 259 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 01:17:06,570 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 153 flow [2025-01-10 01:17:06,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2025-01-10 01:17:06,571 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2025-01-10 01:17:06,571 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 153 flow [2025-01-10 01:17:06,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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 01:17:06,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:06,571 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:06,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:17:06,571 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 01:17:06,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:06,571 INFO L85 PathProgramCache]: Analyzing trace with hash 762752493, now seen corresponding path program 1 times [2025-01-10 01:17:06,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:17:06,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447889950] [2025-01-10 01:17:06,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:17:06,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:17:06,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:17:06,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:17:06,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:06,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:17:06,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:17:06,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447889950] [2025-01-10 01:17:06,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447889950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:17:06,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:17:06,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:17:06,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901838920] [2025-01-10 01:17:06,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:17:06,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:17:06,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:17:06,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:17:06,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:17:06,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 91 [2025-01-10 01:17:06,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 153 flow. Second operand has 7 states, 7 states have (on average 26.428571428571427) internal successors, (185), 7 states have internal predecessors, (185), 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 01:17:06,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:06,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 91 [2025-01-10 01:17:06,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:07,779 INFO L124 PetriNetUnfolderBase]: 23020/31605 cut-off events. [2025-01-10 01:17:07,779 INFO L125 PetriNetUnfolderBase]: For 5249/5249 co-relation queries the response was YES. [2025-01-10 01:17:07,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66922 conditions, 31605 events. 23020/31605 cut-off events. For 5249/5249 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 192026 event pairs, 7522 based on Foata normal form. 27/30579 useless extension candidates. Maximal degree in co-relation 66906. Up to 28756 conditions per place. [2025-01-10 01:17:07,965 INFO L140 encePairwiseOnDemand]: 87/91 looper letters, 50 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2025-01-10 01:17:07,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 321 flow [2025-01-10 01:17:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:17:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:17:07,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 224 transitions. [2025-01-10 01:17:07,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3516483516483517 [2025-01-10 01:17:07,968 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 153 flow. Second operand 7 states and 224 transitions. [2025-01-10 01:17:07,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 321 flow [2025-01-10 01:17:08,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 309 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-10 01:17:08,039 INFO L231 Difference]: Finished difference. Result has 64 places, 41 transitions, 167 flow [2025-01-10 01:17:08,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=167, PETRI_PLACES=64, PETRI_TRANSITIONS=41} [2025-01-10 01:17:08,039 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2025-01-10 01:17:08,039 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 41 transitions, 167 flow [2025-01-10 01:17:08,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.428571428571427) internal successors, (185), 7 states have internal predecessors, (185), 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 01:17:08,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:08,040 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:08,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:17:08,040 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 01:17:08,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:08,040 INFO L85 PathProgramCache]: Analyzing trace with hash 463667467, now seen corresponding path program 1 times [2025-01-10 01:17:08,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:17:08,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964853387] [2025-01-10 01:17:08,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:17:08,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:17:08,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:17:08,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:17:08,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:08,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:17:08,050 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 01:17:08,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:17:08,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:17:08,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:08,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 01:17:08,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 01:17:08,058 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 01:17:08,058 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-01-10 01:17:08,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2025-01-10 01:17:08,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 9 remaining) [2025-01-10 01:17:08,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 9 remaining) [2025-01-10 01:17:08,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 9 remaining) [2025-01-10 01:17:08,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2025-01-10 01:17:08,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2025-01-10 01:17:08,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2025-01-10 01:17:08,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-01-10 01:17:08,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:17:08,059 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:08,059 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 01:17:08,059 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-01-10 01:17:08,095 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 01:17:08,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 322 flow [2025-01-10 01:17:08,104 INFO L124 PetriNetUnfolderBase]: 21/153 cut-off events. [2025-01-10 01:17:08,104 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-10 01:17:08,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 153 events. 21/153 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 546 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 194. Up to 14 conditions per place. [2025-01-10 01:17:08,105 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 322 flow [2025-01-10 01:17:08,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 46 transitions, 149 flow [2025-01-10 01:17:08,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:17:08,106 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;@583b5965, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:17:08,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 01:17:08,108 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:17:08,109 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-01-10 01:17:08,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:17:08,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:08,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:08,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-01-10 01:17:08,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:08,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1720298203, now seen corresponding path program 1 times [2025-01-10 01:17:08,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:17:08,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713038913] [2025-01-10 01:17:08,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:17:08,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:17:08,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:17:08,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:17:08,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:08,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:08,139 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 01:17:08,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:17:08,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713038913] [2025-01-10 01:17:08,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713038913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:17:08,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:17:08,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:17:08,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649310604] [2025-01-10 01:17:08,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:17:08,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:17:08,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:17:08,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:17:08,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:17:08,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 107 [2025-01-10 01:17:08,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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 01:17:08,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:08,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 107 [2025-01-10 01:17:08,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:17:14,545 INFO L124 PetriNetUnfolderBase]: 87474/119042 cut-off events. [2025-01-10 01:17:14,545 INFO L125 PetriNetUnfolderBase]: For 10353/10353 co-relation queries the response was YES. [2025-01-10 01:17:14,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231829 conditions, 119042 events. 87474/119042 cut-off events. For 10353/10353 co-relation queries the response was YES. Maximal size of possible extension queue 4519. Compared 824062 event pairs, 77282 based on Foata normal form. 6552/120842 useless extension candidates. Maximal degree in co-relation 68048. Up to 108220 conditions per place. [2025-01-10 01:17:15,004 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 32 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-01-10 01:17:15,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 221 flow [2025-01-10 01:17:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:17:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:17:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2025-01-10 01:17:15,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35046728971962615 [2025-01-10 01:17:15,005 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 149 flow. Second operand 4 states and 150 transitions. [2025-01-10 01:17:15,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 221 flow [2025-01-10 01:17:15,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 47 transitions, 200 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-01-10 01:17:15,062 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 136 flow [2025-01-10 01:17:15,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2025-01-10 01:17:15,062 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2025-01-10 01:17:15,063 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 136 flow [2025-01-10 01:17:15,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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 01:17:15,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:17:15,063 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:17:15,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:17:15,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-01-10 01:17:15,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:17:15,063 INFO L85 PathProgramCache]: Analyzing trace with hash -775302085, now seen corresponding path program 1 times [2025-01-10 01:17:15,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:17:15,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108913745] [2025-01-10 01:17:15,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:17:15,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:17:15,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:17:15,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:17:15,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:17:15,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:17:15,084 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 01:17:15,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:17:15,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108913745] [2025-01-10 01:17:15,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108913745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:17:15,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:17:15,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:17:15,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919785523] [2025-01-10 01:17:15,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:17:15,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:17:15,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:17:15,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:17:15,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:17:15,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 107 [2025-01-10 01:17:15,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 01:17:15,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:17:15,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 107 [2025-01-10 01:17:15,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand