./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 981eae178b9cad0bb64b87dda8360f4f1e2e23d7b9d396f9db2ad5a6977098c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:11:27,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:11:27,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:11:27,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:11:27,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:11:27,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:11:27,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:11:27,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:11:27,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:11:27,324 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:11:27,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:11:27,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:11:27,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:11:27,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:11:27,325 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:11:27,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:11:27,325 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:11:27,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:11:27,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:11:27,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:11:27,326 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:11:27,326 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:11:27,326 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:11:27,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:11:27,326 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:11:27,326 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:11:27,326 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:11:27,326 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:11:27,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:11:27,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:11:27,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:11:27,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:11:27,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:11:27,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:11:27,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:11:27,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:11:27,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:11:27,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:11:27,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:11:27,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:11:27,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:11:27,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:11:27,328 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/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 -> 981eae178b9cad0bb64b87dda8360f4f1e2e23d7b9d396f9db2ad5a6977098c4 [2025-03-04 10:11:27,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:11:27,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:11:27,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:11:27,576 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:11:27,577 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:11:27,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2025-03-04 10:11:28,686 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b426b23d/35d37f59ac67431d9a145b2f9f5a9ebe/FLAGa6f828529 [2025-03-04 10:11:28,877 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:11:28,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2025-03-04 10:11:28,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b426b23d/35d37f59ac67431d9a145b2f9f5a9ebe/FLAGa6f828529 [2025-03-04 10:11:29,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b426b23d/35d37f59ac67431d9a145b2f9f5a9ebe [2025-03-04 10:11:29,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:11:29,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:11:29,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:11:29,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:11:29,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:11:29,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:11:29" (1/1) ... [2025-03-04 10:11:29,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486eb593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29, skipping insertion in model container [2025-03-04 10:11:29,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:11:29" (1/1) ... [2025-03-04 10:11:29,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:11:29,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:11:29,414 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:11:29,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:11:29,445 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:11:29,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29 WrapperNode [2025-03-04 10:11:29,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:11:29,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:11:29,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:11:29,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:11:29,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29" (1/1) ... [2025-03-04 10:11:29,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29" (1/1) ... [2025-03-04 10:11:29,471 INFO L138 Inliner]: procedures = 20, calls = 14, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 90 [2025-03-04 10:11:29,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:11:29,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:11:29,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:11:29,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:11:29,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29" (1/1) ... [2025-03-04 10:11:29,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29" (1/1) ... [2025-03-04 10:11:29,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29" (1/1) ... [2025-03-04 10:11:29,495 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-03-04 10:11:29,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29" (1/1) ... [2025-03-04 10:11:29,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29" (1/1) ... [2025-03-04 10:11:29,498 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29" (1/1) ... [2025-03-04 10:11:29,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29" (1/1) ... [2025-03-04 10:11:29,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29" (1/1) ... [2025-03-04 10:11:29,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29" (1/1) ... [2025-03-04 10:11:29,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:11:29,508 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:11:29,508 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:11:29,508 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:11:29,509 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29" (1/1) ... [2025-03-04 10:11:29,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:11:29,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:29,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:11:29,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:11:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:11:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:11:29,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:11:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:11:29,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:11:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:11:29,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:11:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 10:11:29,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 10:11:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:11:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:11:29,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:11:29,558 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:11:29,624 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:11:29,626 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:11:29,801 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:11:29,801 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:11:29,905 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:11:29,905 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:11:29,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:11:29 BoogieIcfgContainer [2025-03-04 10:11:29,905 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:11:29,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:11:29,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:11:29,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:11:29,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:11:29" (1/3) ... [2025-03-04 10:11:29,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e242437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:11:29, skipping insertion in model container [2025-03-04 10:11:29,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:29" (2/3) ... [2025-03-04 10:11:29,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e242437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:11:29, skipping insertion in model container [2025-03-04 10:11:29,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:11:29" (3/3) ... [2025-03-04 10:11:29,917 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2025-03-04 10:11:29,927 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:11:29,928 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-counter-determinism.wvr.c that has 5 procedures, 39 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-03-04 10:11:29,929 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:11:29,982 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 10:11:30,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 112 flow [2025-03-04 10:11:30,038 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-03-04 10:11:30,040 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:11:30,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 38 events. 4/38 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-03-04 10:11:30,044 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 112 flow [2025-03-04 10:11:30,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 98 flow [2025-03-04 10:11:30,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:11:30,065 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;@764ffbeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:11:30,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:11:30,077 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:11:30,077 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2025-03-04 10:11:30,077 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:11:30,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:30,078 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] [2025-03-04 10:11:30,078 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-03-04 10:11:30,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash 38495472, now seen corresponding path program 1 times [2025-03-04 10:11:30,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:30,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953550633] [2025-03-04 10:11:30,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:30,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:30,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:11:30,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:11:30,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:30,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:30,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:30,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953550633] [2025-03-04 10:11:30,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953550633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:30,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:30,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:11:30,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150029307] [2025-03-04 10:11:30,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:30,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:30,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:30,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:30,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:30,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 10:11:30,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-03-04 10:11:30,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:30,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 10:11:30,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:30,997 INFO L124 PetriNetUnfolderBase]: 5145/6904 cut-off events. [2025-03-04 10:11:30,998 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2025-03-04 10:11:31,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14135 conditions, 6904 events. 5145/6904 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 30829 event pairs, 1020 based on Foata normal form. 2/6292 useless extension candidates. Maximal degree in co-relation 12513. Up to 5288 conditions per place. [2025-03-04 10:11:31,037 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 51 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2025-03-04 10:11:31,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 279 flow [2025-03-04 10:11:31,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-04 10:11:31,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2025-03-04 10:11:31,047 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 98 flow. Second operand 3 states and 83 transitions. [2025-03-04 10:11:31,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 279 flow [2025-03-04 10:11:31,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 60 transitions, 249 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 10:11:31,065 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 111 flow [2025-03-04 10:11:31,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2025-03-04 10:11:31,071 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2025-03-04 10:11:31,072 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 111 flow [2025-03-04 10:11:31,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-03-04 10:11:31,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:31,072 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] [2025-03-04 10:11:31,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:11:31,073 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-03-04 10:11:31,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:31,075 INFO L85 PathProgramCache]: Analyzing trace with hash -775783981, now seen corresponding path program 1 times [2025-03-04 10:11:31,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:31,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091494607] [2025-03-04 10:11:31,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:31,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:11:31,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:31,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:31,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:31,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:31,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091494607] [2025-03-04 10:11:31,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091494607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:31,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:31,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:31,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449405391] [2025-03-04 10:11:31,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:31,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:31,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:31,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:31,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:31,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 10:11:31,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-03-04 10:11:31,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:31,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 10:11:31,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:32,149 INFO L124 PetriNetUnfolderBase]: 11897/15433 cut-off events. [2025-03-04 10:11:32,150 INFO L125 PetriNetUnfolderBase]: For 1960/1997 co-relation queries the response was YES. [2025-03-04 10:11:32,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35104 conditions, 15433 events. 11897/15433 cut-off events. For 1960/1997 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 73422 event pairs, 3629 based on Foata normal form. 2/13224 useless extension candidates. Maximal degree in co-relation 5584. Up to 7867 conditions per place. [2025-03-04 10:11:32,223 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 101 selfloop transitions, 10 changer transitions 0/113 dead transitions. [2025-03-04 10:11:32,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 113 transitions, 540 flow [2025-03-04 10:11:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-04 10:11:32,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-03-04 10:11:32,225 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 111 flow. Second operand 5 states and 133 transitions. [2025-03-04 10:11:32,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 113 transitions, 540 flow [2025-03-04 10:11:32,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 113 transitions, 525 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:32,228 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 169 flow [2025-03-04 10:11:32,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2025-03-04 10:11:32,229 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2025-03-04 10:11:32,229 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 169 flow [2025-03-04 10:11:32,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-03-04 10:11:32,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:32,229 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] [2025-03-04 10:11:32,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:11:32,229 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-03-04 10:11:32,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:32,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1782274233, now seen corresponding path program 2 times [2025-03-04 10:11:32,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:32,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437238622] [2025-03-04 10:11:32,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:32,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:32,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:11:32,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:32,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:32,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:32,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:32,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437238622] [2025-03-04 10:11:32,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437238622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:32,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212328080] [2025-03-04 10:11:32,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:32,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:32,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:32,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:32,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:11:32,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:11:32,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:32,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:32,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:32,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:11:32,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:32,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:32,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212328080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:32,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:32,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-04 10:11:32,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067437884] [2025-03-04 10:11:32,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:32,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:11:32,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:32,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:11:32,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:11:32,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 10:11:32,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 169 flow. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-03-04 10:11:32,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:32,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 10:11:32,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:33,909 INFO L124 PetriNetUnfolderBase]: 16200/21085 cut-off events. [2025-03-04 10:11:33,910 INFO L125 PetriNetUnfolderBase]: For 7124/7124 co-relation queries the response was YES. [2025-03-04 10:11:33,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54801 conditions, 21085 events. 16200/21085 cut-off events. For 7124/7124 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 106381 event pairs, 1341 based on Foata normal form. 346/20599 useless extension candidates. Maximal degree in co-relation 27430. Up to 4494 conditions per place. [2025-03-04 10:11:34,003 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 260 selfloop transitions, 36 changer transitions 0/298 dead transitions. [2025-03-04 10:11:34,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 298 transitions, 1478 flow [2025-03-04 10:11:34,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:11:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:11:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 366 transitions. [2025-03-04 10:11:34,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6224489795918368 [2025-03-04 10:11:34,007 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 169 flow. Second operand 14 states and 366 transitions. [2025-03-04 10:11:34,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 298 transitions, 1478 flow [2025-03-04 10:11:34,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 298 transitions, 1478 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:11:34,021 INFO L231 Difference]: Finished difference. Result has 64 places, 76 transitions, 405 flow [2025-03-04 10:11:34,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=405, PETRI_PLACES=64, PETRI_TRANSITIONS=76} [2025-03-04 10:11:34,022 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2025-03-04 10:11:34,023 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 76 transitions, 405 flow [2025-03-04 10:11:34,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-03-04 10:11:34,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:34,023 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] [2025-03-04 10:11:34,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:11:34,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:34,228 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-03-04 10:11:34,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:34,229 INFO L85 PathProgramCache]: Analyzing trace with hash -493380627, now seen corresponding path program 3 times [2025-03-04 10:11:34,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:34,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715467220] [2025-03-04 10:11:34,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:34,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:34,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:11:34,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:34,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:34,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:34,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:34,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715467220] [2025-03-04 10:11:34,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715467220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:34,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:34,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:34,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292300203] [2025-03-04 10:11:34,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:34,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:34,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:34,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:34,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:34,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 10:11:34,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 76 transitions, 405 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-03-04 10:11:34,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:34,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 10:11:34,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:35,698 INFO L124 PetriNetUnfolderBase]: 22784/29853 cut-off events. [2025-03-04 10:11:35,699 INFO L125 PetriNetUnfolderBase]: For 36227/36227 co-relation queries the response was YES. [2025-03-04 10:11:35,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91261 conditions, 29853 events. 22784/29853 cut-off events. For 36227/36227 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 154912 event pairs, 6160 based on Foata normal form. 76/28749 useless extension candidates. Maximal degree in co-relation 82690. Up to 14037 conditions per place. [2025-03-04 10:11:35,885 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 145 selfloop transitions, 19 changer transitions 0/166 dead transitions. [2025-03-04 10:11:35,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 166 transitions, 1106 flow [2025-03-04 10:11:35,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:35,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2025-03-04 10:11:35,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-04 10:11:35,887 INFO L175 Difference]: Start difference. First operand has 64 places, 76 transitions, 405 flow. Second operand 5 states and 132 transitions. [2025-03-04 10:11:35,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 166 transitions, 1106 flow [2025-03-04 10:11:36,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 166 transitions, 1059 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:36,241 INFO L231 Difference]: Finished difference. Result has 70 places, 84 transitions, 504 flow [2025-03-04 10:11:36,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=504, PETRI_PLACES=70, PETRI_TRANSITIONS=84} [2025-03-04 10:11:36,242 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2025-03-04 10:11:36,242 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 84 transitions, 504 flow [2025-03-04 10:11:36,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-03-04 10:11:36,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:36,242 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] [2025-03-04 10:11:36,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:11:36,243 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-03-04 10:11:36,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:36,243 INFO L85 PathProgramCache]: Analyzing trace with hash 61485161, now seen corresponding path program 1 times [2025-03-04 10:11:36,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:36,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033129140] [2025-03-04 10:11:36,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:36,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:36,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:11:36,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:36,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:36,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:36,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:36,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033129140] [2025-03-04 10:11:36,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033129140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:36,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:36,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:36,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126971568] [2025-03-04 10:11:36,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:36,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:36,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:36,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:36,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:36,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 10:11:36,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 84 transitions, 504 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-03-04 10:11:36,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:36,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 10:11:36,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:37,924 INFO L124 PetriNetUnfolderBase]: 25215/33211 cut-off events. [2025-03-04 10:11:37,925 INFO L125 PetriNetUnfolderBase]: For 51132/51274 co-relation queries the response was YES. [2025-03-04 10:11:38,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104163 conditions, 33211 events. 25215/33211 cut-off events. For 51132/51274 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 177108 event pairs, 7139 based on Foata normal form. 0/30400 useless extension candidates. Maximal degree in co-relation 92606. Up to 14514 conditions per place. [2025-03-04 10:11:38,318 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 139 selfloop transitions, 17 changer transitions 0/160 dead transitions. [2025-03-04 10:11:38,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 160 transitions, 1103 flow [2025-03-04 10:11:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-03-04 10:11:38,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523809523809524 [2025-03-04 10:11:38,322 INFO L175 Difference]: Start difference. First operand has 70 places, 84 transitions, 504 flow. Second operand 5 states and 137 transitions. [2025-03-04 10:11:38,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 160 transitions, 1103 flow [2025-03-04 10:11:38,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 160 transitions, 1056 flow, removed 14 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:38,621 INFO L231 Difference]: Finished difference. Result has 75 places, 86 transitions, 533 flow [2025-03-04 10:11:38,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=533, PETRI_PLACES=75, PETRI_TRANSITIONS=86} [2025-03-04 10:11:38,622 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2025-03-04 10:11:38,622 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 86 transitions, 533 flow [2025-03-04 10:11:38,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-03-04 10:11:38,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:38,623 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] [2025-03-04 10:11:38,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:11:38,623 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-03-04 10:11:38,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:38,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1975266725, now seen corresponding path program 1 times [2025-03-04 10:11:38,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:38,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222092424] [2025-03-04 10:11:38,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:38,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:38,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:11:38,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:38,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:38,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:38,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:38,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222092424] [2025-03-04 10:11:38,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222092424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:38,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:38,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:11:38,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433152206] [2025-03-04 10:11:38,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:38,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:38,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:38,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:38,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:38,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 10:11:38,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 86 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-03-04 10:11:38,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:38,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 10:11:38,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:39,580 INFO L124 PetriNetUnfolderBase]: 13368/17935 cut-off events. [2025-03-04 10:11:39,580 INFO L125 PetriNetUnfolderBase]: For 38584/39680 co-relation queries the response was YES. [2025-03-04 10:11:39,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59055 conditions, 17935 events. 13368/17935 cut-off events. For 38584/39680 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 92486 event pairs, 4232 based on Foata normal form. 597/17723 useless extension candidates. Maximal degree in co-relation 48933. Up to 12915 conditions per place. [2025-03-04 10:11:39,707 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 92 selfloop transitions, 3 changer transitions 0/99 dead transitions. [2025-03-04 10:11:39,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 99 transitions, 731 flow [2025-03-04 10:11:39,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2025-03-04 10:11:39,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2025-03-04 10:11:39,708 INFO L175 Difference]: Start difference. First operand has 75 places, 86 transitions, 533 flow. Second operand 3 states and 82 transitions. [2025-03-04 10:11:39,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 99 transitions, 731 flow [2025-03-04 10:11:39,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 99 transitions, 709 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:39,752 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 440 flow [2025-03-04 10:11:39,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2025-03-04 10:11:39,753 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2025-03-04 10:11:39,753 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 440 flow [2025-03-04 10:11:39,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-03-04 10:11:39,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:39,753 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] [2025-03-04 10:11:39,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:11:39,753 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-03-04 10:11:39,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:39,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1714628283, now seen corresponding path program 2 times [2025-03-04 10:11:39,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:39,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776353992] [2025-03-04 10:11:39,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:39,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:39,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:11:39,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:39,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:11:39,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:39,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:39,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776353992] [2025-03-04 10:11:39,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776353992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:39,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:39,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:39,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702336060] [2025-03-04 10:11:39,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:39,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:39,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:39,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:39,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:39,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:11:39,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 440 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:39,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:39,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:11:39,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:41,409 INFO L124 PetriNetUnfolderBase]: 25352/33180 cut-off events. [2025-03-04 10:11:41,410 INFO L125 PetriNetUnfolderBase]: For 62046/62046 co-relation queries the response was YES. [2025-03-04 10:11:41,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112497 conditions, 33180 events. 25352/33180 cut-off events. For 62046/62046 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 169885 event pairs, 8858 based on Foata normal form. 180/30316 useless extension candidates. Maximal degree in co-relation 95596. Up to 19522 conditions per place. [2025-03-04 10:11:41,611 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 133 selfloop transitions, 33 changer transitions 0/167 dead transitions. [2025-03-04 10:11:41,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 167 transitions, 1301 flow [2025-03-04 10:11:41,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-04 10:11:41,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-04 10:11:41,615 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 440 flow. Second operand 5 states and 130 transitions. [2025-03-04 10:11:41,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 167 transitions, 1301 flow [2025-03-04 10:11:41,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 167 transitions, 1294 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:41,802 INFO L231 Difference]: Finished difference. Result has 79 places, 96 transitions, 711 flow [2025-03-04 10:11:41,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=711, PETRI_PLACES=79, PETRI_TRANSITIONS=96} [2025-03-04 10:11:41,802 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2025-03-04 10:11:41,802 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 96 transitions, 711 flow [2025-03-04 10:11:41,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:41,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:41,803 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] [2025-03-04 10:11:41,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:11:41,803 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-03-04 10:11:41,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash -18790587, now seen corresponding path program 3 times [2025-03-04 10:11:41,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:41,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003709375] [2025-03-04 10:11:41,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:41,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:41,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:11:41,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:41,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:11:41,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:41,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:41,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003709375] [2025-03-04 10:11:41,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003709375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:41,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:41,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:41,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332413506] [2025-03-04 10:11:41,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:41,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:41,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:41,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:41,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:41,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 10:11:41,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 96 transitions, 711 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-03-04 10:11:41,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:41,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 10:11:41,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:44,280 INFO L124 PetriNetUnfolderBase]: 32000/41833 cut-off events. [2025-03-04 10:11:44,280 INFO L125 PetriNetUnfolderBase]: For 111899/112087 co-relation queries the response was YES. [2025-03-04 10:11:44,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157830 conditions, 41833 events. 32000/41833 cut-off events. For 111899/112087 co-relation queries the response was YES. Maximal size of possible extension queue 1332. Compared 220305 event pairs, 10363 based on Foata normal form. 86/39986 useless extension candidates. Maximal degree in co-relation 124694. Up to 22982 conditions per place. [2025-03-04 10:11:44,592 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 172 selfloop transitions, 24 changer transitions 0/200 dead transitions. [2025-03-04 10:11:44,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 200 transitions, 1747 flow [2025-03-04 10:11:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-04 10:11:44,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6047619047619047 [2025-03-04 10:11:44,594 INFO L175 Difference]: Start difference. First operand has 79 places, 96 transitions, 711 flow. Second operand 5 states and 127 transitions. [2025-03-04 10:11:44,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 200 transitions, 1747 flow [2025-03-04 10:11:45,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 200 transitions, 1701 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:45,077 INFO L231 Difference]: Finished difference. Result has 85 places, 114 transitions, 960 flow [2025-03-04 10:11:45,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=960, PETRI_PLACES=85, PETRI_TRANSITIONS=114} [2025-03-04 10:11:45,078 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 39 predicate places. [2025-03-04 10:11:45,078 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 114 transitions, 960 flow [2025-03-04 10:11:45,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-03-04 10:11:45,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:45,079 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] [2025-03-04 10:11:45,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:11:45,079 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-03-04 10:11:45,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:45,079 INFO L85 PathProgramCache]: Analyzing trace with hash 475019667, now seen corresponding path program 1 times [2025-03-04 10:11:45,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:45,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959205240] [2025-03-04 10:11:45,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:45,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:45,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:11:45,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:45,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:45,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:45,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:45,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959205240] [2025-03-04 10:11:45,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959205240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:45,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:45,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:11:45,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219075478] [2025-03-04 10:11:45,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:45,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:45,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:45,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:45,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:45,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 10:11:45,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 114 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-03-04 10:11:45,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:45,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 10:11:45,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:46,542 INFO L124 PetriNetUnfolderBase]: 22425/30386 cut-off events. [2025-03-04 10:11:46,542 INFO L125 PetriNetUnfolderBase]: For 100676/102796 co-relation queries the response was YES. [2025-03-04 10:11:46,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119363 conditions, 30386 events. 22425/30386 cut-off events. For 100676/102796 co-relation queries the response was YES. Maximal size of possible extension queue 1016. Compared 167326 event pairs, 5934 based on Foata normal form. 115/29432 useless extension candidates. Maximal degree in co-relation 95467. Up to 19373 conditions per place. [2025-03-04 10:11:46,777 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 168 selfloop transitions, 3 changer transitions 7/184 dead transitions. [2025-03-04 10:11:46,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 184 transitions, 1944 flow [2025-03-04 10:11:46,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-03-04 10:11:46,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-04 10:11:46,778 INFO L175 Difference]: Start difference. First operand has 85 places, 114 transitions, 960 flow. Second operand 3 states and 78 transitions. [2025-03-04 10:11:46,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 184 transitions, 1944 flow [2025-03-04 10:11:46,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 184 transitions, 1928 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-03-04 10:11:46,956 INFO L231 Difference]: Finished difference. Result has 88 places, 111 transitions, 934 flow [2025-03-04 10:11:46,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=934, PETRI_PLACES=88, PETRI_TRANSITIONS=111} [2025-03-04 10:11:46,956 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 42 predicate places. [2025-03-04 10:11:46,956 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 111 transitions, 934 flow [2025-03-04 10:11:46,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-03-04 10:11:46,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:46,956 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] [2025-03-04 10:11:46,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:11:46,957 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-03-04 10:11:46,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:46,957 INFO L85 PathProgramCache]: Analyzing trace with hash 814392643, now seen corresponding path program 4 times [2025-03-04 10:11:46,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:46,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148265034] [2025-03-04 10:11:46,957 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:46,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:46,962 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:11:46,965 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-04 10:11:46,965 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:11:46,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:46,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148265034] [2025-03-04 10:11:46,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148265034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530171697] [2025-03-04 10:11:46,994 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:46,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:46,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:46,997 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:46,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:11:47,029 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:11:47,040 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-04 10:11:47,040 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:11:47,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:47,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:11:47,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:47,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:47,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530171697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:47,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:47,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 10:11:47,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418801901] [2025-03-04 10:11:47,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:47,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:11:47,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:47,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:11:47,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:11:47,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 10:11:47,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 111 transitions, 934 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:47,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:47,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 10:11:47,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:49,113 INFO L124 PetriNetUnfolderBase]: 29557/39350 cut-off events. [2025-03-04 10:11:49,113 INFO L125 PetriNetUnfolderBase]: For 117899/121280 co-relation queries the response was YES. [2025-03-04 10:11:49,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152236 conditions, 39350 events. 29557/39350 cut-off events. For 117899/121280 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 215413 event pairs, 6648 based on Foata normal form. 684/39873 useless extension candidates. Maximal degree in co-relation 131004. Up to 14499 conditions per place. [2025-03-04 10:11:49,413 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 255 selfloop transitions, 38 changer transitions 0/296 dead transitions. [2025-03-04 10:11:49,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 296 transitions, 2638 flow [2025-03-04 10:11:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:11:49,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:11:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2025-03-04 10:11:49,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6220238095238095 [2025-03-04 10:11:49,415 INFO L175 Difference]: Start difference. First operand has 88 places, 111 transitions, 934 flow. Second operand 8 states and 209 transitions. [2025-03-04 10:11:49,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 296 transitions, 2638 flow [2025-03-04 10:11:49,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 296 transitions, 2587 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:49,743 INFO L231 Difference]: Finished difference. Result has 95 places, 129 transitions, 1220 flow [2025-03-04 10:11:49,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1220, PETRI_PLACES=95, PETRI_TRANSITIONS=129} [2025-03-04 10:11:49,743 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 49 predicate places. [2025-03-04 10:11:49,743 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 129 transitions, 1220 flow [2025-03-04 10:11:49,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:49,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:49,743 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] [2025-03-04 10:11:49,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:49,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 10:11:49,945 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-03-04 10:11:49,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash -315360165, now seen corresponding path program 4 times [2025-03-04 10:11:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:49,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119166697] [2025-03-04 10:11:49,945 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:49,952 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:11:49,955 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-04 10:11:49,955 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:11:49,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:49,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:49,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119166697] [2025-03-04 10:11:49,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119166697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:49,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:49,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:11:49,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545935860] [2025-03-04 10:11:49,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:49,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:49,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:49,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:49,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:11:49,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 129 transitions, 1220 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:49,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:49,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:11:49,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:52,878 INFO L124 PetriNetUnfolderBase]: 34620/45788 cut-off events. [2025-03-04 10:11:52,878 INFO L125 PetriNetUnfolderBase]: For 173533/173533 co-relation queries the response was YES. [2025-03-04 10:11:53,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185746 conditions, 45788 events. 34620/45788 cut-off events. For 173533/173533 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 240929 event pairs, 2792 based on Foata normal form. 408/46196 useless extension candidates. Maximal degree in co-relation 163231. Up to 15466 conditions per place. [2025-03-04 10:11:53,273 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 344 selfloop transitions, 88 changer transitions 13/446 dead transitions. [2025-03-04 10:11:53,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 446 transitions, 4805 flow [2025-03-04 10:11:53,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:11:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:11:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 208 transitions. [2025-03-04 10:11:53,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5502645502645502 [2025-03-04 10:11:53,275 INFO L175 Difference]: Start difference. First operand has 95 places, 129 transitions, 1220 flow. Second operand 9 states and 208 transitions. [2025-03-04 10:11:53,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 446 transitions, 4805 flow [2025-03-04 10:11:53,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 446 transitions, 4583 flow, removed 63 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:53,707 INFO L231 Difference]: Finished difference. Result has 108 places, 184 transitions, 2146 flow [2025-03-04 10:11:53,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2146, PETRI_PLACES=108, PETRI_TRANSITIONS=184} [2025-03-04 10:11:53,707 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 62 predicate places. [2025-03-04 10:11:53,707 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 184 transitions, 2146 flow [2025-03-04 10:11:53,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:53,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:53,708 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] [2025-03-04 10:11:53,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:11:53,708 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-03-04 10:11:53,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:53,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1820189259, now seen corresponding path program 5 times [2025-03-04 10:11:53,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:53,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398308700] [2025-03-04 10:11:53,708 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:53,713 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:11:53,716 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:53,717 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:53,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:53,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:53,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398308700] [2025-03-04 10:11:53,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398308700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:53,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100075404] [2025-03-04 10:11:53,765 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:53,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:53,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:53,767 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:53,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:11:53,803 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:11:53,817 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:53,817 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:53,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:53,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:11:53,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:53,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:53,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100075404] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:53,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:53,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:11:53,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373922152] [2025-03-04 10:11:53,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:53,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:11:53,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:53,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:11:53,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:11:53,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 10:11:53,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 184 transitions, 2146 flow. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 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-03-04 10:11:53,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:53,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 10:11:53,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:56,821 INFO L124 PetriNetUnfolderBase]: 31493/42477 cut-off events. [2025-03-04 10:11:56,821 INFO L125 PetriNetUnfolderBase]: For 196082/197500 co-relation queries the response was YES. [2025-03-04 10:11:56,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183983 conditions, 42477 events. 31493/42477 cut-off events. For 196082/197500 co-relation queries the response was YES. Maximal size of possible extension queue 1219. Compared 240102 event pairs, 4440 based on Foata normal form. 754/43187 useless extension candidates. Maximal degree in co-relation 167828. Up to 11593 conditions per place. [2025-03-04 10:11:57,084 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 290 selfloop transitions, 72 changer transitions 0/368 dead transitions. [2025-03-04 10:11:57,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 368 transitions, 4115 flow [2025-03-04 10:11:57,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:11:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:11:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2025-03-04 10:11:57,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-03-04 10:11:57,085 INFO L175 Difference]: Start difference. First operand has 108 places, 184 transitions, 2146 flow. Second operand 8 states and 204 transitions. [2025-03-04 10:11:57,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 368 transitions, 4115 flow [2025-03-04 10:11:57,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 368 transitions, 3999 flow, removed 58 selfloop flow, removed 0 redundant places. [2025-03-04 10:11:57,910 INFO L231 Difference]: Finished difference. Result has 119 places, 193 transitions, 2408 flow [2025-03-04 10:11:57,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2408, PETRI_PLACES=119, PETRI_TRANSITIONS=193} [2025-03-04 10:11:57,911 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 73 predicate places. [2025-03-04 10:11:57,911 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 193 transitions, 2408 flow [2025-03-04 10:11:57,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 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-03-04 10:11:57,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:57,911 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] [2025-03-04 10:11:57,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:11:58,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:58,112 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-03-04 10:11:58,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1390632555, now seen corresponding path program 5 times [2025-03-04 10:11:58,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:58,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947548979] [2025-03-04 10:11:58,113 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:58,116 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:11:58,119 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:58,119 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:58,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:58,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:58,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947548979] [2025-03-04 10:11:58,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947548979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:58,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288229480] [2025-03-04 10:11:58,160 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:58,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:58,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:58,163 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:58,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:11:58,195 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:11:58,209 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:11:58,210 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:58,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:58,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:11:58,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:58,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:58,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288229480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:58,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:58,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:11:58,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772791338] [2025-03-04 10:11:58,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:58,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:11:58,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:58,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:11:58,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:11:58,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:11:58,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 193 transitions, 2408 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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-03-04 10:11:58,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:58,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:11:58,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:01,460 INFO L124 PetriNetUnfolderBase]: 38430/50953 cut-off events. [2025-03-04 10:12:01,460 INFO L125 PetriNetUnfolderBase]: For 308941/308941 co-relation queries the response was YES. [2025-03-04 10:12:01,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235247 conditions, 50953 events. 38430/50953 cut-off events. For 308941/308941 co-relation queries the response was YES. Maximal size of possible extension queue 1304. Compared 275705 event pairs, 11047 based on Foata normal form. 288/51241 useless extension candidates. Maximal degree in co-relation 213304. Up to 21759 conditions per place. [2025-03-04 10:12:01,974 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 202 selfloop transitions, 112 changer transitions 2/317 dead transitions. [2025-03-04 10:12:01,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 317 transitions, 3913 flow [2025-03-04 10:12:01,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:12:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:12:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2025-03-04 10:12:01,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2025-03-04 10:12:01,975 INFO L175 Difference]: Start difference. First operand has 119 places, 193 transitions, 2408 flow. Second operand 7 states and 177 transitions. [2025-03-04 10:12:01,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 317 transitions, 3913 flow [2025-03-04 10:12:03,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 317 transitions, 3859 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-03-04 10:12:03,502 INFO L231 Difference]: Finished difference. Result has 127 places, 206 transitions, 2871 flow [2025-03-04 10:12:03,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2366, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2871, PETRI_PLACES=127, PETRI_TRANSITIONS=206} [2025-03-04 10:12:03,502 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 81 predicate places. [2025-03-04 10:12:03,502 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 206 transitions, 2871 flow [2025-03-04 10:12:03,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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-03-04 10:12:03,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:03,503 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] [2025-03-04 10:12:03,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:12:03,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:03,704 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-03-04 10:12:03,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1738210921, now seen corresponding path program 6 times [2025-03-04 10:12:03,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:03,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425279458] [2025-03-04 10:12:03,705 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:12:03,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:03,710 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:12:03,713 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:12:03,713 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 10:12:03,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:03,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:03,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:03,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425279458] [2025-03-04 10:12:03,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425279458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:03,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:03,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:12:03,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13223638] [2025-03-04 10:12:03,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:03,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:12:03,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:03,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:12:03,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:12:03,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 10:12:03,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 206 transitions, 2871 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-03-04 10:12:03,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:03,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 10:12:03,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:06,659 INFO L124 PetriNetUnfolderBase]: 35966/48172 cut-off events. [2025-03-04 10:12:06,659 INFO L125 PetriNetUnfolderBase]: For 306947/307161 co-relation queries the response was YES. [2025-03-04 10:12:07,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229239 conditions, 48172 events. 35966/48172 cut-off events. For 306947/307161 co-relation queries the response was YES. Maximal size of possible extension queue 1350. Compared 265878 event pairs, 16983 based on Foata normal form. 98/48123 useless extension candidates. Maximal degree in co-relation 209696. Up to 32407 conditions per place. [2025-03-04 10:12:07,181 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 142 selfloop transitions, 71 changer transitions 17/266 dead transitions. [2025-03-04 10:12:07,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 266 transitions, 3707 flow [2025-03-04 10:12:07,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:12:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:12:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-03-04 10:12:07,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-03-04 10:12:07,182 INFO L175 Difference]: Start difference. First operand has 127 places, 206 transitions, 2871 flow. Second operand 5 states and 124 transitions. [2025-03-04 10:12:07,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 266 transitions, 3707 flow [2025-03-04 10:12:08,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 266 transitions, 3619 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-03-04 10:12:08,570 INFO L231 Difference]: Finished difference. Result has 131 places, 200 transitions, 2815 flow [2025-03-04 10:12:08,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2783, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2815, PETRI_PLACES=131, PETRI_TRANSITIONS=200} [2025-03-04 10:12:08,571 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 85 predicate places. [2025-03-04 10:12:08,571 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 200 transitions, 2815 flow [2025-03-04 10:12:08,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-03-04 10:12:08,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:08,571 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] [2025-03-04 10:12:08,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:12:08,571 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:12:08,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:08,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1851950085, now seen corresponding path program 6 times [2025-03-04 10:12:08,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:08,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867008575] [2025-03-04 10:12:08,572 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:12:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:08,575 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:12:08,580 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:12:08,580 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:12:08,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:08,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:08,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867008575] [2025-03-04 10:12:08,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867008575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:08,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:08,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:12:08,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855169156] [2025-03-04 10:12:08,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:08,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:12:08,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:08,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:12:08,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:12:08,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 10:12:08,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 200 transitions, 2815 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-03-04 10:12:08,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:08,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 10:12:08,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:11,300 INFO L124 PetriNetUnfolderBase]: 32442/43404 cut-off events. [2025-03-04 10:12:11,300 INFO L125 PetriNetUnfolderBase]: For 306225/308297 co-relation queries the response was YES. [2025-03-04 10:12:11,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207075 conditions, 43404 events. 32442/43404 cut-off events. For 306225/308297 co-relation queries the response was YES. Maximal size of possible extension queue 1286. Compared 240064 event pairs, 9711 based on Foata normal form. 516/43838 useless extension candidates. Maximal degree in co-relation 188334. Up to 23189 conditions per place. [2025-03-04 10:12:11,750 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 256 selfloop transitions, 45 changer transitions 8/315 dead transitions. [2025-03-04 10:12:11,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 315 transitions, 4520 flow [2025-03-04 10:12:11,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:12:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:12:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-04 10:12:11,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-04 10:12:11,751 INFO L175 Difference]: Start difference. First operand has 131 places, 200 transitions, 2815 flow. Second operand 5 states and 130 transitions. [2025-03-04 10:12:11,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 315 transitions, 4520 flow [2025-03-04 10:12:12,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 315 transitions, 4170 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-03-04 10:12:12,835 INFO L231 Difference]: Finished difference. Result has 130 places, 220 transitions, 3056 flow [2025-03-04 10:12:12,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2563, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3056, PETRI_PLACES=130, PETRI_TRANSITIONS=220} [2025-03-04 10:12:12,836 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 84 predicate places. [2025-03-04 10:12:12,836 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 220 transitions, 3056 flow [2025-03-04 10:12:12,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-03-04 10:12:12,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:12,836 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] [2025-03-04 10:12:12,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:12:12,836 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:12:12,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:12,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1894917639, now seen corresponding path program 7 times [2025-03-04 10:12:12,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:12,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840595577] [2025-03-04 10:12:12,836 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:12:12,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:12,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:12:12,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:12:12,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:12,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:12,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:12,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840595577] [2025-03-04 10:12:12,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840595577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:12,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:12,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:12:12,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127248813] [2025-03-04 10:12:12,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:12,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:12:12,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:12,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:12:12,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:12:12,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 10:12:12,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 220 transitions, 3056 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-03-04 10:12:12,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:12,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 10:12:12,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:15,925 INFO L124 PetriNetUnfolderBase]: 37190/49503 cut-off events. [2025-03-04 10:12:15,926 INFO L125 PetriNetUnfolderBase]: For 341516/342096 co-relation queries the response was YES. [2025-03-04 10:12:16,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234357 conditions, 49503 events. 37190/49503 cut-off events. For 341516/342096 co-relation queries the response was YES. Maximal size of possible extension queue 1372. Compared 274389 event pairs, 12649 based on Foata normal form. 610/49974 useless extension candidates. Maximal degree in co-relation 211914. Up to 32042 conditions per place. [2025-03-04 10:12:16,443 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 356 selfloop transitions, 24 changer transitions 6/422 dead transitions. [2025-03-04 10:12:16,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 422 transitions, 6082 flow [2025-03-04 10:12:16,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:12:16,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:12:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-04 10:12:16,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-03-04 10:12:16,444 INFO L175 Difference]: Start difference. First operand has 130 places, 220 transitions, 3056 flow. Second operand 5 states and 125 transitions. [2025-03-04 10:12:16,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 422 transitions, 6082 flow [2025-03-04 10:12:17,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 422 transitions, 5990 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-04 10:12:17,695 INFO L231 Difference]: Finished difference. Result has 135 places, 226 transitions, 3125 flow [2025-03-04 10:12:17,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3025, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3125, PETRI_PLACES=135, PETRI_TRANSITIONS=226} [2025-03-04 10:12:17,695 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 89 predicate places. [2025-03-04 10:12:17,695 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 226 transitions, 3125 flow [2025-03-04 10:12:17,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-03-04 10:12:17,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:17,696 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] [2025-03-04 10:12:17,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:12:17,696 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:12:17,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:17,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1437436089, now seen corresponding path program 8 times [2025-03-04 10:12:17,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:17,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293216606] [2025-03-04 10:12:17,696 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:12:17,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:17,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:12:17,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:12:17,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:17,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:17,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:17,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293216606] [2025-03-04 10:12:17,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293216606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:17,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49770298] [2025-03-04 10:12:17,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:12:17,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:17,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:17,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:17,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:12:17,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:12:17,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:12:17,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:17,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:17,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:12:17,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:17,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:17,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49770298] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:17,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:17,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-04 10:12:17,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239230128] [2025-03-04 10:12:17,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:17,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:12:17,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:17,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:12:17,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:12:17,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:12:17,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 226 transitions, 3125 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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-03-04 10:12:17,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:17,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:12:17,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:21,601 INFO L124 PetriNetUnfolderBase]: 43923/58088 cut-off events. [2025-03-04 10:12:21,601 INFO L125 PetriNetUnfolderBase]: For 415515/415515 co-relation queries the response was YES. [2025-03-04 10:12:21,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289130 conditions, 58088 events. 43923/58088 cut-off events. For 415515/415515 co-relation queries the response was YES. Maximal size of possible extension queue 1524. Compared 320111 event pairs, 3743 based on Foata normal form. 600/58688 useless extension candidates. Maximal degree in co-relation 269216. Up to 10733 conditions per place. [2025-03-04 10:12:22,192 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 436 selfloop transitions, 172 changer transitions 36/645 dead transitions. [2025-03-04 10:12:22,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 645 transitions, 8209 flow [2025-03-04 10:12:22,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:12:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:12:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 365 transitions. [2025-03-04 10:12:22,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5793650793650794 [2025-03-04 10:12:22,193 INFO L175 Difference]: Start difference. First operand has 135 places, 226 transitions, 3125 flow. Second operand 15 states and 365 transitions. [2025-03-04 10:12:22,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 645 transitions, 8209 flow [2025-03-04 10:12:24,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 645 transitions, 8161 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 10:12:24,140 INFO L231 Difference]: Finished difference. Result has 151 places, 264 transitions, 3979 flow [2025-03-04 10:12:24,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3067, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3979, PETRI_PLACES=151, PETRI_TRANSITIONS=264} [2025-03-04 10:12:24,140 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 105 predicate places. [2025-03-04 10:12:24,140 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 264 transitions, 3979 flow [2025-03-04 10:12:24,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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-03-04 10:12:24,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:24,140 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] [2025-03-04 10:12:24,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:12:24,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:12:24,341 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:12:24,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:24,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2016901758, now seen corresponding path program 1 times [2025-03-04 10:12:24,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:24,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598182445] [2025-03-04 10:12:24,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:24,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:24,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:12:24,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:12:24,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:24,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:24,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:24,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598182445] [2025-03-04 10:12:24,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598182445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:24,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:24,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:12:24,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760287857] [2025-03-04 10:12:24,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:24,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:12:24,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:24,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:12:24,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:12:24,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 10:12:24,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 264 transitions, 3979 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-03-04 10:12:24,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:24,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 10:12:24,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:29,376 INFO L124 PetriNetUnfolderBase]: 44238/59842 cut-off events. [2025-03-04 10:12:29,376 INFO L125 PetriNetUnfolderBase]: For 453737/454773 co-relation queries the response was YES. [2025-03-04 10:12:29,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306088 conditions, 59842 events. 44238/59842 cut-off events. For 453737/454773 co-relation queries the response was YES. Maximal size of possible extension queue 1865. Compared 356208 event pairs, 6818 based on Foata normal form. 754/60308 useless extension candidates. Maximal degree in co-relation 287569. Up to 29840 conditions per place. [2025-03-04 10:12:29,904 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 248 selfloop transitions, 156 changer transitions 0/413 dead transitions. [2025-03-04 10:12:29,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 413 transitions, 5873 flow [2025-03-04 10:12:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:12:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:12:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2025-03-04 10:12:29,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2025-03-04 10:12:29,905 INFO L175 Difference]: Start difference. First operand has 151 places, 264 transitions, 3979 flow. Second operand 7 states and 180 transitions. [2025-03-04 10:12:29,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 413 transitions, 5873 flow [2025-03-04 10:12:32,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 413 transitions, 5271 flow, removed 100 selfloop flow, removed 18 redundant places. [2025-03-04 10:12:32,802 INFO L231 Difference]: Finished difference. Result has 136 places, 277 transitions, 4079 flow [2025-03-04 10:12:32,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3435, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4079, PETRI_PLACES=136, PETRI_TRANSITIONS=277} [2025-03-04 10:12:32,803 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 90 predicate places. [2025-03-04 10:12:32,803 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 277 transitions, 4079 flow [2025-03-04 10:12:32,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-03-04 10:12:32,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:32,803 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] [2025-03-04 10:12:32,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:12:32,803 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:12:32,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1975541120, now seen corresponding path program 2 times [2025-03-04 10:12:32,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:32,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719815934] [2025-03-04 10:12:32,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:12:32,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:32,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 10:12:32,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 29 statements. [2025-03-04 10:12:32,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:12:32,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:32,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:32,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719815934] [2025-03-04 10:12:32,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719815934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:32,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:32,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:12:32,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640997057] [2025-03-04 10:12:32,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:32,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:12:32,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:32,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:12:32,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:12:32,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 10:12:32,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 277 transitions, 4079 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-03-04 10:12:32,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:32,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 10:12:32,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:37,546 INFO L124 PetriNetUnfolderBase]: 45780/61562 cut-off events. [2025-03-04 10:12:37,546 INFO L125 PetriNetUnfolderBase]: For 470082/471330 co-relation queries the response was YES. [2025-03-04 10:12:37,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302198 conditions, 61562 events. 45780/61562 cut-off events. For 470082/471330 co-relation queries the response was YES. Maximal size of possible extension queue 1947. Compared 363194 event pairs, 14484 based on Foata normal form. 102/61346 useless extension candidates. Maximal degree in co-relation 249935. Up to 33490 conditions per place. [2025-03-04 10:12:38,185 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 365 selfloop transitions, 27 changer transitions 9/410 dead transitions. [2025-03-04 10:12:38,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 410 transitions, 6119 flow [2025-03-04 10:12:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:12:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:12:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-03-04 10:12:38,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5619047619047619 [2025-03-04 10:12:38,186 INFO L175 Difference]: Start difference. First operand has 136 places, 277 transitions, 4079 flow. Second operand 5 states and 118 transitions. [2025-03-04 10:12:38,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 410 transitions, 6119 flow [2025-03-04 10:12:39,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 410 transitions, 6038 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 10:12:39,982 INFO L231 Difference]: Finished difference. Result has 140 places, 277 transitions, 4076 flow [2025-03-04 10:12:39,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4008, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4076, PETRI_PLACES=140, PETRI_TRANSITIONS=277} [2025-03-04 10:12:39,983 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 94 predicate places. [2025-03-04 10:12:39,983 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 277 transitions, 4076 flow [2025-03-04 10:12:39,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-03-04 10:12:39,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:39,983 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] [2025-03-04 10:12:39,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:12:39,983 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:12:39,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:39,983 INFO L85 PathProgramCache]: Analyzing trace with hash 211687150, now seen corresponding path program 3 times [2025-03-04 10:12:39,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:39,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606048054] [2025-03-04 10:12:39,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:12:39,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:39,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-03-04 10:12:39,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 29 statements. [2025-03-04 10:12:39,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:12:39,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:40,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:40,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606048054] [2025-03-04 10:12:40,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606048054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:40,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:40,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:12:40,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594468786] [2025-03-04 10:12:40,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:40,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:12:40,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:40,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:12:40,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:12:40,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-04 10:12:40,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 277 transitions, 4076 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-03-04 10:12:40,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:40,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-04 10:12:40,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:46,144 INFO L124 PetriNetUnfolderBase]: 57046/76687 cut-off events. [2025-03-04 10:12:46,145 INFO L125 PetriNetUnfolderBase]: For 687423/688781 co-relation queries the response was YES. [2025-03-04 10:12:46,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385434 conditions, 76687 events. 57046/76687 cut-off events. For 687423/688781 co-relation queries the response was YES. Maximal size of possible extension queue 2562. Compared 464240 event pairs, 17262 based on Foata normal form. 352/76866 useless extension candidates. Maximal degree in co-relation 311193. Up to 42829 conditions per place. [2025-03-04 10:12:46,794 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 282 selfloop transitions, 309 changer transitions 7/607 dead transitions. [2025-03-04 10:12:46,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 607 transitions, 10664 flow [2025-03-04 10:12:46,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:12:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:12:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-03-04 10:12:46,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-03-04 10:12:46,795 INFO L175 Difference]: Start difference. First operand has 140 places, 277 transitions, 4076 flow. Second operand 5 states and 122 transitions. [2025-03-04 10:12:46,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 607 transitions, 10664 flow [2025-03-04 10:12:49,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 607 transitions, 10570 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 10:12:49,564 INFO L231 Difference]: Finished difference. Result has 143 places, 478 transitions, 8908 flow [2025-03-04 10:12:49,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4020, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8908, PETRI_PLACES=143, PETRI_TRANSITIONS=478} [2025-03-04 10:12:49,564 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 97 predicate places. [2025-03-04 10:12:49,564 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 478 transitions, 8908 flow [2025-03-04 10:12:49,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-03-04 10:12:49,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:49,565 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] [2025-03-04 10:12:49,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:12:49,565 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:12:49,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1498087148, now seen corresponding path program 4 times [2025-03-04 10:12:49,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:49,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325956343] [2025-03-04 10:12:49,565 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:12:49,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:49,570 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-04 10:12:49,572 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 28 of 29 statements. [2025-03-04 10:12:49,572 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:12:49,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:49,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325956343] [2025-03-04 10:12:49,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325956343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:49,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:49,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:12:49,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262167096] [2025-03-04 10:12:49,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:49,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:12:49,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:49,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:12:49,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:12:49,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 42 [2025-03-04 10:12:49,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 478 transitions, 8908 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:49,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:49,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 42 [2025-03-04 10:12:49,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:58,111 INFO L124 PetriNetUnfolderBase]: 70229/92322 cut-off events. [2025-03-04 10:12:58,111 INFO L125 PetriNetUnfolderBase]: For 801020/801020 co-relation queries the response was YES. [2025-03-04 10:12:58,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485982 conditions, 92322 events. 70229/92322 cut-off events. For 801020/801020 co-relation queries the response was YES. Maximal size of possible extension queue 2636. Compared 529844 event pairs, 17917 based on Foata normal form. 150/92472 useless extension candidates. Maximal degree in co-relation 394365. Up to 56094 conditions per place. [2025-03-04 10:12:59,130 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 542 selfloop transitions, 54 changer transitions 4/601 dead transitions. [2025-03-04 10:12:59,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 601 transitions, 11104 flow [2025-03-04 10:12:59,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:12:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:12:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-03-04 10:12:59,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5761904761904761 [2025-03-04 10:12:59,131 INFO L175 Difference]: Start difference. First operand has 143 places, 478 transitions, 8908 flow. Second operand 5 states and 121 transitions. [2025-03-04 10:12:59,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 601 transitions, 11104 flow [2025-03-04 10:13:03,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 601 transitions, 10800 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:13:03,290 INFO L231 Difference]: Finished difference. Result has 149 places, 502 transitions, 9030 flow [2025-03-04 10:13:03,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=8604, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9030, PETRI_PLACES=149, PETRI_TRANSITIONS=502} [2025-03-04 10:13:03,290 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 103 predicate places. [2025-03-04 10:13:03,290 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 502 transitions, 9030 flow [2025-03-04 10:13:03,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:03,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:03,291 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] [2025-03-04 10:13:03,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:13:03,292 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 10:13:03,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:03,292 INFO L85 PathProgramCache]: Analyzing trace with hash -619378978, now seen corresponding path program 5 times [2025-03-04 10:13:03,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:03,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859078876] [2025-03-04 10:13:03,292 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:13:03,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:03,296 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 10:13:03,299 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:13:03,299 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:03,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:03,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:03,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859078876] [2025-03-04 10:13:03,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859078876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:03,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:03,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:13:03,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045300814] [2025-03-04 10:13:03,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:03,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:03,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:03,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:03,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:13:03,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42 [2025-03-04 10:13:03,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 502 transitions, 9030 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-03-04 10:13:03,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:03,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42 [2025-03-04 10:13:03,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand