./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/parallel-ticket-4.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 ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:23:11,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:23:11,454 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:23:11,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:23:11,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:23:11,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:23:11,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:23:11,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:23:11,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:23:11,478 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:23:11,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:23:11,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:23:11,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:23:11,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:23:11,478 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:23:11,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:23:11,478 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:23:11,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:23:11,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:23:11,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:23:11,479 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:23:11,479 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:23:11,479 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:23:11,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:23:11,479 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:23:11,479 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:23:11,479 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:23:11,479 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:23:11,480 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:23:11,480 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:23:11,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:23:11,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:23:11,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:23:11,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:23:11,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:23:11,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:23:11,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:23:11,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:23:11,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:23:11,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:23:11,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:23:11,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:23:11,481 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 -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2025-03-09 01:23:11,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:23:11,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:23:11,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:23:11,732 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:23:11,733 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:23:11,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-03-09 01:23:12,920 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39d617387/f2fe21d4db654352ab85faa3790416fc/FLAG3d329088c [2025-03-09 01:23:13,203 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:23:13,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-03-09 01:23:13,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39d617387/f2fe21d4db654352ab85faa3790416fc/FLAG3d329088c [2025-03-09 01:23:13,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39d617387/f2fe21d4db654352ab85faa3790416fc [2025-03-09 01:23:13,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:23:13,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:23:13,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:23:13,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:23:13,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:23:13,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:23:13" (1/1) ... [2025-03-09 01:23:13,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7813808b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13, skipping insertion in model container [2025-03-09 01:23:13,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:23:13" (1/1) ... [2025-03-09 01:23:13,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:23:13,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:23:13,674 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:23:13,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:23:13,708 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:23:13,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13 WrapperNode [2025-03-09 01:23:13,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:23:13,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:23:13,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:23:13,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:23:13,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13" (1/1) ... [2025-03-09 01:23:13,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13" (1/1) ... [2025-03-09 01:23:13,747 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 174 [2025-03-09 01:23:13,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:23:13,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:23:13,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:23:13,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:23:13,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13" (1/1) ... [2025-03-09 01:23:13,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13" (1/1) ... [2025-03-09 01:23:13,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13" (1/1) ... [2025-03-09 01:23:13,772 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-09 01:23:13,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13" (1/1) ... [2025-03-09 01:23:13,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13" (1/1) ... [2025-03-09 01:23:13,779 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13" (1/1) ... [2025-03-09 01:23:13,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13" (1/1) ... [2025-03-09 01:23:13,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13" (1/1) ... [2025-03-09 01:23:13,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13" (1/1) ... [2025-03-09 01:23:13,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:23:13,788 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:23:13,788 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:23:13,788 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:23:13,789 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13" (1/1) ... [2025-03-09 01:23:13,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:23:13,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:23:13,814 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-09 01:23:13,818 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-09 01:23:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:23:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:23:13,837 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:23:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:23:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:23:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:23:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:23:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-09 01:23:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-09 01:23:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:23:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:23:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:23:13,839 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:23:13,918 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:23:13,920 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:23:14,149 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:23:14,149 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:23:14,288 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:23:14,288 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:23:14,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:23:14 BoogieIcfgContainer [2025-03-09 01:23:14,288 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:23:14,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:23:14,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:23:14,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:23:14,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:23:13" (1/3) ... [2025-03-09 01:23:14,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2089cab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:23:14, skipping insertion in model container [2025-03-09 01:23:14,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:23:13" (2/3) ... [2025-03-09 01:23:14,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2089cab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:23:14, skipping insertion in model container [2025-03-09 01:23:14,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:23:14" (3/3) ... [2025-03-09 01:23:14,298 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2025-03-09 01:23:14,312 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:23:14,314 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-09 01:23:14,315 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:23:14,374 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 01:23:14,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 61 transitions, 150 flow [2025-03-09 01:23:14,429 INFO L124 PetriNetUnfolderBase]: 3/57 cut-off events. [2025-03-09 01:23:14,430 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:23:14,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 57 events. 3/57 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-03-09 01:23:14,434 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 61 transitions, 150 flow [2025-03-09 01:23:14,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 56 transitions, 136 flow [2025-03-09 01:23:14,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:23:14,461 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;@72390998, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:23:14,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 01:23:14,477 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:23:14,478 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2025-03-09 01:23:14,478 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:23:14,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:14,479 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:14,479 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-09 01:23:14,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash -399463162, now seen corresponding path program 1 times [2025-03-09 01:23:14,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:14,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098724913] [2025-03-09 01:23:14,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:14,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:14,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:23:14,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:23:14,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:14,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:14,827 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-09 01:23:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:14,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098724913] [2025-03-09 01:23:14,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098724913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:14,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:14,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:23:14,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448957243] [2025-03-09 01:23:14,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:14,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:23:14,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:14,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:23:14,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:23:14,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-09 01:23:14,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:14,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:14,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-09 01:23:14,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:16,520 INFO L124 PetriNetUnfolderBase]: 17631/24113 cut-off events. [2025-03-09 01:23:16,520 INFO L125 PetriNetUnfolderBase]: For 1365/1365 co-relation queries the response was YES. [2025-03-09 01:23:16,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48642 conditions, 24113 events. 17631/24113 cut-off events. For 1365/1365 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 139494 event pairs, 6173 based on Foata normal form. 2/23349 useless extension candidates. Maximal degree in co-relation 45351. Up to 14774 conditions per place. [2025-03-09 01:23:16,677 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 66 selfloop transitions, 6 changer transitions 1/84 dead transitions. [2025-03-09 01:23:16,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 356 flow [2025-03-09 01:23:16,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:23:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:23:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-03-09 01:23:16,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2025-03-09 01:23:16,688 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 136 flow. Second operand 3 states and 123 transitions. [2025-03-09 01:23:16,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 356 flow [2025-03-09 01:23:16,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 328 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 01:23:16,723 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2025-03-09 01:23:16,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-03-09 01:23:16,727 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2025-03-09 01:23:16,727 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2025-03-09 01:23:16,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:16,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:16,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:16,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:23:16,728 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-09 01:23:16,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:16,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1213452540, now seen corresponding path program 1 times [2025-03-09 01:23:16,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:16,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966772721] [2025-03-09 01:23:16,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:16,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:16,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:23:16,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:23:16,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:16,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:16,813 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-09 01:23:16,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:16,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966772721] [2025-03-09 01:23:16,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966772721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:16,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:16,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:23:16,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271879479] [2025-03-09 01:23:16,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:16,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:23:16,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:16,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:23:16,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:23:16,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 61 [2025-03-09 01:23:16,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:16,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:16,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 61 [2025-03-09 01:23:16,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:18,540 INFO L124 PetriNetUnfolderBase]: 24981/33967 cut-off events. [2025-03-09 01:23:18,541 INFO L125 PetriNetUnfolderBase]: For 2715/2715 co-relation queries the response was YES. [2025-03-09 01:23:18,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72786 conditions, 33967 events. 24981/33967 cut-off events. For 2715/2715 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 196070 event pairs, 17656 based on Foata normal form. 0/33386 useless extension candidates. Maximal degree in co-relation 41623. Up to 29158 conditions per place. [2025-03-09 01:23:18,681 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 73 selfloop transitions, 8 changer transitions 0/86 dead transitions. [2025-03-09 01:23:18,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 386 flow [2025-03-09 01:23:18,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:23:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:23:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-03-09 01:23:18,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5901639344262295 [2025-03-09 01:23:18,686 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 3 states and 108 transitions. [2025-03-09 01:23:18,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 386 flow [2025-03-09 01:23:18,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:23:18,690 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 196 flow [2025-03-09 01:23:18,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2025-03-09 01:23:18,691 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2025-03-09 01:23:18,691 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 196 flow [2025-03-09 01:23:18,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:18,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:18,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:18,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:23:18,692 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-09 01:23:18,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:18,693 INFO L85 PathProgramCache]: Analyzing trace with hash -796837414, now seen corresponding path program 1 times [2025-03-09 01:23:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:18,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726650603] [2025-03-09 01:23:18,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:18,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:18,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:23:18,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:23:18,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:18,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:18,963 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-09 01:23:18,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:18,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726650603] [2025-03-09 01:23:18,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726650603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:18,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:18,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:23:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941463255] [2025-03-09 01:23:18,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:18,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:18,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:18,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:18,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:23:18,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-09 01:23:18,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:18,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:18,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-09 01:23:18,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:21,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L45-1-->L46-3: Formula: (= v_~x~0_12 0) InVars {} OutVars{~x~0=v_~x~0_12} AuxVars[] AssignedVars[~x~0][80], [5#L56-3true, Black: 78#true, 8#L100-1true, 26#L66-3true, 85#(<= ~s~0 ~t~0), 28#thread4EXITtrue, 80#(not (= ~x~0 1)), 19#L46-3true, Black: 76#(= (mod ~b~0 256) 0)]) [2025-03-09 01:23:21,037 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-03-09 01:23:21,037 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:23:21,037 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:23:21,037 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-09 01:23:21,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L45-1-->L46-3: Formula: (= v_~x~0_12 0) InVars {} OutVars{~x~0=v_~x~0_12} AuxVars[] AssignedVars[~x~0][80], [5#L56-3true, Black: 78#true, 26#L66-3true, 85#(<= ~s~0 ~t~0), 80#(not (= ~x~0 1)), 28#thread4EXITtrue, 19#L46-3true, Black: 76#(= (mod ~b~0 256) 0), 55#L101true]) [2025-03-09 01:23:21,134 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-03-09 01:23:21,134 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:23:21,134 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:23:21,134 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-09 01:23:21,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L66-3-->L66: Formula: (and (= |v_thread3Thread1of1ForFork2_#t~post6#1_1| v_~s~0_43) (= v_~s~0_42 (+ |v_thread3Thread1of1ForFork2_#t~post6#1_1| 1))) InVars {~s~0=v_~s~0_43} OutVars{thread3Thread1of1ForFork2_#t~post6#1=|v_thread3Thread1of1ForFork2_#t~post6#1_1|, ~s~0=v_~s~0_42} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post6#1, ~s~0][94], [5#L56-3true, 40#L76-3true, Black: 78#true, 83#true, 80#(not (= ~x~0 1)), 12#L66true, 47#L102true, Black: 76#(= (mod ~b~0 256) 0)]) [2025-03-09 01:23:21,235 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-03-09 01:23:21,235 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-03-09 01:23:21,235 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-09 01:23:21,235 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-09 01:23:21,281 INFO L124 PetriNetUnfolderBase]: 41500/59187 cut-off events. [2025-03-09 01:23:21,281 INFO L125 PetriNetUnfolderBase]: For 18035/18063 co-relation queries the response was YES. [2025-03-09 01:23:21,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133896 conditions, 59187 events. 41500/59187 cut-off events. For 18035/18063 co-relation queries the response was YES. Maximal size of possible extension queue 2605. Compared 415594 event pairs, 11478 based on Foata normal form. 596/58470 useless extension candidates. Maximal degree in co-relation 75815. Up to 20854 conditions per place. [2025-03-09 01:23:21,496 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 120 selfloop transitions, 19 changer transitions 2/155 dead transitions. [2025-03-09 01:23:21,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 155 transitions, 743 flow [2025-03-09 01:23:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2025-03-09 01:23:21,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6786885245901639 [2025-03-09 01:23:21,500 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 196 flow. Second operand 5 states and 207 transitions. [2025-03-09 01:23:21,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 155 transitions, 743 flow [2025-03-09 01:23:21,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 155 transitions, 715 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:21,580 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 290 flow [2025-03-09 01:23:21,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2025-03-09 01:23:21,580 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-03-09 01:23:21,581 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 290 flow [2025-03-09 01:23:21,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:21,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:21,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:21,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:23:21,581 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-09 01:23:21,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1049569032, now seen corresponding path program 2 times [2025-03-09 01:23:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:21,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674823318] [2025-03-09 01:23:21,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:23:21,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:21,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:23:21,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:23:21,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:23:21,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:21,939 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-09 01:23:21,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:21,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674823318] [2025-03-09 01:23:21,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674823318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:21,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:21,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:23:21,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480782586] [2025-03-09 01:23:21,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:21,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:21,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:21,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:21,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:23:21,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-09 01:23:21,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:21,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:21,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-09 01:23:21,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:24,567 INFO L124 PetriNetUnfolderBase]: 39254/56975 cut-off events. [2025-03-09 01:23:24,567 INFO L125 PetriNetUnfolderBase]: For 32333/32415 co-relation queries the response was YES. [2025-03-09 01:23:24,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149659 conditions, 56975 events. 39254/56975 cut-off events. For 32333/32415 co-relation queries the response was YES. Maximal size of possible extension queue 2495. Compared 410945 event pairs, 10100 based on Foata normal form. 652/56136 useless extension candidates. Maximal degree in co-relation 86838. Up to 19444 conditions per place. [2025-03-09 01:23:24,792 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 116 selfloop transitions, 24 changer transitions 3/157 dead transitions. [2025-03-09 01:23:24,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 157 transitions, 836 flow [2025-03-09 01:23:24,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:24,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2025-03-09 01:23:24,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6688524590163935 [2025-03-09 01:23:24,794 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 290 flow. Second operand 5 states and 204 transitions. [2025-03-09 01:23:24,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 157 transitions, 836 flow [2025-03-09 01:23:24,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 157 transitions, 836 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:23:24,800 INFO L231 Difference]: Finished difference. Result has 72 places, 83 transitions, 391 flow [2025-03-09 01:23:24,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=72, PETRI_TRANSITIONS=83} [2025-03-09 01:23:24,801 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places. [2025-03-09 01:23:24,801 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 83 transitions, 391 flow [2025-03-09 01:23:24,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:24,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:24,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:24,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:23:24,802 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-09 01:23:24,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:24,803 INFO L85 PathProgramCache]: Analyzing trace with hash 771122282, now seen corresponding path program 3 times [2025-03-09 01:23:24,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:24,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946978863] [2025-03-09 01:23:24,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:23:24,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:24,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:23:24,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:23:24,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:23:24,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:24,946 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-09 01:23:24,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:24,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946978863] [2025-03-09 01:23:24,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946978863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:24,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:24,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:23:24,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131190577] [2025-03-09 01:23:24,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:24,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:23:24,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:24,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:23:24,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:23:24,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-09 01:23:24,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 83 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:24,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:24,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-09 01:23:24,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:27,848 INFO L124 PetriNetUnfolderBase]: 37618/55592 cut-off events. [2025-03-09 01:23:27,848 INFO L125 PetriNetUnfolderBase]: For 51708/51729 co-relation queries the response was YES. [2025-03-09 01:23:27,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158109 conditions, 55592 events. 37618/55592 cut-off events. For 51708/51729 co-relation queries the response was YES. Maximal size of possible extension queue 2551. Compared 412893 event pairs, 7640 based on Foata normal form. 338/54391 useless extension candidates. Maximal degree in co-relation 103941. Up to 21496 conditions per place. [2025-03-09 01:23:28,110 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 134 selfloop transitions, 61 changer transitions 7/216 dead transitions. [2025-03-09 01:23:28,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 216 transitions, 1323 flow [2025-03-09 01:23:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:23:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:23:28,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 245 transitions. [2025-03-09 01:23:28,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6693989071038251 [2025-03-09 01:23:28,112 INFO L175 Difference]: Start difference. First operand has 72 places, 83 transitions, 391 flow. Second operand 6 states and 245 transitions. [2025-03-09 01:23:28,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 216 transitions, 1323 flow [2025-03-09 01:23:28,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 216 transitions, 1277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:28,137 INFO L231 Difference]: Finished difference. Result has 78 places, 120 transitions, 800 flow [2025-03-09 01:23:28,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=800, PETRI_PLACES=78, PETRI_TRANSITIONS=120} [2025-03-09 01:23:28,138 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2025-03-09 01:23:28,138 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 120 transitions, 800 flow [2025-03-09 01:23:28,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:28,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:28,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:28,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:23:28,139 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-09 01:23:28,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1456228624, now seen corresponding path program 4 times [2025-03-09 01:23:28,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:28,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441854940] [2025-03-09 01:23:28,140 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:23:28,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:28,149 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-09 01:23:28,168 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:23:28,168 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:23:28,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:28,423 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-09 01:23:28,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:28,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441854940] [2025-03-09 01:23:28,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441854940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:28,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:28,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:23:28,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379270439] [2025-03-09 01:23:28,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:28,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:23:28,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:28,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:23:28,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:23:28,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-09 01:23:28,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 120 transitions, 800 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:28,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:28,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-09 01:23:28,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:31,154 INFO L124 PetriNetUnfolderBase]: 32806/48702 cut-off events. [2025-03-09 01:23:31,154 INFO L125 PetriNetUnfolderBase]: For 91699/91761 co-relation queries the response was YES. [2025-03-09 01:23:31,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154386 conditions, 48702 events. 32806/48702 cut-off events. For 91699/91761 co-relation queries the response was YES. Maximal size of possible extension queue 2093. Compared 356526 event pairs, 8665 based on Foata normal form. 396/48031 useless extension candidates. Maximal degree in co-relation 108913. Up to 22365 conditions per place. [2025-03-09 01:23:31,353 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 130 selfloop transitions, 47 changer transitions 13/204 dead transitions. [2025-03-09 01:23:31,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 204 transitions, 1563 flow [2025-03-09 01:23:31,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:23:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:23:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 203 transitions. [2025-03-09 01:23:31,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6655737704918033 [2025-03-09 01:23:31,355 INFO L175 Difference]: Start difference. First operand has 78 places, 120 transitions, 800 flow. Second operand 5 states and 203 transitions. [2025-03-09 01:23:31,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 204 transitions, 1563 flow [2025-03-09 01:23:31,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 204 transitions, 1549 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-03-09 01:23:31,412 INFO L231 Difference]: Finished difference. Result has 84 places, 129 transitions, 1017 flow [2025-03-09 01:23:31,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1017, PETRI_PLACES=84, PETRI_TRANSITIONS=129} [2025-03-09 01:23:31,413 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 18 predicate places. [2025-03-09 01:23:31,413 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 129 transitions, 1017 flow [2025-03-09 01:23:31,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:31,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:31,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:31,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:23:31,414 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-09 01:23:31,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:31,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1900597092, now seen corresponding path program 5 times [2025-03-09 01:23:31,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:31,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593063184] [2025-03-09 01:23:31,415 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:23:31,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:31,423 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:23:31,429 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:23:31,432 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:23:31,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:31,540 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-09 01:23:31,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:31,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593063184] [2025-03-09 01:23:31,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593063184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:31,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:31,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:23:31,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764094253] [2025-03-09 01:23:31,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:31,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:23:31,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:31,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:23:31,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:23:31,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-09 01:23:31,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 129 transitions, 1017 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:31,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:31,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-09 01:23:31,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:33,751 INFO L124 PetriNetUnfolderBase]: 28563/41983 cut-off events. [2025-03-09 01:23:33,751 INFO L125 PetriNetUnfolderBase]: For 98595/98723 co-relation queries the response was YES. [2025-03-09 01:23:33,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142260 conditions, 41983 events. 28563/41983 cut-off events. For 98595/98723 co-relation queries the response was YES. Maximal size of possible extension queue 1957. Compared 297398 event pairs, 6315 based on Foata normal form. 450/41258 useless extension candidates. Maximal degree in co-relation 98150. Up to 16082 conditions per place. [2025-03-09 01:23:33,967 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 133 selfloop transitions, 72 changer transitions 11/230 dead transitions. [2025-03-09 01:23:33,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 230 transitions, 1878 flow [2025-03-09 01:23:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:23:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:23:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2025-03-09 01:23:33,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-09 01:23:33,969 INFO L175 Difference]: Start difference. First operand has 84 places, 129 transitions, 1017 flow. Second operand 6 states and 244 transitions. [2025-03-09 01:23:33,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 230 transitions, 1878 flow [2025-03-09 01:23:34,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 230 transitions, 1815 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:34,033 INFO L231 Difference]: Finished difference. Result has 88 places, 132 transitions, 1172 flow [2025-03-09 01:23:34,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1172, PETRI_PLACES=88, PETRI_TRANSITIONS=132} [2025-03-09 01:23:34,034 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 22 predicate places. [2025-03-09 01:23:34,034 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 132 transitions, 1172 flow [2025-03-09 01:23:34,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:34,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:34,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:34,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:23:34,034 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-09 01:23:34,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1840055250, now seen corresponding path program 6 times [2025-03-09 01:23:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:34,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371363955] [2025-03-09 01:23:34,035 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:23:34,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:34,044 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:23:34,050 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:23:34,051 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 01:23:34,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:34,161 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-09 01:23:34,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:34,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371363955] [2025-03-09 01:23:34,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371363955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:34,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:34,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:23:34,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348400193] [2025-03-09 01:23:34,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:34,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:23:34,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:34,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:23:34,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:23:34,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-09 01:23:34,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 132 transitions, 1172 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:34,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:34,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-09 01:23:34,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:37,047 INFO L124 PetriNetUnfolderBase]: 29093/43103 cut-off events. [2025-03-09 01:23:37,048 INFO L125 PetriNetUnfolderBase]: For 130644/130754 co-relation queries the response was YES. [2025-03-09 01:23:37,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152821 conditions, 43103 events. 29093/43103 cut-off events. For 130644/130754 co-relation queries the response was YES. Maximal size of possible extension queue 1995. Compared 309916 event pairs, 6852 based on Foata normal form. 453/42365 useless extension candidates. Maximal degree in co-relation 106076. Up to 16053 conditions per place. [2025-03-09 01:23:37,272 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 159 selfloop transitions, 91 changer transitions 6/270 dead transitions. [2025-03-09 01:23:37,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 270 transitions, 2384 flow [2025-03-09 01:23:37,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:23:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:23:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 312 transitions. [2025-03-09 01:23:37,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.639344262295082 [2025-03-09 01:23:37,274 INFO L175 Difference]: Start difference. First operand has 88 places, 132 transitions, 1172 flow. Second operand 8 states and 312 transitions. [2025-03-09 01:23:37,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 270 transitions, 2384 flow [2025-03-09 01:23:37,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 270 transitions, 2195 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-09 01:23:37,386 INFO L231 Difference]: Finished difference. Result has 92 places, 151 transitions, 1487 flow [2025-03-09 01:23:37,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1487, PETRI_PLACES=92, PETRI_TRANSITIONS=151} [2025-03-09 01:23:37,386 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 26 predicate places. [2025-03-09 01:23:37,386 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 151 transitions, 1487 flow [2025-03-09 01:23:37,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:37,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:37,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:37,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:23:37,389 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-09 01:23:37,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:37,390 INFO L85 PathProgramCache]: Analyzing trace with hash 664964088, now seen corresponding path program 1 times [2025-03-09 01:23:37,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:37,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317133957] [2025-03-09 01:23:37,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:23:37,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:37,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:23:37,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:23:37,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:37,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:37,500 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-09 01:23:37,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:37,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317133957] [2025-03-09 01:23:37,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317133957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:37,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:37,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:23:37,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747047224] [2025-03-09 01:23:37,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:37,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:23:37,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:37,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:23:37,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:23:37,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-09 01:23:37,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 151 transitions, 1487 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:37,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:37,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-09 01:23:37,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:39,812 INFO L124 PetriNetUnfolderBase]: 25572/38349 cut-off events. [2025-03-09 01:23:39,812 INFO L125 PetriNetUnfolderBase]: For 114743/114811 co-relation queries the response was YES. [2025-03-09 01:23:39,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136419 conditions, 38349 events. 25572/38349 cut-off events. For 114743/114811 co-relation queries the response was YES. Maximal size of possible extension queue 1736. Compared 277142 event pairs, 6181 based on Foata normal form. 738/38103 useless extension candidates. Maximal degree in co-relation 98236. Up to 14423 conditions per place. [2025-03-09 01:23:40,153 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 154 selfloop transitions, 98 changer transitions 29/295 dead transitions. [2025-03-09 01:23:40,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 295 transitions, 2797 flow [2025-03-09 01:23:40,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:23:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:23:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 316 transitions. [2025-03-09 01:23:40,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6475409836065574 [2025-03-09 01:23:40,155 INFO L175 Difference]: Start difference. First operand has 92 places, 151 transitions, 1487 flow. Second operand 8 states and 316 transitions. [2025-03-09 01:23:40,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 295 transitions, 2797 flow [2025-03-09 01:23:40,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 295 transitions, 2654 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:23:40,248 INFO L231 Difference]: Finished difference. Result has 98 places, 158 transitions, 1681 flow [2025-03-09 01:23:40,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1681, PETRI_PLACES=98, PETRI_TRANSITIONS=158} [2025-03-09 01:23:40,249 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 32 predicate places. [2025-03-09 01:23:40,249 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 158 transitions, 1681 flow [2025-03-09 01:23:40,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:40,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:40,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:40,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:23:40,249 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-09 01:23:40,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:40,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2071737390, now seen corresponding path program 7 times [2025-03-09 01:23:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:40,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988250023] [2025-03-09 01:23:40,250 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:23:40,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:40,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:23:40,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:23:40,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:23:40,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:40,353 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-09 01:23:40,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:40,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988250023] [2025-03-09 01:23:40,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988250023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:40,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:40,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:23:40,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943403723] [2025-03-09 01:23:40,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:40,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:23:40,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:40,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:23:40,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:23:40,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-09 01:23:40,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 158 transitions, 1681 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:40,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:40,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-09 01:23:40,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:42,466 INFO L124 PetriNetUnfolderBase]: 18461/28357 cut-off events. [2025-03-09 01:23:42,466 INFO L125 PetriNetUnfolderBase]: For 90454/90522 co-relation queries the response was YES. [2025-03-09 01:23:42,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102225 conditions, 28357 events. 18461/28357 cut-off events. For 90454/90522 co-relation queries the response was YES. Maximal size of possible extension queue 1198. Compared 202328 event pairs, 4723 based on Foata normal form. 276/28119 useless extension candidates. Maximal degree in co-relation 79535. Up to 10430 conditions per place. [2025-03-09 01:23:42,606 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 134 selfloop transitions, 108 changer transitions 27/283 dead transitions. [2025-03-09 01:23:42,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 283 transitions, 3009 flow [2025-03-09 01:23:42,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:23:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:23:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 301 transitions. [2025-03-09 01:23:42,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6168032786885246 [2025-03-09 01:23:42,608 INFO L175 Difference]: Start difference. First operand has 98 places, 158 transitions, 1681 flow. Second operand 8 states and 301 transitions. [2025-03-09 01:23:42,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 283 transitions, 3009 flow [2025-03-09 01:23:42,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 283 transitions, 2964 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:42,695 INFO L231 Difference]: Finished difference. Result has 105 places, 166 transitions, 2031 flow [2025-03-09 01:23:42,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2031, PETRI_PLACES=105, PETRI_TRANSITIONS=166} [2025-03-09 01:23:42,696 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 39 predicate places. [2025-03-09 01:23:42,696 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 166 transitions, 2031 flow [2025-03-09 01:23:42,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:42,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:42,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, 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-09 01:23:42,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:23:42,696 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-09 01:23:42,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:42,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1280601850, now seen corresponding path program 8 times [2025-03-09 01:23:42,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:42,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513830348] [2025-03-09 01:23:42,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:23:42,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:42,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:23:42,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:23:42,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:23:42,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:42,810 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-09 01:23:42,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:42,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513830348] [2025-03-09 01:23:42,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513830348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:42,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:42,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:23:42,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787874391] [2025-03-09 01:23:42,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:42,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:23:42,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:42,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:23:42,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:23:42,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-09 01:23:42,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 166 transitions, 2031 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:42,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:42,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-09 01:23:42,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:44,825 INFO L124 PetriNetUnfolderBase]: 17882/27502 cut-off events. [2025-03-09 01:23:44,825 INFO L125 PetriNetUnfolderBase]: For 104699/104715 co-relation queries the response was YES. [2025-03-09 01:23:44,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100733 conditions, 27502 events. 17882/27502 cut-off events. For 104699/104715 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 195903 event pairs, 4541 based on Foata normal form. 64/27036 useless extension candidates. Maximal degree in co-relation 76758. Up to 10550 conditions per place. [2025-03-09 01:23:44,973 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 116 selfloop transitions, 140 changer transitions 17/287 dead transitions. [2025-03-09 01:23:44,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 287 transitions, 3333 flow [2025-03-09 01:23:44,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:23:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:23:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 285 transitions. [2025-03-09 01:23:44,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5840163934426229 [2025-03-09 01:23:44,974 INFO L175 Difference]: Start difference. First operand has 105 places, 166 transitions, 2031 flow. Second operand 8 states and 285 transitions. [2025-03-09 01:23:44,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 287 transitions, 3333 flow [2025-03-09 01:23:45,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 287 transitions, 3274 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:23:45,087 INFO L231 Difference]: Finished difference. Result has 111 places, 192 transitions, 2611 flow [2025-03-09 01:23:45,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2611, PETRI_PLACES=111, PETRI_TRANSITIONS=192} [2025-03-09 01:23:45,088 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 45 predicate places. [2025-03-09 01:23:45,088 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 192 transitions, 2611 flow [2025-03-09 01:23:45,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:45,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:45,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:45,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:23:45,088 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-09 01:23:45,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1736607420, now seen corresponding path program 9 times [2025-03-09 01:23:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:45,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692835217] [2025-03-09 01:23:45,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:23:45,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:45,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:23:45,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:23:45,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:23:45,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:45,177 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-09 01:23:45,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:45,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692835217] [2025-03-09 01:23:45,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692835217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:45,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:45,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:23:45,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914766302] [2025-03-09 01:23:45,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:45,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:23:45,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:45,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:23:45,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:23:45,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-09 01:23:45,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 192 transitions, 2611 flow. Second operand has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:45,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:45,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-09 01:23:45,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:47,574 INFO L124 PetriNetUnfolderBase]: 16869/25955 cut-off events. [2025-03-09 01:23:47,575 INFO L125 PetriNetUnfolderBase]: For 122667/122679 co-relation queries the response was YES. [2025-03-09 01:23:47,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97660 conditions, 25955 events. 16869/25955 cut-off events. For 122667/122679 co-relation queries the response was YES. Maximal size of possible extension queue 1156. Compared 183912 event pairs, 4275 based on Foata normal form. 316/25737 useless extension candidates. Maximal degree in co-relation 73484. Up to 9744 conditions per place. [2025-03-09 01:23:47,674 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 151 selfloop transitions, 146 changer transitions 29/340 dead transitions. [2025-03-09 01:23:47,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 340 transitions, 4060 flow [2025-03-09 01:23:47,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:23:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:23:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 400 transitions. [2025-03-09 01:23:47,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546448087431694 [2025-03-09 01:23:47,679 INFO L175 Difference]: Start difference. First operand has 111 places, 192 transitions, 2611 flow. Second operand 12 states and 400 transitions. [2025-03-09 01:23:47,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 340 transitions, 4060 flow [2025-03-09 01:23:47,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 340 transitions, 3823 flow, removed 30 selfloop flow, removed 5 redundant places. [2025-03-09 01:23:47,809 INFO L231 Difference]: Finished difference. Result has 119 places, 198 transitions, 2784 flow [2025-03-09 01:23:47,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2420, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2784, PETRI_PLACES=119, PETRI_TRANSITIONS=198} [2025-03-09 01:23:47,810 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 53 predicate places. [2025-03-09 01:23:47,810 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 198 transitions, 2784 flow [2025-03-09 01:23:47,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:47,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:47,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:47,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:23:47,810 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-09 01:23:47,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:47,811 INFO L85 PathProgramCache]: Analyzing trace with hash -105139074, now seen corresponding path program 10 times [2025-03-09 01:23:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:47,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233643066] [2025-03-09 01:23:47,811 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:23:47,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:47,816 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-09 01:23:47,822 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:23:47,822 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:23:47,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:47,932 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-09 01:23:47,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:47,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233643066] [2025-03-09 01:23:47,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233643066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:47,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:47,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:23:47,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35731736] [2025-03-09 01:23:47,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:47,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:23:47,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:47,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:23:47,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:23:47,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-09 01:23:47,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 198 transitions, 2784 flow. Second operand has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:47,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:47,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-09 01:23:47,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:50,165 INFO L124 PetriNetUnfolderBase]: 16973/26202 cut-off events. [2025-03-09 01:23:50,165 INFO L125 PetriNetUnfolderBase]: For 151353/151365 co-relation queries the response was YES. [2025-03-09 01:23:50,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103111 conditions, 26202 events. 16973/26202 cut-off events. For 151353/151365 co-relation queries the response was YES. Maximal size of possible extension queue 1167. Compared 187114 event pairs, 4598 based on Foata normal form. 120/25776 useless extension candidates. Maximal degree in co-relation 77307. Up to 9989 conditions per place. [2025-03-09 01:23:50,274 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 121 selfloop transitions, 122 changer transitions 71/328 dead transitions. [2025-03-09 01:23:50,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 328 transitions, 4159 flow [2025-03-09 01:23:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:23:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:23:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 390 transitions. [2025-03-09 01:23:50,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5327868852459017 [2025-03-09 01:23:50,277 INFO L175 Difference]: Start difference. First operand has 119 places, 198 transitions, 2784 flow. Second operand 12 states and 390 transitions. [2025-03-09 01:23:50,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 328 transitions, 4159 flow [2025-03-09 01:23:50,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 328 transitions, 4027 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 01:23:50,444 INFO L231 Difference]: Finished difference. Result has 129 places, 174 transitions, 2450 flow [2025-03-09 01:23:50,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2666, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2450, PETRI_PLACES=129, PETRI_TRANSITIONS=174} [2025-03-09 01:23:50,445 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 63 predicate places. [2025-03-09 01:23:50,445 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 174 transitions, 2450 flow [2025-03-09 01:23:50,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:50,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:50,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:50,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:23:50,446 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-09 01:23:50,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:50,446 INFO L85 PathProgramCache]: Analyzing trace with hash 868381400, now seen corresponding path program 2 times [2025-03-09 01:23:50,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:50,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238820120] [2025-03-09 01:23:50,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:23:50,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:50,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:23:50,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:23:50,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:23:50,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:50,556 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-09 01:23:50,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:50,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238820120] [2025-03-09 01:23:50,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238820120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:50,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:50,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:23:50,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136505300] [2025-03-09 01:23:50,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:50,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:23:50,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:50,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:23:50,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:23:50,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-09 01:23:50,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 174 transitions, 2450 flow. Second operand has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:50,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:50,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-09 01:23:50,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:52,855 INFO L124 PetriNetUnfolderBase]: 16285/25115 cut-off events. [2025-03-09 01:23:52,855 INFO L125 PetriNetUnfolderBase]: For 162007/162007 co-relation queries the response was YES. [2025-03-09 01:23:52,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100404 conditions, 25115 events. 16285/25115 cut-off events. For 162007/162007 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 177766 event pairs, 4570 based on Foata normal form. 298/24907 useless extension candidates. Maximal degree in co-relation 74548. Up to 9677 conditions per place. [2025-03-09 01:23:52,966 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 143 selfloop transitions, 122 changer transitions 42/321 dead transitions. [2025-03-09 01:23:52,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 321 transitions, 3880 flow [2025-03-09 01:23:52,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:23:52,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:23:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 401 transitions. [2025-03-09 01:23:52,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5478142076502732 [2025-03-09 01:23:52,969 INFO L175 Difference]: Start difference. First operand has 129 places, 174 transitions, 2450 flow. Second operand 12 states and 401 transitions. [2025-03-09 01:23:52,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 321 transitions, 3880 flow [2025-03-09 01:23:53,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 321 transitions, 3562 flow, removed 18 selfloop flow, removed 9 redundant places. [2025-03-09 01:23:53,147 INFO L231 Difference]: Finished difference. Result has 130 places, 173 transitions, 2400 flow [2025-03-09 01:23:53,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2187, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2400, PETRI_PLACES=130, PETRI_TRANSITIONS=173} [2025-03-09 01:23:53,147 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 64 predicate places. [2025-03-09 01:23:53,147 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 173 transitions, 2400 flow [2025-03-09 01:23:53,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:53,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:23:53,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:23:53,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:23:53,149 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-09 01:23:53,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:23:53,149 INFO L85 PathProgramCache]: Analyzing trace with hash 592712484, now seen corresponding path program 2 times [2025-03-09 01:23:53,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:23:53,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267562984] [2025-03-09 01:23:53,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:23:53,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:23:53,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:23:53,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:23:53,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:23:53,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:23:53,246 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-09 01:23:53,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:23:53,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267562984] [2025-03-09 01:23:53,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267562984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:23:53,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:23:53,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:23:53,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974182842] [2025-03-09 01:23:53,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:23:53,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:23:53,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:23:53,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:23:53,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:23:53,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 61 [2025-03-09 01:23:53,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 173 transitions, 2400 flow. Second operand has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:53,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:23:53,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 61 [2025-03-09 01:23:53,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:23:54,058 INFO L124 PetriNetUnfolderBase]: 4189/7049 cut-off events. [2025-03-09 01:23:54,058 INFO L125 PetriNetUnfolderBase]: For 36698/36698 co-relation queries the response was YES. [2025-03-09 01:23:54,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29416 conditions, 7049 events. 4189/7049 cut-off events. For 36698/36698 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 45467 event pairs, 1243 based on Foata normal form. 664/7713 useless extension candidates. Maximal degree in co-relation 29355. Up to 2444 conditions per place. [2025-03-09 01:23:54,076 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 0 selfloop transitions, 0 changer transitions 232/232 dead transitions. [2025-03-09 01:23:54,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 232 transitions, 2927 flow [2025-03-09 01:23:54,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:23:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:23:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 359 transitions. [2025-03-09 01:23:54,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49043715846994534 [2025-03-09 01:23:54,078 INFO L175 Difference]: Start difference. First operand has 130 places, 173 transitions, 2400 flow. Second operand 12 states and 359 transitions. [2025-03-09 01:23:54,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 232 transitions, 2927 flow [2025-03-09 01:23:54,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 232 transitions, 2839 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-09 01:23:54,111 INFO L231 Difference]: Finished difference. Result has 130 places, 0 transitions, 0 flow [2025-03-09 01:23:54,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1903, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=130, PETRI_TRANSITIONS=0} [2025-03-09 01:23:54,112 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 64 predicate places. [2025-03-09 01:23:54,112 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 0 transitions, 0 flow [2025-03-09 01:23:54,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:23:54,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-03-09 01:23:54,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-09 01:23:54,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-09 01:23:54,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-09 01:23:54,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-09 01:23:54,114 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-03-09 01:23:54,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:23:54,115 INFO L422 BasicCegarLoop]: Path program histogram: [10, 2, 2, 1] [2025-03-09 01:23:54,118 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:23:54,118 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:23:54,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:23:54 BasicIcfg [2025-03-09 01:23:54,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:23:54,123 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:23:54,123 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:23:54,123 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:23:54,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:23:14" (3/4) ... [2025-03-09 01:23:54,125 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:23:54,127 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-09 01:23:54,127 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-09 01:23:54,127 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-09 01:23:54,127 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-09 01:23:54,129 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-03-09 01:23:54,131 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-09 01:23:54,131 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-09 01:23:54,131 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:23:54,182 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:23:54,182 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:23:54,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:23:54,183 INFO L158 Benchmark]: Toolchain (without parser) took 40652.19ms. Allocated memory was 142.6MB in the beginning and 9.9GB in the end (delta: 9.7GB). Free memory was 114.3MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2025-03-09 01:23:54,183 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:23:54,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.42ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 102.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:23:54,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.25ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:23:54,184 INFO L158 Benchmark]: Boogie Preprocessor took 39.52ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:23:54,184 INFO L158 Benchmark]: IcfgBuilder took 500.24ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 64.7MB in the end (delta: 34.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:23:54,184 INFO L158 Benchmark]: TraceAbstraction took 39831.85ms. Allocated memory was 142.6MB in the beginning and 9.9GB in the end (delta: 9.7GB). Free memory was 63.7MB in the beginning and 7.6GB in the end (delta: -7.6GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2025-03-09 01:23:54,184 INFO L158 Benchmark]: Witness Printer took 59.49ms. Allocated memory is still 9.9GB. Free memory was 7.6GB in the beginning and 7.6GB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:23:54,185 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.42ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 102.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.25ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.52ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 500.24ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 64.7MB in the end (delta: 34.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 39831.85ms. Allocated memory was 142.6MB in the beginning and 9.9GB in the end (delta: 9.7GB). Free memory was 63.7MB in the beginning and 7.6GB in the end (delta: -7.6GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 59.49ms. Allocated memory is still 9.9GB. Free memory was 7.6GB in the beginning and 7.6GB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 81]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 95 locations, 100 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 39.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 37.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1314 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1309 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4978 IncrementalHoareTripleChecker+Invalid, 5266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 0 mSDtfsCounter, 4978 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2784occurred in iteration=12, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 734 NumberOfCodeBlocks, 734 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 719 ConstructedInterpolants, 0 QuantifiedInterpolants, 1787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 01:23:54,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE