./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/weaver/parallel-ticket-4.wvr.c -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 ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:38:07,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:38:07,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:38:07,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:38:07,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:38:07,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:38:07,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:38:07,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:38:07,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:38:07,340 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:38:07,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:38:07,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:38:07,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:38:07,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:38:07,342 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:38:07,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:38:07,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:38:07,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:38:07,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:38:07,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:38:07,343 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:38:07,343 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:38:07,343 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:38:07,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:38:07,343 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:38:07,343 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:38:07,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:38:07,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:38:07,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:38:07,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:38:07,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:38:07,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:38:07,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:38:07,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:38:07,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:38:07,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:38:07,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:38:07,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:38:07,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:38:07,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:38:07,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:38:07,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:38:07,346 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 -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2025-02-08 08:38:07,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:38:07,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:38:07,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:38:07,652 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:38:07,652 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:38:07,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-02-08 08:38:08,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34278fa54/6c636c8a45ed4961bf1d0f5cd1a37f35/FLAG9a0a38664 [2025-02-08 08:38:09,254 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:38:09,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-02-08 08:38:09,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34278fa54/6c636c8a45ed4961bf1d0f5cd1a37f35/FLAG9a0a38664 [2025-02-08 08:38:09,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34278fa54/6c636c8a45ed4961bf1d0f5cd1a37f35 [2025-02-08 08:38:09,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:38:09,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:38:09,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:38:09,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:38:09,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:38:09,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:38:09" (1/1) ... [2025-02-08 08:38:09,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e76790c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09, skipping insertion in model container [2025-02-08 08:38:09,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:38:09" (1/1) ... [2025-02-08 08:38:09,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:38:09,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:38:09,509 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:38:09,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:38:09,538 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:38:09,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09 WrapperNode [2025-02-08 08:38:09,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:38:09,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:38:09,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:38:09,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:38:09,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09" (1/1) ... [2025-02-08 08:38:09,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09" (1/1) ... [2025-02-08 08:38:09,567 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 174 [2025-02-08 08:38:09,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:38:09,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:38:09,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:38:09,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:38:09,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09" (1/1) ... [2025-02-08 08:38:09,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09" (1/1) ... [2025-02-08 08:38:09,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09" (1/1) ... [2025-02-08 08:38:09,590 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-02-08 08:38:09,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09" (1/1) ... [2025-02-08 08:38:09,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09" (1/1) ... [2025-02-08 08:38:09,600 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09" (1/1) ... [2025-02-08 08:38:09,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09" (1/1) ... [2025-02-08 08:38:09,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09" (1/1) ... [2025-02-08 08:38:09,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09" (1/1) ... [2025-02-08 08:38:09,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:38:09,609 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:38:09,609 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:38:09,609 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:38:09,610 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09" (1/1) ... [2025-02-08 08:38:09,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:38:09,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:38:09,641 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-02-08 08:38:09,645 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-02-08 08:38:09,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:38:09,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:38:09,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:38:09,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:38:09,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:38:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:38:09,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:38:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 08:38:09,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 08:38:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:38:09,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:38:09,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:38:09,671 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:38:09,769 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:38:09,770 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:38:10,049 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:38:10,049 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:38:10,208 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:38:10,208 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:38:10,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:38:10 BoogieIcfgContainer [2025-02-08 08:38:10,208 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:38:10,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:38:10,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:38:10,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:38:10,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:38:09" (1/3) ... [2025-02-08 08:38:10,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de60619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:38:10, skipping insertion in model container [2025-02-08 08:38:10,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:38:09" (2/3) ... [2025-02-08 08:38:10,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de60619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:38:10, skipping insertion in model container [2025-02-08 08:38:10,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:38:10" (3/3) ... [2025-02-08 08:38:10,219 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2025-02-08 08:38:10,232 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:38:10,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-08 08:38:10,234 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:38:10,302 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 08:38:10,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 61 transitions, 150 flow [2025-02-08 08:38:10,392 INFO L124 PetriNetUnfolderBase]: 3/57 cut-off events. [2025-02-08 08:38:10,395 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:38:10,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 57 events. 3/57 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 102 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-02-08 08:38:10,399 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 61 transitions, 150 flow [2025-02-08 08:38:10,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 56 transitions, 136 flow [2025-02-08 08:38:10,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:38:10,432 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;@1bcde4e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:38:10,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 08:38:10,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:38:10,460 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2025-02-08 08:38:10,460 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:38:10,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:10,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:10,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:38:10,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:10,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1022701426, now seen corresponding path program 1 times [2025-02-08 08:38:10,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:10,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52393131] [2025-02-08 08:38:10,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:10,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:10,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 08:38:10,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 08:38:10,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:10,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:10,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:10,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52393131] [2025-02-08 08:38:10,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52393131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:10,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:10,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:38:10,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034053718] [2025-02-08 08:38:10,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:10,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:38:10,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:10,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:38:10,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:38:10,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-02-08 08:38:10,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:10,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:10,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-02-08 08:38:10,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:13,014 INFO L124 PetriNetUnfolderBase]: 17631/24209 cut-off events. [2025-02-08 08:38:13,015 INFO L125 PetriNetUnfolderBase]: For 1365/1365 co-relation queries the response was YES. [2025-02-08 08:38:13,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48738 conditions, 24209 events. 17631/24209 cut-off events. For 1365/1365 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 140994 event pairs, 6173 based on Foata normal form. 2/23607 useless extension candidates. Maximal degree in co-relation 45447. Up to 14774 conditions per place. [2025-02-08 08:38:13,192 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 66 selfloop transitions, 6 changer transitions 1/84 dead transitions. [2025-02-08 08:38:13,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 356 flow [2025-02-08 08:38:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:38:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:38:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-02-08 08:38:13,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2025-02-08 08:38:13,208 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 136 flow. Second operand 3 states and 123 transitions. [2025-02-08 08:38:13,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 356 flow [2025-02-08 08:38:13,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 328 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 08:38:13,255 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2025-02-08 08:38:13,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-02-08 08:38:13,260 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2025-02-08 08:38:13,261 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2025-02-08 08:38:13,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:13,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:13,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:13,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:38:13,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:38:13,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:13,264 INFO L85 PathProgramCache]: Analyzing trace with hash -965955309, now seen corresponding path program 1 times [2025-02-08 08:38:13,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:13,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758000255] [2025-02-08 08:38:13,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:13,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:13,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 08:38:13,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 08:38:13,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:13,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:13,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:13,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758000255] [2025-02-08 08:38:13,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758000255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:13,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:13,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:38:13,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758860404] [2025-02-08 08:38:13,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:13,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:38:13,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:13,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:38:13,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:38:13,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 61 [2025-02-08 08:38:13,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:13,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:13,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 61 [2025-02-08 08:38:13,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:15,610 INFO L124 PetriNetUnfolderBase]: 24981/33967 cut-off events. [2025-02-08 08:38:15,611 INFO L125 PetriNetUnfolderBase]: For 2743/2743 co-relation queries the response was YES. [2025-02-08 08:38:15,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72786 conditions, 33967 events. 24981/33967 cut-off events. For 2743/2743 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 195762 event pairs, 17656 based on Foata normal form. 0/33399 useless extension candidates. Maximal degree in co-relation 41623. Up to 29158 conditions per place. [2025-02-08 08:38:15,746 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 73 selfloop transitions, 8 changer transitions 0/86 dead transitions. [2025-02-08 08:38:15,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 386 flow [2025-02-08 08:38:15,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:38:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:38:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-02-08 08:38:15,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5901639344262295 [2025-02-08 08:38:15,749 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 3 states and 108 transitions. [2025-02-08 08:38:15,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 386 flow [2025-02-08 08:38:15,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:38:15,759 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 196 flow [2025-02-08 08:38:15,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2025-02-08 08:38:15,760 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2025-02-08 08:38:15,760 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 196 flow [2025-02-08 08:38:15,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:38:15,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:15,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:15,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:38:15,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:38:15,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:15,761 INFO L85 PathProgramCache]: Analyzing trace with hash 931885773, now seen corresponding path program 1 times [2025-02-08 08:38:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:15,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270878035] [2025-02-08 08:38:15,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:15,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:15,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 08:38:15,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 08:38:15,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:15,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:16,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:16,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270878035] [2025-02-08 08:38:16,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270878035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:16,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:16,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:38:16,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576355653] [2025-02-08 08:38:16,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:16,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:38:16,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:16,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:38:16,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:38:16,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-02-08 08:38:16,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 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-02-08 08:38:16,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:16,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-02-08 08:38:16,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:18,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L45-1-->L46-3: Formula: (= v_~x~0_12 0) InVars {} OutVars{~x~0=v_~x~0_12} AuxVars[] AssignedVars[~x~0][76], [5#L56-3true, Black: 78#true, 8#L100-1true, 26#L66-3true, 80#(not (= ~x~0 1)), 28#thread4EXITtrue, 19#L46-3true, 87#(<= (+ 2 ~s~0) ~t~0), Black: 76#(= (mod ~b~0 256) 0)]) [2025-02-08 08:38:18,457 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-02-08 08:38:18,457 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 08:38:18,457 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 08:38:18,457 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 08:38:18,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L45-1-->L46-3: Formula: (= v_~x~0_12 0) InVars {} OutVars{~x~0=v_~x~0_12} AuxVars[] AssignedVars[~x~0][76], [5#L56-3true, Black: 78#true, 26#L66-3true, 80#(not (= ~x~0 1)), 28#thread4EXITtrue, 19#L46-3true, Black: 76#(= (mod ~b~0 256) 0), 87#(<= (+ 2 ~s~0) ~t~0), 54#L101true]) [2025-02-08 08:38:18,551 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-02-08 08:38:18,551 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-02-08 08:38:18,551 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-02-08 08:38:18,551 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-02-08 08:38:18,851 INFO L124 PetriNetUnfolderBase]: 29927/43072 cut-off events. [2025-02-08 08:38:18,852 INFO L125 PetriNetUnfolderBase]: For 14330/14354 co-relation queries the response was YES. [2025-02-08 08:38:18,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98746 conditions, 43072 events. 29927/43072 cut-off events. For 14330/14354 co-relation queries the response was YES. Maximal size of possible extension queue 1935. Compared 292355 event pairs, 4660 based on Foata normal form. 803/42486 useless extension candidates. Maximal degree in co-relation 54031. Up to 14120 conditions per place. [2025-02-08 08:38:19,088 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 163 selfloop transitions, 41 changer transitions 2/220 dead transitions. [2025-02-08 08:38:19,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 220 transitions, 1066 flow [2025-02-08 08:38:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:38:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:38:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 328 transitions. [2025-02-08 08:38:19,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5974499089253188 [2025-02-08 08:38:19,092 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 196 flow. Second operand 9 states and 328 transitions. [2025-02-08 08:38:19,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 220 transitions, 1066 flow [2025-02-08 08:38:19,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 220 transitions, 1026 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:19,255 INFO L231 Difference]: Finished difference. Result has 71 places, 97 transitions, 366 flow [2025-02-08 08:38:19,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=366, PETRI_PLACES=71, PETRI_TRANSITIONS=97} [2025-02-08 08:38:19,257 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2025-02-08 08:38:19,257 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 97 transitions, 366 flow [2025-02-08 08:38:19,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 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-02-08 08:38:19,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:19,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:19,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:38:19,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:38:19,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:19,260 INFO L85 PathProgramCache]: Analyzing trace with hash 9034073, now seen corresponding path program 2 times [2025-02-08 08:38:19,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:19,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728994998] [2025-02-08 08:38:19,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:38:19,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:19,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-02-08 08:38:19,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 08:38:19,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:38:19,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:19,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:19,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728994998] [2025-02-08 08:38:19,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728994998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:19,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:19,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:38:19,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134192951] [2025-02-08 08:38:19,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:19,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:19,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:19,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:38:19,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-02-08 08:38:19,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 97 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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-02-08 08:38:19,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:19,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-02-08 08:38:19,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:22,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L45-1-->L46-3: Formula: (= v_~x~0_12 0) InVars {} OutVars{~x~0=v_~x~0_12} AuxVars[] AssignedVars[~x~0][78], [5#L56-3true, Black: 78#true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 8#L100-1true, 26#L66-3true, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|)), 32#L76true, 102#(<= ~s~0 ~t~0), 19#L46-3true, 87#(<= (+ 2 ~s~0) ~t~0), Black: 76#(= (mod ~b~0 256) 0)]) [2025-02-08 08:38:22,006 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-02-08 08:38:22,006 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-02-08 08:38:22,006 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-02-08 08:38:22,006 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-02-08 08:38:22,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L45-1-->L46-3: Formula: (= v_~x~0_12 0) InVars {} OutVars{~x~0=v_~x~0_12} AuxVars[] AssignedVars[~x~0][78], [5#L56-3true, Black: 78#true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 26#L66-3true, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|)), 32#L76true, 102#(<= ~s~0 ~t~0), 19#L46-3true, 87#(<= (+ 2 ~s~0) ~t~0), 54#L101true, Black: 76#(= (mod ~b~0 256) 0)]) [2025-02-08 08:38:22,198 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-02-08 08:38:22,198 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 08:38:22,198 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 08:38:22,198 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 08:38:22,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L45-1-->L46-3: Formula: (= v_~x~0_12 0) InVars {} OutVars{~x~0=v_~x~0_12} AuxVars[] AssignedVars[~x~0][78], [5#L56-3true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 78#true, Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 8#L100-1true, 26#L66-3true, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|)), 28#thread4EXITtrue, 102#(<= ~s~0 ~t~0), 19#L46-3true, Black: 76#(= (mod ~b~0 256) 0), 87#(<= (+ 2 ~s~0) ~t~0)]) [2025-02-08 08:38:22,199 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-02-08 08:38:22,199 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 08:38:22,199 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 08:38:22,200 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-02-08 08:38:22,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L45-1-->L46-3: Formula: (= v_~x~0_12 0) InVars {} OutVars{~x~0=v_~x~0_12} AuxVars[] AssignedVars[~x~0][78], [5#L56-3true, Black: 78#true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), 26#L66-3true, Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|)), 28#thread4EXITtrue, 102#(<= ~s~0 ~t~0), 19#L46-3true, Black: 76#(= (mod ~b~0 256) 0), 87#(<= (+ 2 ~s~0) ~t~0), 54#L101true]) [2025-02-08 08:38:22,585 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-02-08 08:38:22,585 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-02-08 08:38:22,585 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-02-08 08:38:22,585 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-02-08 08:38:22,825 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([439] L66-3-->L66: Formula: (and (= |v_thread3Thread1of1ForFork2_#t~post6#1_1| v_~s~0_39) (= v_~s~0_38 (+ |v_thread3Thread1of1ForFork2_#t~post6#1_1| 1))) InVars {~s~0=v_~s~0_39} OutVars{thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_1|, ~s~0=v_~s~0_38} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post6#1, ~s~0][134], [5#L56-3true, Black: 78#true, 40#L76-3true, Black: 96#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), Black: 92#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0)), Black: 94#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork0_#t~post7#1|)), 12#L66true, 86#(<= (+ ~s~0 1) ~t~0), 46#L102true, 100#true, Black: 76#(= (mod ~b~0 256) 0)]) [2025-02-08 08:38:22,825 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-02-08 08:38:22,825 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-02-08 08:38:22,825 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-02-08 08:38:22,825 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-02-08 08:38:22,919 INFO L124 PetriNetUnfolderBase]: 46791/67818 cut-off events. [2025-02-08 08:38:22,919 INFO L125 PetriNetUnfolderBase]: For 39042/39151 co-relation queries the response was YES. [2025-02-08 08:38:23,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174708 conditions, 67818 events. 46791/67818 cut-off events. For 39042/39151 co-relation queries the response was YES. Maximal size of possible extension queue 2860. Compared 495896 event pairs, 10774 based on Foata normal form. 441/66095 useless extension candidates. Maximal degree in co-relation 98464. Up to 21807 conditions per place. [2025-02-08 08:38:23,295 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 140 selfloop transitions, 54 changer transitions 5/213 dead transitions. [2025-02-08 08:38:23,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 213 transitions, 1170 flow [2025-02-08 08:38:23,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:38:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:38:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2025-02-08 08:38:23,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6688524590163935 [2025-02-08 08:38:23,299 INFO L175 Difference]: Start difference. First operand has 71 places, 97 transitions, 366 flow. Second operand 5 states and 204 transitions. [2025-02-08 08:38:23,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 213 transitions, 1170 flow [2025-02-08 08:38:23,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 213 transitions, 1163 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:38:23,470 INFO L231 Difference]: Finished difference. Result has 77 places, 133 transitions, 751 flow [2025-02-08 08:38:23,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=77, PETRI_TRANSITIONS=133} [2025-02-08 08:38:23,471 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2025-02-08 08:38:23,471 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 133 transitions, 751 flow [2025-02-08 08:38:23,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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-02-08 08:38:23,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:23,472 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:23,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:38:23,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:38:23,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:23,473 INFO L85 PathProgramCache]: Analyzing trace with hash 980240273, now seen corresponding path program 1 times [2025-02-08 08:38:23,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:23,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792182119] [2025-02-08 08:38:23,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:38:23,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:23,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 08:38:23,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 08:38:23,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:23,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:23,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:23,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792182119] [2025-02-08 08:38:23,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792182119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:23,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:23,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:38:23,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095990145] [2025-02-08 08:38:23,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:23,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:23,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:23,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:23,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:38:23,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-02-08 08:38:23,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 133 transitions, 751 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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-02-08 08:38:23,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:23,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-02-08 08:38:23,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:27,360 INFO L124 PetriNetUnfolderBase]: 44046/64074 cut-off events. [2025-02-08 08:38:27,360 INFO L125 PetriNetUnfolderBase]: For 88793/88985 co-relation queries the response was YES. [2025-02-08 08:38:27,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196514 conditions, 64074 events. 44046/64074 cut-off events. For 88793/88985 co-relation queries the response was YES. Maximal size of possible extension queue 2714. Compared 469078 event pairs, 10508 based on Foata normal form. 724/62826 useless extension candidates. Maximal degree in co-relation 111054. Up to 21554 conditions per place. [2025-02-08 08:38:27,652 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 143 selfloop transitions, 66 changer transitions 1/224 dead transitions. [2025-02-08 08:38:27,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 224 transitions, 1559 flow [2025-02-08 08:38:27,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:38:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:38:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 203 transitions. [2025-02-08 08:38:27,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6655737704918033 [2025-02-08 08:38:27,653 INFO L175 Difference]: Start difference. First operand has 77 places, 133 transitions, 751 flow. Second operand 5 states and 203 transitions. [2025-02-08 08:38:27,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 224 transitions, 1559 flow [2025-02-08 08:38:27,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 224 transitions, 1544 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-02-08 08:38:27,951 INFO L231 Difference]: Finished difference. Result has 82 places, 145 transitions, 1035 flow [2025-02-08 08:38:27,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1035, PETRI_PLACES=82, PETRI_TRANSITIONS=145} [2025-02-08 08:38:27,953 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places. [2025-02-08 08:38:27,953 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 145 transitions, 1035 flow [2025-02-08 08:38:27,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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-02-08 08:38:27,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:27,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:27,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:38:27,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:38:27,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:27,954 INFO L85 PathProgramCache]: Analyzing trace with hash 861717403, now seen corresponding path program 3 times [2025-02-08 08:38:27,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:27,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864784557] [2025-02-08 08:38:27,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:38:27,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:27,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-02-08 08:38:27,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 08:38:27,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:38:27,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:28,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:28,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864784557] [2025-02-08 08:38:28,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864784557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:28,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:28,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:38:28,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915212279] [2025-02-08 08:38:28,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:28,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:38:28,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:28,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:38:28,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:38:28,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-02-08 08:38:28,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 145 transitions, 1035 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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-02-08 08:38:28,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:28,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-02-08 08:38:28,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:32,736 INFO L124 PetriNetUnfolderBase]: 48010/70230 cut-off events. [2025-02-08 08:38:32,736 INFO L125 PetriNetUnfolderBase]: For 133910/134155 co-relation queries the response was YES. [2025-02-08 08:38:32,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230830 conditions, 70230 events. 48010/70230 cut-off events. For 133910/134155 co-relation queries the response was YES. Maximal size of possible extension queue 3092. Compared 527943 event pairs, 9298 based on Foata normal form. 714/68775 useless extension candidates. Maximal degree in co-relation 133803. Up to 27351 conditions per place. [2025-02-08 08:38:33,068 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 151 selfloop transitions, 104 changer transitions 5/274 dead transitions. [2025-02-08 08:38:33,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 274 transitions, 2122 flow [2025-02-08 08:38:33,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:38:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:38:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 247 transitions. [2025-02-08 08:38:33,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.674863387978142 [2025-02-08 08:38:33,070 INFO L175 Difference]: Start difference. First operand has 82 places, 145 transitions, 1035 flow. Second operand 6 states and 247 transitions. [2025-02-08 08:38:33,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 274 transitions, 2122 flow [2025-02-08 08:38:33,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 274 transitions, 2038 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:33,286 INFO L231 Difference]: Finished difference. Result has 87 places, 173 transitions, 1462 flow [2025-02-08 08:38:33,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1462, PETRI_PLACES=87, PETRI_TRANSITIONS=173} [2025-02-08 08:38:33,286 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 21 predicate places. [2025-02-08 08:38:33,287 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 173 transitions, 1462 flow [2025-02-08 08:38:33,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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-02-08 08:38:33,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:33,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:33,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:38:33,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:38:33,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:33,288 INFO L85 PathProgramCache]: Analyzing trace with hash -580137791, now seen corresponding path program 4 times [2025-02-08 08:38:33,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:33,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913256433] [2025-02-08 08:38:33,288 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:38:33,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:33,297 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-02-08 08:38:33,309 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 08:38:33,309 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:38:33,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:33,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:33,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913256433] [2025-02-08 08:38:33,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913256433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:33,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:33,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:38:33,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108349759] [2025-02-08 08:38:33,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:33,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:33,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:33,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:33,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:38:33,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-02-08 08:38:33,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 173 transitions, 1462 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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-02-08 08:38:33,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:33,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-02-08 08:38:33,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:38,018 INFO L124 PetriNetUnfolderBase]: 45566/67909 cut-off events. [2025-02-08 08:38:38,018 INFO L125 PetriNetUnfolderBase]: For 189100/189249 co-relation queries the response was YES. [2025-02-08 08:38:38,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233036 conditions, 67909 events. 45566/67909 cut-off events. For 189100/189249 co-relation queries the response was YES. Maximal size of possible extension queue 3061. Compared 523619 event pairs, 11850 based on Foata normal form. 730/66868 useless extension candidates. Maximal degree in co-relation 137290. Up to 27639 conditions per place. [2025-02-08 08:38:38,593 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 159 selfloop transitions, 85 changer transitions 10/268 dead transitions. [2025-02-08 08:38:38,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 268 transitions, 2481 flow [2025-02-08 08:38:38,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:38:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:38:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2025-02-08 08:38:38,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2025-02-08 08:38:38,594 INFO L175 Difference]: Start difference. First operand has 87 places, 173 transitions, 1462 flow. Second operand 5 states and 205 transitions. [2025-02-08 08:38:38,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 268 transitions, 2481 flow [2025-02-08 08:38:38,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 268 transitions, 2413 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:38,946 INFO L231 Difference]: Finished difference. Result has 91 places, 185 transitions, 1807 flow [2025-02-08 08:38:38,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1807, PETRI_PLACES=91, PETRI_TRANSITIONS=185} [2025-02-08 08:38:38,947 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 25 predicate places. [2025-02-08 08:38:38,947 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 185 transitions, 1807 flow [2025-02-08 08:38:38,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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-02-08 08:38:38,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:38,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:38,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:38:38,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:38:38,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1397068557, now seen corresponding path program 5 times [2025-02-08 08:38:38,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:38,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760322394] [2025-02-08 08:38:38,949 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:38:38,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:38,967 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-02-08 08:38:38,976 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 08:38:38,976 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:38:38,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:39,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:39,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760322394] [2025-02-08 08:38:39,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760322394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:39,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:39,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:38:39,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297840382] [2025-02-08 08:38:39,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:39,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:38:39,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:39,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:38:39,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:38:39,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-02-08 08:38:39,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 185 transitions, 1807 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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-02-08 08:38:39,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:39,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-02-08 08:38:39,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:42,352 INFO L124 PetriNetUnfolderBase]: 30951/46047 cut-off events. [2025-02-08 08:38:42,352 INFO L125 PetriNetUnfolderBase]: For 148335/148435 co-relation queries the response was YES. [2025-02-08 08:38:42,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163249 conditions, 46047 events. 30951/46047 cut-off events. For 148335/148435 co-relation queries the response was YES. Maximal size of possible extension queue 2045. Compared 333742 event pairs, 8633 based on Foata normal form. 388/45342 useless extension candidates. Maximal degree in co-relation 111960. Up to 22618 conditions per place. [2025-02-08 08:38:42,567 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 145 selfloop transitions, 89 changer transitions 7/255 dead transitions. [2025-02-08 08:38:42,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 255 transitions, 2603 flow [2025-02-08 08:38:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:38:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:38:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2025-02-08 08:38:42,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6491803278688525 [2025-02-08 08:38:42,568 INFO L175 Difference]: Start difference. First operand has 91 places, 185 transitions, 1807 flow. Second operand 5 states and 198 transitions. [2025-02-08 08:38:42,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 255 transitions, 2603 flow [2025-02-08 08:38:42,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 255 transitions, 2502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:42,731 INFO L231 Difference]: Finished difference. Result has 95 places, 187 transitions, 2003 flow [2025-02-08 08:38:42,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2003, PETRI_PLACES=95, PETRI_TRANSITIONS=187} [2025-02-08 08:38:42,731 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 29 predicate places. [2025-02-08 08:38:42,731 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 187 transitions, 2003 flow [2025-02-08 08:38:42,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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-02-08 08:38:42,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:42,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:42,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:38:42,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:38:42,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:42,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2081985185, now seen corresponding path program 6 times [2025-02-08 08:38:42,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:42,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971398412] [2025-02-08 08:38:42,733 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:38:42,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:42,742 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 1 equivalence classes. [2025-02-08 08:38:42,748 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 08:38:42,748 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 08:38:42,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:42,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:42,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971398412] [2025-02-08 08:38:42,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971398412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:42,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:42,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:38:42,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296355664] [2025-02-08 08:38:42,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:42,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:38:42,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:42,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:38:42,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:38:42,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-02-08 08:38:42,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 187 transitions, 2003 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 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-02-08 08:38:42,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:42,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-02-08 08:38:42,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:46,684 INFO L124 PetriNetUnfolderBase]: 31537/46697 cut-off events. [2025-02-08 08:38:46,684 INFO L125 PetriNetUnfolderBase]: For 173624/173860 co-relation queries the response was YES. [2025-02-08 08:38:46,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172255 conditions, 46697 events. 31537/46697 cut-off events. For 173624/173860 co-relation queries the response was YES. Maximal size of possible extension queue 2133. Compared 338039 event pairs, 7234 based on Foata normal form. 465/45837 useless extension candidates. Maximal degree in co-relation 118861. Up to 16741 conditions per place. [2025-02-08 08:38:46,920 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 169 selfloop transitions, 127 changer transitions 5/315 dead transitions. [2025-02-08 08:38:46,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 315 transitions, 3175 flow [2025-02-08 08:38:46,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:38:46,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:38:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 312 transitions. [2025-02-08 08:38:46,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.639344262295082 [2025-02-08 08:38:46,921 INFO L175 Difference]: Start difference. First operand has 95 places, 187 transitions, 2003 flow. Second operand 8 states and 312 transitions. [2025-02-08 08:38:46,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 315 transitions, 3175 flow [2025-02-08 08:38:47,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 315 transitions, 3064 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:38:47,071 INFO L231 Difference]: Finished difference. Result has 102 places, 196 transitions, 2333 flow [2025-02-08 08:38:47,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1904, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2333, PETRI_PLACES=102, PETRI_TRANSITIONS=196} [2025-02-08 08:38:47,072 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 36 predicate places. [2025-02-08 08:38:47,072 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 196 transitions, 2333 flow [2025-02-08 08:38:47,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 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-02-08 08:38:47,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:47,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:47,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:38:47,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:38:47,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:47,074 INFO L85 PathProgramCache]: Analyzing trace with hash 337432391, now seen corresponding path program 2 times [2025-02-08 08:38:47,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:47,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858788656] [2025-02-08 08:38:47,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:38:47,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:47,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-02-08 08:38:47,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 08:38:47,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:38:47,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:47,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:47,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:47,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858788656] [2025-02-08 08:38:47,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858788656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:47,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:47,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:38:47,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148298383] [2025-02-08 08:38:47,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:47,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:38:47,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:47,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:38:47,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:38:47,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-02-08 08:38:47,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 196 transitions, 2333 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 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-02-08 08:38:47,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:47,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-02-08 08:38:47,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:51,081 INFO L124 PetriNetUnfolderBase]: 30196/45199 cut-off events. [2025-02-08 08:38:51,081 INFO L125 PetriNetUnfolderBase]: For 204082/204242 co-relation queries the response was YES. [2025-02-08 08:38:51,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173317 conditions, 45199 events. 30196/45199 cut-off events. For 204082/204242 co-relation queries the response was YES. Maximal size of possible extension queue 2016. Compared 331324 event pairs, 7000 based on Foata normal form. 851/44841 useless extension candidates. Maximal degree in co-relation 122186. Up to 16554 conditions per place. [2025-02-08 08:38:51,318 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 171 selfloop transitions, 139 changer transitions 30/354 dead transitions. [2025-02-08 08:38:51,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 354 transitions, 4012 flow [2025-02-08 08:38:51,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:38:51,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:38:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 318 transitions. [2025-02-08 08:38:51,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6516393442622951 [2025-02-08 08:38:51,320 INFO L175 Difference]: Start difference. First operand has 102 places, 196 transitions, 2333 flow. Second operand 8 states and 318 transitions. [2025-02-08 08:38:51,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 354 transitions, 4012 flow [2025-02-08 08:38:51,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 354 transitions, 3789 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-02-08 08:38:51,486 INFO L231 Difference]: Finished difference. Result has 107 places, 207 transitions, 2653 flow [2025-02-08 08:38:51,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2653, PETRI_PLACES=107, PETRI_TRANSITIONS=207} [2025-02-08 08:38:51,487 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 41 predicate places. [2025-02-08 08:38:51,487 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 207 transitions, 2653 flow [2025-02-08 08:38:51,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 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-02-08 08:38:51,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:51,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:51,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:38:51,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:38:51,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:51,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2017960987, now seen corresponding path program 7 times [2025-02-08 08:38:51,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:51,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727986735] [2025-02-08 08:38:51,488 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 08:38:51,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:51,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 08:38:51,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 08:38:51,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:38:51,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:51,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:51,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727986735] [2025-02-08 08:38:51,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727986735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:51,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:51,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:38:51,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027651477] [2025-02-08 08:38:51,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:51,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:38:51,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:51,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:38:51,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:38:51,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-02-08 08:38:51,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 207 transitions, 2653 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 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-02-08 08:38:51,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:51,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-02-08 08:38:51,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:53,888 INFO L124 PetriNetUnfolderBase]: 18675/28780 cut-off events. [2025-02-08 08:38:53,889 INFO L125 PetriNetUnfolderBase]: For 122189/122293 co-relation queries the response was YES. [2025-02-08 08:38:53,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108550 conditions, 28780 events. 18675/28780 cut-off events. For 122189/122293 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 205849 event pairs, 4831 based on Foata normal form. 552/28836 useless extension candidates. Maximal degree in co-relation 83322. Up to 10166 conditions per place. [2025-02-08 08:38:54,015 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 140 selfloop transitions, 136 changer transitions 39/329 dead transitions. [2025-02-08 08:38:54,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 329 transitions, 4070 flow [2025-02-08 08:38:54,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:38:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:38:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 300 transitions. [2025-02-08 08:38:54,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6147540983606558 [2025-02-08 08:38:54,017 INFO L175 Difference]: Start difference. First operand has 107 places, 207 transitions, 2653 flow. Second operand 8 states and 300 transitions. [2025-02-08 08:38:54,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 329 transitions, 4070 flow [2025-02-08 08:38:54,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 329 transitions, 3923 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:38:54,107 INFO L231 Difference]: Finished difference. Result has 113 places, 200 transitions, 2742 flow [2025-02-08 08:38:54,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2742, PETRI_PLACES=113, PETRI_TRANSITIONS=200} [2025-02-08 08:38:54,108 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 47 predicate places. [2025-02-08 08:38:54,108 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 200 transitions, 2742 flow [2025-02-08 08:38:54,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 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-02-08 08:38:54,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:54,108 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:54,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:38:54,108 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:38:54,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:54,109 INFO L85 PathProgramCache]: Analyzing trace with hash 234970809, now seen corresponding path program 8 times [2025-02-08 08:38:54,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:54,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487509481] [2025-02-08 08:38:54,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:38:54,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:54,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-02-08 08:38:54,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 08:38:54,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:38:54,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:54,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:54,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487509481] [2025-02-08 08:38:54,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487509481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:54,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:54,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:38:54,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831327369] [2025-02-08 08:38:54,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:54,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:38:54,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:54,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:38:54,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:38:54,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-02-08 08:38:54,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 200 transitions, 2742 flow. Second operand has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 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-02-08 08:38:54,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:54,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-02-08 08:38:54,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:56,678 INFO L124 PetriNetUnfolderBase]: 17162/26367 cut-off events. [2025-02-08 08:38:56,678 INFO L125 PetriNetUnfolderBase]: For 130977/130989 co-relation queries the response was YES. [2025-02-08 08:38:56,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100041 conditions, 26367 events. 17162/26367 cut-off events. For 130977/130989 co-relation queries the response was YES. Maximal size of possible extension queue 1146. Compared 186505 event pairs, 4244 based on Foata normal form. 120/25930 useless extension candidates. Maximal degree in co-relation 75112. Up to 9914 conditions per place. [2025-02-08 08:38:56,840 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 127 selfloop transitions, 136 changer transitions 34/311 dead transitions. [2025-02-08 08:38:56,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 311 transitions, 3927 flow [2025-02-08 08:38:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:38:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:38:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 314 transitions. [2025-02-08 08:38:56,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5719489981785064 [2025-02-08 08:38:56,842 INFO L175 Difference]: Start difference. First operand has 113 places, 200 transitions, 2742 flow. Second operand 9 states and 314 transitions. [2025-02-08 08:38:56,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 311 transitions, 3927 flow [2025-02-08 08:38:56,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 311 transitions, 3797 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:38:56,996 INFO L231 Difference]: Finished difference. Result has 119 places, 189 transitions, 2696 flow [2025-02-08 08:38:56,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2623, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2696, PETRI_PLACES=119, PETRI_TRANSITIONS=189} [2025-02-08 08:38:56,999 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 53 predicate places. [2025-02-08 08:38:57,000 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 189 transitions, 2696 flow [2025-02-08 08:38:57,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 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-02-08 08:38:57,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:57,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:57,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:38:57,001 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:38:57,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:57,001 INFO L85 PathProgramCache]: Analyzing trace with hash -93760873, now seen corresponding path program 9 times [2025-02-08 08:38:57,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:57,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427746931] [2025-02-08 08:38:57,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:38:57,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:57,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-02-08 08:38:57,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 08:38:57,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:38:57,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:57,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:57,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427746931] [2025-02-08 08:38:57,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427746931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:57,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:57,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:38:57,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363231488] [2025-02-08 08:38:57,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:57,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:38:57,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:57,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:38:57,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:38:57,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-02-08 08:38:57,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 189 transitions, 2696 flow. Second operand has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 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-02-08 08:38:57,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:57,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-02-08 08:38:57,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:38:59,197 INFO L124 PetriNetUnfolderBase]: 16476/25318 cut-off events. [2025-02-08 08:38:59,198 INFO L125 PetriNetUnfolderBase]: For 142820/142820 co-relation queries the response was YES. [2025-02-08 08:38:59,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97743 conditions, 25318 events. 16476/25318 cut-off events. For 142820/142820 co-relation queries the response was YES. Maximal size of possible extension queue 1152. Compared 178320 event pairs, 4303 based on Foata normal form. 308/25079 useless extension candidates. Maximal degree in co-relation 72816. Up to 9572 conditions per place. [2025-02-08 08:38:59,344 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 150 selfloop transitions, 134 changer transitions 28/326 dead transitions. [2025-02-08 08:38:59,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 326 transitions, 3957 flow [2025-02-08 08:38:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:38:59,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 08:38:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 398 transitions. [2025-02-08 08:38:59,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5437158469945356 [2025-02-08 08:38:59,346 INFO L175 Difference]: Start difference. First operand has 119 places, 189 transitions, 2696 flow. Second operand 12 states and 398 transitions. [2025-02-08 08:38:59,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 326 transitions, 3957 flow [2025-02-08 08:38:59,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 326 transitions, 3775 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-02-08 08:38:59,464 INFO L231 Difference]: Finished difference. Result has 127 places, 188 transitions, 2738 flow [2025-02-08 08:38:59,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2540, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2738, PETRI_PLACES=127, PETRI_TRANSITIONS=188} [2025-02-08 08:38:59,464 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 61 predicate places. [2025-02-08 08:38:59,464 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 188 transitions, 2738 flow [2025-02-08 08:38:59,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 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-02-08 08:38:59,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:38:59,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:38:59,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:38:59,465 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 08:38:59,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:38:59,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1148331077, now seen corresponding path program 10 times [2025-02-08 08:38:59,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:38:59,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820145651] [2025-02-08 08:38:59,465 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:38:59,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:38:59,472 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-02-08 08:38:59,478 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 08:38:59,478 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:38:59,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:38:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:38:59,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:38:59,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820145651] [2025-02-08 08:38:59,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820145651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:38:59,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:38:59,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:38:59,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865935891] [2025-02-08 08:38:59,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:38:59,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:38:59,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:38:59,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:38:59,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:38:59,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-02-08 08:38:59,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 188 transitions, 2738 flow. Second operand has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 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-02-08 08:38:59,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:38:59,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-02-08 08:38:59,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand