./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/bench-exp2x9.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/bench-exp2x9.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 af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:18:04,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:18:04,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:18:04,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:18:04,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:18:04,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:18:04,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:18:04,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:18:04,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:18:04,651 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:18:04,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:18:04,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:18:04,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:18:04,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:18:04,652 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:18:04,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:18:04,652 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:18:04,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:18:04,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:18:04,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:18:04,652 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:18:04,652 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:18:04,652 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:18:04,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:18:04,653 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:18:04,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:18:04,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:18:04,653 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 -> af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 [2025-03-09 01:18:04,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:18:04,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:18:04,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:18:04,863 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:18:04,863 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:18:04,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2025-03-09 01:18:05,970 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769af65ef/b58013f4e4e741f28db89c9271c99919/FLAGf8be318e0 [2025-03-09 01:18:06,177 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:18:06,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2025-03-09 01:18:06,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769af65ef/b58013f4e4e741f28db89c9271c99919/FLAGf8be318e0 [2025-03-09 01:18:06,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769af65ef/b58013f4e4e741f28db89c9271c99919 [2025-03-09 01:18:06,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:18:06,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:18:06,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:18:06,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:18:06,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:18:06,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:18:06" (1/1) ... [2025-03-09 01:18:06,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7deeaa03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:18:06, skipping insertion in model container [2025-03-09 01:18:06,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:18:06" (1/1) ... [2025-03-09 01:18:06,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:18:06,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:18:06,391 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:18:06,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:18:06,423 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:18:06,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:18:06 WrapperNode [2025-03-09 01:18:06,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:18:06,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:18:06,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:18:06,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:18:06,430 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:18:06" (1/1) ... [2025-03-09 01:18:06,435 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:18:06" (1/1) ... [2025-03-09 01:18:06,450 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2025-03-09 01:18:06,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:18:06,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:18:06,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:18:06,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:18:06,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:18:06" (1/1) ... [2025-03-09 01:18:06,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:18:06" (1/1) ... [2025-03-09 01:18:06,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:18:06" (1/1) ... [2025-03-09 01:18:06,473 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:18:06,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:18:06" (1/1) ... [2025-03-09 01:18:06,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:18:06" (1/1) ... [2025-03-09 01:18:06,480 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:18:06" (1/1) ... [2025-03-09 01:18:06,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:18:06" (1/1) ... [2025-03-09 01:18:06,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:18:06" (1/1) ... [2025-03-09 01:18:06,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:18:06" (1/1) ... [2025-03-09 01:18:06,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:18:06,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:18:06,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:18:06,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:18:06,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:18:06" (1/1) ... [2025-03-09 01:18:06,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:18:06,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:18:06,509 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:18:06,512 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:18:06,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:18:06,528 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:18:06,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:18:06,529 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:18:06,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:18:06,529 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:18:06,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:18:06,530 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-09 01:18:06,530 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-09 01:18:06,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:18:06,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:18:06,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:18:06,531 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:18:06,588 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:18:06,590 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:18:06,753 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:18:06,753 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:18:06,881 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:18:06,881 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:18:06,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:18:06 BoogieIcfgContainer [2025-03-09 01:18:06,881 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:18:06,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:18:06,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:18:06,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:18:06,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:18:06" (1/3) ... [2025-03-09 01:18:06,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ceb94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:18:06, skipping insertion in model container [2025-03-09 01:18:06,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:18:06" (2/3) ... [2025-03-09 01:18:06,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ceb94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:18:06, skipping insertion in model container [2025-03-09 01:18:06,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:18:06" (3/3) ... [2025-03-09 01:18:06,890 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2025-03-09 01:18:06,899 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:18:06,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x9.wvr.c that has 5 procedures, 31 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-03-09 01:18:06,901 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:18:06,946 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 01:18:06,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 96 flow [2025-03-09 01:18:07,002 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-09 01:18:07,003 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:18:07,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 30 events. 4/30 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-09 01:18:07,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 34 transitions, 96 flow [2025-03-09 01:18:07,010 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 29 transitions, 82 flow [2025-03-09 01:18:07,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:18:07,027 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;@29e2c7dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:18:07,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 01:18:07,042 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:18:07,042 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-03-09 01:18:07,042 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:18:07,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:07,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:18:07,043 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:18:07,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:07,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1816907691, now seen corresponding path program 1 times [2025-03-09 01:18:07,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:07,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929285196] [2025-03-09 01:18:07,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:07,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:07,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:18:07,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:18:07,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:07,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:07,440 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:18:07,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:07,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929285196] [2025-03-09 01:18:07,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929285196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:18:07,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:18:07,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:18:07,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827760904] [2025-03-09 01:18:07,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:18:07,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:18:07,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:07,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:18:07,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:18:07,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:07,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:18:07,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:07,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:07,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:07,736 INFO L124 PetriNetUnfolderBase]: 1367/1732 cut-off events. [2025-03-09 01:18:07,737 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2025-03-09 01:18:07,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 1732 events. 1367/1732 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5575 event pairs, 123 based on Foata normal form. 2/1003 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2025-03-09 01:18:07,750 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 35 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2025-03-09 01:18:07,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 219 flow [2025-03-09 01:18:07,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:18:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:18:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-09 01:18:07,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2025-03-09 01:18:07,761 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 82 flow. Second operand 3 states and 73 transitions. [2025-03-09 01:18:07,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 219 flow [2025-03-09 01:18:07,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 01:18:07,770 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 95 flow [2025-03-09 01:18:07,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2025-03-09 01:18:07,774 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -7 predicate places. [2025-03-09 01:18:07,775 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 95 flow [2025-03-09 01:18:07,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:18:07,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:07,775 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] [2025-03-09 01:18:07,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:18:07,776 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:18:07,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:07,777 INFO L85 PathProgramCache]: Analyzing trace with hash 808530164, now seen corresponding path program 1 times [2025-03-09 01:18:07,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:07,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454397440] [2025-03-09 01:18:07,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:07,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:07,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:18:07,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:07,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:07,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:07,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:07,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454397440] [2025-03-09 01:18:07,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454397440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:18:07,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:18:07,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:18:07,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902525113] [2025-03-09 01:18:07,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:18:07,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:18:07,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:07,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:18:07,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:18:07,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:07,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:18:07,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:07,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:07,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:08,123 INFO L124 PetriNetUnfolderBase]: 1575/2020 cut-off events. [2025-03-09 01:18:08,123 INFO L125 PetriNetUnfolderBase]: For 572/572 co-relation queries the response was YES. [2025-03-09 01:18:08,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5016 conditions, 2020 events. 1575/2020 cut-off events. For 572/572 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7005 event pairs, 94 based on Foata normal form. 46/2066 useless extension candidates. Maximal degree in co-relation 1261. Up to 827 conditions per place. [2025-03-09 01:18:08,134 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 65 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2025-03-09 01:18:08,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 80 transitions, 387 flow [2025-03-09 01:18:08,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-03-09 01:18:08,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-09 01:18:08,137 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 95 flow. Second operand 5 states and 119 transitions. [2025-03-09 01:18:08,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 80 transitions, 387 flow [2025-03-09 01:18:08,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 80 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:18:08,138 INFO L231 Difference]: Finished difference. Result has 36 places, 38 transitions, 155 flow [2025-03-09 01:18:08,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=36, PETRI_TRANSITIONS=38} [2025-03-09 01:18:08,139 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-03-09 01:18:08,139 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 38 transitions, 155 flow [2025-03-09 01:18:08,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:18:08,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:08,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:18:08,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:18:08,140 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:18:08,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash 959915596, now seen corresponding path program 1 times [2025-03-09 01:18:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:08,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502523786] [2025-03-09 01:18:08,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:08,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:08,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:18:08,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:08,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:08,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:08,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:08,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502523786] [2025-03-09 01:18:08,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502523786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:18:08,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620287747] [2025-03-09 01:18:08,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:08,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:08,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:18:08,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:18:08,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:18:08,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:18:08,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:08,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:08,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:08,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:18:08,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:18:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:08,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:18:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:08,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620287747] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:18:08,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:18:08,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:18:08,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366929397] [2025-03-09 01:18:08,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:18:08,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:18:08,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:08,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:18:08,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:18:08,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:08,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:08,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:08,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:08,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:08,708 INFO L124 PetriNetUnfolderBase]: 1907/2535 cut-off events. [2025-03-09 01:18:08,708 INFO L125 PetriNetUnfolderBase]: For 3316/3318 co-relation queries the response was YES. [2025-03-09 01:18:08,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7850 conditions, 2535 events. 1907/2535 cut-off events. For 3316/3318 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 10163 event pairs, 284 based on Foata normal form. 64/2595 useless extension candidates. Maximal degree in co-relation 3599. Up to 1049 conditions per place. [2025-03-09 01:18:08,720 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 79 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2025-03-09 01:18:08,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 92 transitions, 571 flow [2025-03-09 01:18:08,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:08,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-09 01:18:08,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6647058823529411 [2025-03-09 01:18:08,723 INFO L175 Difference]: Start difference. First operand has 36 places, 38 transitions, 155 flow. Second operand 5 states and 113 transitions. [2025-03-09 01:18:08,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 92 transitions, 571 flow [2025-03-09 01:18:08,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 92 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:18:08,727 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 210 flow [2025-03-09 01:18:08,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2025-03-09 01:18:08,728 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-03-09 01:18:08,728 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 210 flow [2025-03-09 01:18:08,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:08,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:08,729 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] [2025-03-09 01:18:08,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:18:08,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:08,929 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:18:08,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1919278442, now seen corresponding path program 1 times [2025-03-09 01:18:08,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:08,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277591365] [2025-03-09 01:18:08,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:08,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:08,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:18:08,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:08,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:08,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:09,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:09,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277591365] [2025-03-09 01:18:09,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277591365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:18:09,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489449951] [2025-03-09 01:18:09,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:09,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:09,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:18:09,006 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:18:09,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:18:09,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:18:09,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:09,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:09,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:09,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:18:09,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:18:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:09,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:18:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:09,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489449951] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:18:09,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:18:09,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:18:09,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910237733] [2025-03-09 01:18:09,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:18:09,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:18:09,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:09,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:18:09,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:18:09,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:09,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:09,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:09,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:09,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:09,488 INFO L124 PetriNetUnfolderBase]: 2058/2787 cut-off events. [2025-03-09 01:18:09,488 INFO L125 PetriNetUnfolderBase]: For 4804/4820 co-relation queries the response was YES. [2025-03-09 01:18:09,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10271 conditions, 2787 events. 2058/2787 cut-off events. For 4804/4820 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 12056 event pairs, 434 based on Foata normal form. 94/2881 useless extension candidates. Maximal degree in co-relation 5289. Up to 1360 conditions per place. [2025-03-09 01:18:09,509 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 87 selfloop transitions, 10 changer transitions 0/102 dead transitions. [2025-03-09 01:18:09,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 102 transitions, 670 flow [2025-03-09 01:18:09,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-03-09 01:18:09,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7235294117647059 [2025-03-09 01:18:09,512 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 210 flow. Second operand 5 states and 123 transitions. [2025-03-09 01:18:09,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 102 transitions, 670 flow [2025-03-09 01:18:09,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 102 transitions, 670 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:18:09,525 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 266 flow [2025-03-09 01:18:09,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2025-03-09 01:18:09,526 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-03-09 01:18:09,527 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 266 flow [2025-03-09 01:18:09,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:09,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:09,527 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] [2025-03-09 01:18:09,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:18:09,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 01:18:09,730 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:18:09,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:09,731 INFO L85 PathProgramCache]: Analyzing trace with hash -935875754, now seen corresponding path program 1 times [2025-03-09 01:18:09,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:09,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496067772] [2025-03-09 01:18:09,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:09,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:09,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:18:09,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:09,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:09,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:09,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:09,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496067772] [2025-03-09 01:18:09,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496067772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:18:09,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:18:09,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:18:09,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035950524] [2025-03-09 01:18:09,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:18:09,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:18:09,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:09,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:18:09,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:18:09,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:09,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:18:09,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:09,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:09,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:10,076 INFO L124 PetriNetUnfolderBase]: 2018/2754 cut-off events. [2025-03-09 01:18:10,077 INFO L125 PetriNetUnfolderBase]: For 7712/7719 co-relation queries the response was YES. [2025-03-09 01:18:10,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11108 conditions, 2754 events. 2018/2754 cut-off events. For 7712/7719 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 11479 event pairs, 82 based on Foata normal form. 41/2791 useless extension candidates. Maximal degree in co-relation 6742. Up to 1153 conditions per place. [2025-03-09 01:18:10,095 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 93 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2025-03-09 01:18:10,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 108 transitions, 863 flow [2025-03-09 01:18:10,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-09 01:18:10,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6529411764705882 [2025-03-09 01:18:10,097 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 266 flow. Second operand 5 states and 111 transitions. [2025-03-09 01:18:10,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 108 transitions, 863 flow [2025-03-09 01:18:10,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 834 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-09 01:18:10,104 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 318 flow [2025-03-09 01:18:10,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-03-09 01:18:10,108 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-03-09 01:18:10,109 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 318 flow [2025-03-09 01:18:10,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:18:10,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:10,109 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] [2025-03-09 01:18:10,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:18:10,109 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:18:10,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:10,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1228785884, now seen corresponding path program 2 times [2025-03-09 01:18:10,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:10,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109268036] [2025-03-09 01:18:10,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:18:10,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:10,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:18:10,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:10,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:18:10,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:10,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:10,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109268036] [2025-03-09 01:18:10,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109268036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:18:10,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:18:10,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:18:10,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287192174] [2025-03-09 01:18:10,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:18:10,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:18:10,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:10,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:18:10,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:18:10,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:10,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:18:10,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:10,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:10,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:10,395 INFO L124 PetriNetUnfolderBase]: 1819/2469 cut-off events. [2025-03-09 01:18:10,395 INFO L125 PetriNetUnfolderBase]: For 7213/7219 co-relation queries the response was YES. [2025-03-09 01:18:10,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10582 conditions, 2469 events. 1819/2469 cut-off events. For 7213/7219 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9900 event pairs, 108 based on Foata normal form. 38/2503 useless extension candidates. Maximal degree in co-relation 6482. Up to 1016 conditions per place. [2025-03-09 01:18:10,412 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 90 selfloop transitions, 9 changer transitions 2/106 dead transitions. [2025-03-09 01:18:10,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 106 transitions, 843 flow [2025-03-09 01:18:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-09 01:18:10,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6529411764705882 [2025-03-09 01:18:10,413 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 318 flow. Second operand 5 states and 111 transitions. [2025-03-09 01:18:10,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 106 transitions, 843 flow [2025-03-09 01:18:10,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 106 transitions, 830 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-09 01:18:10,422 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 318 flow [2025-03-09 01:18:10,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-03-09 01:18:10,423 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2025-03-09 01:18:10,423 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 318 flow [2025-03-09 01:18:10,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:18:10,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:10,423 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] [2025-03-09 01:18:10,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:18:10,423 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:18:10,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:10,423 INFO L85 PathProgramCache]: Analyzing trace with hash -428731644, now seen corresponding path program 2 times [2025-03-09 01:18:10,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:10,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506583014] [2025-03-09 01:18:10,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:18:10,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:10,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:18:10,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:10,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:18:10,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:10,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:10,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506583014] [2025-03-09 01:18:10,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506583014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:18:10,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349791633] [2025-03-09 01:18:10,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:18:10,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:10,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:18:10,499 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:18:10,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:18:10,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:18:10,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:10,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:18:10,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:10,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:18:10,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:18:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:10,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:18:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:10,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349791633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:18:10,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:18:10,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:18:10,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672374586] [2025-03-09 01:18:10,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:18:10,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:18:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:10,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:18:10,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:18:10,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:10,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:18:10,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:10,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:10,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:10,957 INFO L124 PetriNetUnfolderBase]: 1745/2409 cut-off events. [2025-03-09 01:18:10,958 INFO L125 PetriNetUnfolderBase]: For 7475/7481 co-relation queries the response was YES. [2025-03-09 01:18:10,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10642 conditions, 2409 events. 1745/2409 cut-off events. For 7475/7481 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10232 event pairs, 303 based on Foata normal form. 75/2480 useless extension candidates. Maximal degree in co-relation 6749. Up to 1314 conditions per place. [2025-03-09 01:18:10,971 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2025-03-09 01:18:10,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 104 transitions, 855 flow [2025-03-09 01:18:10,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-09 01:18:10,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2025-03-09 01:18:10,972 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 318 flow. Second operand 5 states and 108 transitions. [2025-03-09 01:18:10,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 104 transitions, 855 flow [2025-03-09 01:18:10,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 104 transitions, 846 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:18:10,979 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 359 flow [2025-03-09 01:18:10,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2025-03-09 01:18:10,981 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2025-03-09 01:18:10,981 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 359 flow [2025-03-09 01:18:10,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:18:10,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:10,981 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] [2025-03-09 01:18:10,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:18:11,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:11,182 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:18:11,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:11,182 INFO L85 PathProgramCache]: Analyzing trace with hash -491358570, now seen corresponding path program 2 times [2025-03-09 01:18:11,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:11,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290874465] [2025-03-09 01:18:11,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:18:11,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:11,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:18:11,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:11,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:18:11,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:11,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:11,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290874465] [2025-03-09 01:18:11,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290874465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:18:11,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:18:11,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:18:11,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229849676] [2025-03-09 01:18:11,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:18:11,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:18:11,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:11,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:18:11,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:18:11,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:11,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 359 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:18:11,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:11,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:11,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:11,442 INFO L124 PetriNetUnfolderBase]: 1515/2042 cut-off events. [2025-03-09 01:18:11,442 INFO L125 PetriNetUnfolderBase]: For 7245/7249 co-relation queries the response was YES. [2025-03-09 01:18:11,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9644 conditions, 2042 events. 1515/2042 cut-off events. For 7245/7249 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8070 event pairs, 89 based on Foata normal form. 35/2077 useless extension candidates. Maximal degree in co-relation 8495. Up to 864 conditions per place. [2025-03-09 01:18:11,454 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 108 selfloop transitions, 9 changer transitions 4/126 dead transitions. [2025-03-09 01:18:11,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 126 transitions, 1072 flow [2025-03-09 01:18:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-03-09 01:18:11,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-09 01:18:11,456 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 359 flow. Second operand 5 states and 119 transitions. [2025-03-09 01:18:11,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 126 transitions, 1072 flow [2025-03-09 01:18:11,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 126 transitions, 1014 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-03-09 01:18:11,464 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 354 flow [2025-03-09 01:18:11,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=354, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2025-03-09 01:18:11,466 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 27 predicate places. [2025-03-09 01:18:11,466 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 354 flow [2025-03-09 01:18:11,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:18:11,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:11,467 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] [2025-03-09 01:18:11,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:18:11,467 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:18:11,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:11,468 INFO L85 PathProgramCache]: Analyzing trace with hash -264813842, now seen corresponding path program 2 times [2025-03-09 01:18:11,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:11,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680666132] [2025-03-09 01:18:11,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:18:11,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:11,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:18:11,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:11,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:18:11,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:11,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:11,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680666132] [2025-03-09 01:18:11,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680666132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:18:11,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240944148] [2025-03-09 01:18:11,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:18:11,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:11,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:18:11,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:18:11,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:18:11,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:18:11,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:11,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:18:11,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:11,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:18:11,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:18:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:11,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:18:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:11,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240944148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:18:11,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:18:11,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:18:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998825741] [2025-03-09 01:18:11,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:18:11,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:18:11,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:11,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:18:11,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:18:11,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:11,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:18:11,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:11,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:11,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:11,940 INFO L124 PetriNetUnfolderBase]: 1447/1987 cut-off events. [2025-03-09 01:18:11,940 INFO L125 PetriNetUnfolderBase]: For 6794/6810 co-relation queries the response was YES. [2025-03-09 01:18:11,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9441 conditions, 1987 events. 1447/1987 cut-off events. For 6794/6810 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8179 event pairs, 375 based on Foata normal form. 72/2059 useless extension candidates. Maximal degree in co-relation 8379. Up to 1150 conditions per place. [2025-03-09 01:18:11,950 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 111 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2025-03-09 01:18:11,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 124 transitions, 1043 flow [2025-03-09 01:18:11,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-09 01:18:11,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6823529411764706 [2025-03-09 01:18:11,952 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 354 flow. Second operand 5 states and 116 transitions. [2025-03-09 01:18:11,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 124 transitions, 1043 flow [2025-03-09 01:18:11,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 1036 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:18:11,958 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 401 flow [2025-03-09 01:18:11,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=401, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2025-03-09 01:18:11,959 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2025-03-09 01:18:11,959 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 401 flow [2025-03-09 01:18:11,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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:18:11,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:11,959 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] [2025-03-09 01:18:11,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:18:12,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:12,160 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:18:12,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1118927825, now seen corresponding path program 1 times [2025-03-09 01:18:12,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:12,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585772725] [2025-03-09 01:18:12,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:12,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:18:12,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:18:12,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:12,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:12,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:12,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585772725] [2025-03-09 01:18:12,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585772725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:18:12,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677320122] [2025-03-09 01:18:12,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:12,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:12,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:18:12,512 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:18:12,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:18:12,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:18:12,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:18:12,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:12,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:12,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:18:12,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:28,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:31,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677320122] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:31,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:31,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-03-09 01:19:31,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193017830] [2025-03-09 01:19:31,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:31,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:19:31,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:31,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:19:31,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=168, Unknown=2, NotChecked=0, Total=240 [2025-03-09 01:19:31,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:19:31,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 401 flow. Second operand has 16 states, 16 states have (on average 13.4375) internal successors, (215), 16 states have internal predecessors, (215), 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:19:31,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:31,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:19:31,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:33,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-09 01:19:46,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []