./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i -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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:00:05,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:00:05,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:00:05,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:00:05,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:00:05,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:00:05,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:00:05,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:00:05,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:00:05,812 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:00:05,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:00:05,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:00:05,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:00:05,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:00:05,812 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:00:05,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:00:05,813 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:00:05,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:00:05,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:00:05,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:00:05,814 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:00:05,814 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:00:05,814 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:00:05,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:00:05,814 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:00:05,814 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:00:05,814 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:00:05,814 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:00:05,814 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:00:05,814 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:00:05,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:00:05,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:00:05,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:00:05,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:05,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:00:05,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:00:05,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:00:05,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:00:05,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:00:05,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:00:05,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:00:05,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:00:05,815 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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2025-03-04 10:00:06,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:00:06,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:00:06,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:00:06,047 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:00:06,047 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:00:06,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2025-03-04 10:00:07,195 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1d2c3226/2bdce70b3f8f4e13bb0ffb9dbb3028d3/FLAG3caf02597 [2025-03-04 10:00:07,517 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:00:07,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2025-03-04 10:00:07,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1d2c3226/2bdce70b3f8f4e13bb0ffb9dbb3028d3/FLAG3caf02597 [2025-03-04 10:00:07,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1d2c3226/2bdce70b3f8f4e13bb0ffb9dbb3028d3 [2025-03-04 10:00:07,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:00:07,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:00:07,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:07,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:00:07,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:00:07,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:07" (1/1) ... [2025-03-04 10:00:07,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154be36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:07, skipping insertion in model container [2025-03-04 10:00:07,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:00:07" (1/1) ... [2025-03-04 10:00:07,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:00:08,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:08,170 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:00:08,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:00:08,268 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:00:08,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:08 WrapperNode [2025-03-04 10:00:08,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:00:08,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:08,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:00:08,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:00:08,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:08" (1/1) ... [2025-03-04 10:00:08,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:08" (1/1) ... [2025-03-04 10:00:08,305 INFO L138 Inliner]: procedures = 364, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 113 [2025-03-04 10:00:08,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:00:08,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:00:08,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:00:08,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:00:08,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:08" (1/1) ... [2025-03-04 10:00:08,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:08" (1/1) ... [2025-03-04 10:00:08,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:08" (1/1) ... [2025-03-04 10:00:08,325 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:00:08,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:08" (1/1) ... [2025-03-04 10:00:08,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:08" (1/1) ... [2025-03-04 10:00:08,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:08" (1/1) ... [2025-03-04 10:00:08,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:08" (1/1) ... [2025-03-04 10:00:08,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:08" (1/1) ... [2025-03-04 10:00:08,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:08" (1/1) ... [2025-03-04 10:00:08,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:00:08,333 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:00:08,333 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:00:08,334 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:00:08,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:08" (1/1) ... [2025-03-04 10:00:08,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:00:08,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:08,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:00:08,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:00:08,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:00:08,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:00:08,379 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2025-03-04 10:00:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2025-03-04 10:00:08,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:00:08,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:00:08,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:00:08,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:00:08,380 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:00:08,495 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:00:08,497 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:00:08,653 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:00:08,653 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:00:08,808 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:00:08,810 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:00:08,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:08 BoogieIcfgContainer [2025-03-04 10:00:08,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:00:08,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:00:08,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:00:08,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:00:08,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:00:07" (1/3) ... [2025-03-04 10:00:08,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25dce515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:08, skipping insertion in model container [2025-03-04 10:00:08,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:00:08" (2/3) ... [2025-03-04 10:00:08,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25dce515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:00:08, skipping insertion in model container [2025-03-04 10:00:08,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:00:08" (3/3) ... [2025-03-04 10:00:08,818 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2025-03-04 10:00:08,831 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:00:08,832 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-3.i that has 2 procedures, 24 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-04 10:00:08,832 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:00:08,857 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 10:00:08,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 61 flow [2025-03-04 10:00:08,905 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-03-04 10:00:08,907 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:00:08,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 26 events. 4/26 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-03-04 10:00:08,909 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 61 flow [2025-03-04 10:00:08,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 25 transitions, 56 flow [2025-03-04 10:00:08,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:00:08,924 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;@79fd0b1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:00:08,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 10:00:08,932 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:00:08,933 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2025-03-04 10:00:08,933 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:00:08,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:08,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:08,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 10:00:08,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:08,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1174497258, now seen corresponding path program 1 times [2025-03-04 10:00:08,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:08,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302199102] [2025-03-04 10:00:08,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:08,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:09,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:00:09,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:00:09,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:09,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:00:09,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:09,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302199102] [2025-03-04 10:00:09,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302199102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:09,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:09,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:00:09,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305266305] [2025-03-04 10:00:09,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:09,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:09,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:09,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:09,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:09,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 10:00:09,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:09,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:09,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 10:00:09,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:09,256 INFO L124 PetriNetUnfolderBase]: 37/90 cut-off events. [2025-03-04 10:00:09,256 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:00:09,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 90 events. 37/90 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 270 event pairs, 15 based on Foata normal form. 9/98 useless extension candidates. Maximal degree in co-relation 154. Up to 54 conditions per place. [2025-03-04 10:00:09,259 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 21 selfloop transitions, 2 changer transitions 1/28 dead transitions. [2025-03-04 10:00:09,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 108 flow [2025-03-04 10:00:09,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-03-04 10:00:09,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2025-03-04 10:00:09,273 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 56 flow. Second operand 3 states and 48 transitions. [2025-03-04 10:00:09,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 28 transitions, 108 flow [2025-03-04 10:00:09,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 28 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:09,279 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 52 flow [2025-03-04 10:00:09,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-03-04 10:00:09,283 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2025-03-04 10:00:09,285 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 52 flow [2025-03-04 10:00:09,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:09,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:09,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:09,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:00:09,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 10:00:09,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:09,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1164654392, now seen corresponding path program 1 times [2025-03-04 10:00:09,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:09,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687055374] [2025-03-04 10:00:09,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:09,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:09,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:00:09,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:00:09,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:09,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:00:09,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:09,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687055374] [2025-03-04 10:00:09,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687055374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:09,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:09,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:00:09,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501366051] [2025-03-04 10:00:09,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:09,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:00:09,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:09,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:00:09,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:00:09,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 10:00:09,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:09,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:09,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 10:00:09,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:09,488 INFO L124 PetriNetUnfolderBase]: 51/122 cut-off events. [2025-03-04 10:00:09,488 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-04 10:00:09,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 122 events. 51/122 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 389 event pairs, 20 based on Foata normal form. 5/126 useless extension candidates. Maximal degree in co-relation 50. Up to 66 conditions per place. [2025-03-04 10:00:09,490 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 21 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-03-04 10:00:09,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 122 flow [2025-03-04 10:00:09,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:00:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:00:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-03-04 10:00:09,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2025-03-04 10:00:09,492 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 46 transitions. [2025-03-04 10:00:09,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 28 transitions, 122 flow [2025-03-04 10:00:09,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:09,493 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 62 flow [2025-03-04 10:00:09,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2025-03-04 10:00:09,494 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2025-03-04 10:00:09,494 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 62 flow [2025-03-04 10:00:09,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:09,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:09,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:09,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:00:09,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 10:00:09,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash 488061354, now seen corresponding path program 1 times [2025-03-04 10:00:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:09,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136135805] [2025-03-04 10:00:09,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:09,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:09,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:00:09,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:00:09,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:09,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:09,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:00:09,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:09,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136135805] [2025-03-04 10:00:09,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136135805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:09,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504588694] [2025-03-04 10:00:09,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:00:09,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:09,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:09,593 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:00:09,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:00:09,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:00:09,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:00:09,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:09,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:09,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:00:09,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:00:09,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:00:09,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504588694] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:09,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:09,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 10:00:09,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375117596] [2025-03-04 10:00:09,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:09,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:00:09,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:09,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:00:09,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:00:09,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 10:00:09,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:09,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:09,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 10:00:09,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:09,869 INFO L124 PetriNetUnfolderBase]: 116/242 cut-off events. [2025-03-04 10:00:09,870 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-03-04 10:00:09,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 242 events. 116/242 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 714 event pairs, 8 based on Foata normal form. 15/257 useless extension candidates. Maximal degree in co-relation 153. Up to 69 conditions per place. [2025-03-04 10:00:09,887 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 42 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2025-03-04 10:00:09,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 52 transitions, 248 flow [2025-03-04 10:00:09,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:00:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:00:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-03-04 10:00:09,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2025-03-04 10:00:09,888 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 62 flow. Second operand 6 states and 88 transitions. [2025-03-04 10:00:09,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 52 transitions, 248 flow [2025-03-04 10:00:09,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 52 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:09,890 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 100 flow [2025-03-04 10:00:09,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2025-03-04 10:00:09,890 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2025-03-04 10:00:09,890 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 100 flow [2025-03-04 10:00:09,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:09,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:09,891 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:09,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:00:10,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:10,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 10:00:10,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:10,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1603182844, now seen corresponding path program 2 times [2025-03-04 10:00:10,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:10,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222446526] [2025-03-04 10:00:10,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:10,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:10,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 10:00:10,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 34 statements. [2025-03-04 10:00:10,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:00:10,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-04 10:00:10,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:10,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222446526] [2025-03-04 10:00:10,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222446526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:00:10,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:00:10,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:00:10,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116975468] [2025-03-04 10:00:10,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:00:10,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:00:10,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:10,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:00:10,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:00:10,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 10:00:10,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:10,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:10,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 10:00:10,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:10,266 INFO L124 PetriNetUnfolderBase]: 149/360 cut-off events. [2025-03-04 10:00:10,267 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-03-04 10:00:10,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 360 events. 149/360 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1391 event pairs, 54 based on Foata normal form. 19/378 useless extension candidates. Maximal degree in co-relation 581. Up to 154 conditions per place. [2025-03-04 10:00:10,271 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 37 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2025-03-04 10:00:10,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 296 flow [2025-03-04 10:00:10,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:00:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:00:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-03-04 10:00:10,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 10:00:10,274 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 100 flow. Second operand 4 states and 60 transitions. [2025-03-04 10:00:10,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 296 flow [2025-03-04 10:00:10,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 272 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-04 10:00:10,277 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 108 flow [2025-03-04 10:00:10,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2025-03-04 10:00:10,279 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2025-03-04 10:00:10,279 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 108 flow [2025-03-04 10:00:10,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:10,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:10,280 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:10,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:00:10,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 10:00:10,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash 939773202, now seen corresponding path program 3 times [2025-03-04 10:00:10,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:10,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357621109] [2025-03-04 10:00:10,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:00:10,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:10,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-03-04 10:00:10,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:00:10,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:00:10,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:00:10,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:10,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357621109] [2025-03-04 10:00:10,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357621109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:10,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653861892] [2025-03-04 10:00:10,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:00:10,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:10,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:10,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:00:10,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:00:10,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-03-04 10:00:10,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:00:10,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:00:10,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:10,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:00:10,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:10,571 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:00:10,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:00:10,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653861892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:10,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:10,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:00:10,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446524802] [2025-03-04 10:00:10,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:10,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:00:10,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:10,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:00:10,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:00:10,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-04 10:00:10,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 108 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:10,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:10,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-04 10:00:10,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:10,807 INFO L124 PetriNetUnfolderBase]: 382/796 cut-off events. [2025-03-04 10:00:10,808 INFO L125 PetriNetUnfolderBase]: For 747/747 co-relation queries the response was YES. [2025-03-04 10:00:10,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 796 events. 382/796 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3534 event pairs, 36 based on Foata normal form. 76/872 useless extension candidates. Maximal degree in co-relation 1414. Up to 134 conditions per place. [2025-03-04 10:00:10,812 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 81 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2025-03-04 10:00:10,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 93 transitions, 602 flow [2025-03-04 10:00:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:00:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:00:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2025-03-04 10:00:10,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 10:00:10,815 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 108 flow. Second operand 8 states and 120 transitions. [2025-03-04 10:00:10,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 93 transitions, 602 flow [2025-03-04 10:00:10,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 93 transitions, 596 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:10,821 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 160 flow [2025-03-04 10:00:10,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=160, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2025-03-04 10:00:10,821 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 20 predicate places. [2025-03-04 10:00:10,821 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 160 flow [2025-03-04 10:00:10,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:10,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:10,822 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:10,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:00:11,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:11,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 10:00:11,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1382766674, now seen corresponding path program 4 times [2025-03-04 10:00:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:11,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046564485] [2025-03-04 10:00:11,028 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:00:11,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:11,046 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-04 10:00:11,064 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:00:11,065 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:00:11,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 10:00:11,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:11,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046564485] [2025-03-04 10:00:11,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046564485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:11,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724700223] [2025-03-04 10:00:11,210 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:00:11,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:11,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:11,213 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:00:11,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:00:11,291 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-03-04 10:00:11,310 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:00:11,310 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:00:11,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:11,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:00:11,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 10:00:11,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 10:00:11,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724700223] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:11,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:11,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-04 10:00:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621257245] [2025-03-04 10:00:11,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:11,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:00:11,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:11,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:00:11,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:00:11,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-04 10:00:11,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 160 flow. Second operand has 16 states, 16 states have (on average 9.5625) internal successors, (153), 16 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:11,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:11,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-04 10:00:11,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:11,829 INFO L124 PetriNetUnfolderBase]: 816/1693 cut-off events. [2025-03-04 10:00:11,830 INFO L125 PetriNetUnfolderBase]: For 3436/3436 co-relation queries the response was YES. [2025-03-04 10:00:11,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 1693 events. 816/1693 cut-off events. For 3436/3436 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7817 event pairs, 49 based on Foata normal form. 152/1845 useless extension candidates. Maximal degree in co-relation 3665. Up to 304 conditions per place. [2025-03-04 10:00:11,841 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 169 selfloop transitions, 16 changer transitions 0/189 dead transitions. [2025-03-04 10:00:11,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 189 transitions, 1348 flow [2025-03-04 10:00:11,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:00:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:00:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 244 transitions. [2025-03-04 10:00:11,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2025-03-04 10:00:11,843 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 160 flow. Second operand 16 states and 244 transitions. [2025-03-04 10:00:11,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 189 transitions, 1348 flow [2025-03-04 10:00:11,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 189 transitions, 1296 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-03-04 10:00:11,852 INFO L231 Difference]: Finished difference. Result has 67 places, 38 transitions, 264 flow [2025-03-04 10:00:11,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=264, PETRI_PLACES=67, PETRI_TRANSITIONS=38} [2025-03-04 10:00:11,852 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 42 predicate places. [2025-03-04 10:00:11,852 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 38 transitions, 264 flow [2025-03-04 10:00:11,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.5625) internal successors, (153), 16 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:11,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:11,853 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:11,859 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-04 10:00:12,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:12,054 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 10:00:12,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:12,054 INFO L85 PathProgramCache]: Analyzing trace with hash -342530878, now seen corresponding path program 5 times [2025-03-04 10:00:12,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:12,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550585763] [2025-03-04 10:00:12,054 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:00:12,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:12,075 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 73 statements into 15 equivalence classes. [2025-03-04 10:00:12,088 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 10:00:12,088 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-04 10:00:12,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-04 10:00:12,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:12,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550585763] [2025-03-04 10:00:12,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550585763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:12,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575375256] [2025-03-04 10:00:12,212 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:00:12,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:12,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:12,215 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:00:12,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:00:12,299 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 73 statements into 15 equivalence classes. [2025-03-04 10:00:12,325 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 10:00:12,325 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-04 10:00:12,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:12,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:00:12,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-04 10:00:12,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-04 10:00:12,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575375256] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:12,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:12,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 10:00:12,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279471436] [2025-03-04 10:00:12,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:12,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:00:12,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:12,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:00:12,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:00:12,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 10:00:12,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 38 transitions, 264 flow. Second operand has 12 states, 12 states have (on average 11.75) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:12,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:12,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 10:00:12,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:12,896 INFO L124 PetriNetUnfolderBase]: 1540/3166 cut-off events. [2025-03-04 10:00:12,896 INFO L125 PetriNetUnfolderBase]: For 8013/8013 co-relation queries the response was YES. [2025-03-04 10:00:12,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10600 conditions, 3166 events. 1540/3166 cut-off events. For 8013/8013 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 18252 event pairs, 58 based on Foata normal form. 180/3346 useless extension candidates. Maximal degree in co-relation 9329. Up to 795 conditions per place. [2025-03-04 10:00:12,921 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 222 selfloop transitions, 12 changer transitions 0/240 dead transitions. [2025-03-04 10:00:12,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 240 transitions, 2270 flow [2025-03-04 10:00:12,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:00:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:00:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2025-03-04 10:00:12,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.558641975308642 [2025-03-04 10:00:12,923 INFO L175 Difference]: Start difference. First operand has 67 places, 38 transitions, 264 flow. Second operand 12 states and 181 transitions. [2025-03-04 10:00:12,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 240 transitions, 2270 flow [2025-03-04 10:00:12,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 240 transitions, 2160 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:00:12,941 INFO L231 Difference]: Finished difference. Result has 80 places, 45 transitions, 350 flow [2025-03-04 10:00:12,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=350, PETRI_PLACES=80, PETRI_TRANSITIONS=45} [2025-03-04 10:00:12,942 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 55 predicate places. [2025-03-04 10:00:12,942 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 45 transitions, 350 flow [2025-03-04 10:00:12,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.75) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:12,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:12,943 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:12,952 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-04 10:00:13,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:13,147 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 10:00:13,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1690586482, now seen corresponding path program 6 times [2025-03-04 10:00:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:13,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603944228] [2025-03-04 10:00:13,148 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:00:13,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:13,165 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 103 statements into 15 equivalence classes. [2025-03-04 10:00:13,198 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 10:00:13,198 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-03-04 10:00:13,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-04 10:00:13,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:13,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603944228] [2025-03-04 10:00:13,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603944228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:13,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15559731] [2025-03-04 10:00:13,487 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:00:13,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:13,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:13,489 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:00:13,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:00:13,557 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 103 statements into 15 equivalence classes. [2025-03-04 10:00:13,617 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 10:00:13,617 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-03-04 10:00:13,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:13,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:00:13,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-04 10:00:13,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-04 10:00:13,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15559731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:13,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:13,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-04 10:00:13,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954014105] [2025-03-04 10:00:13,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:13,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:00:13,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:13,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:00:13,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:00:13,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-04 10:00:13,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 45 transitions, 350 flow. Second operand has 23 states, 23 states have (on average 9.347826086956522) internal successors, (215), 23 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-04 10:00:13,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:13,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-04 10:00:13,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:14,664 INFO L124 PetriNetUnfolderBase]: 2649/5383 cut-off events. [2025-03-04 10:00:14,665 INFO L125 PetriNetUnfolderBase]: For 35422/35422 co-relation queries the response was YES. [2025-03-04 10:00:14,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20210 conditions, 5383 events. 2649/5383 cut-off events. For 35422/35422 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 30438 event pairs, 84 based on Foata normal form. 258/5641 useless extension candidates. Maximal degree in co-relation 16638. Up to 946 conditions per place. [2025-03-04 10:00:14,697 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 361 selfloop transitions, 22 changer transitions 0/388 dead transitions. [2025-03-04 10:00:14,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 388 transitions, 3950 flow [2025-03-04 10:00:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:00:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 10:00:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 332 transitions. [2025-03-04 10:00:14,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5589225589225589 [2025-03-04 10:00:14,699 INFO L175 Difference]: Start difference. First operand has 80 places, 45 transitions, 350 flow. Second operand 22 states and 332 transitions. [2025-03-04 10:00:14,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 388 transitions, 3950 flow [2025-03-04 10:00:14,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 388 transitions, 3824 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:00:14,724 INFO L231 Difference]: Finished difference. Result has 105 places, 52 transitions, 488 flow [2025-03-04 10:00:14,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=488, PETRI_PLACES=105, PETRI_TRANSITIONS=52} [2025-03-04 10:00:14,725 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 80 predicate places. [2025-03-04 10:00:14,725 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 52 transitions, 488 flow [2025-03-04 10:00:14,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.347826086956522) internal successors, (215), 23 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-04 10:00:14,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:14,725 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:14,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:00:14,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:14,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 10:00:14,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:14,931 INFO L85 PathProgramCache]: Analyzing trace with hash 804344054, now seen corresponding path program 7 times [2025-03-04 10:00:14,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:14,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875925356] [2025-03-04 10:00:14,931 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:00:14,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:14,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 10:00:14,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 10:00:14,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:14,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-04 10:00:15,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:15,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875925356] [2025-03-04 10:00:15,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875925356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:15,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688933892] [2025-03-04 10:00:15,126 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:00:15,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:15,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:15,128 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:00:15,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:00:15,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 10:00:15,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 10:00:15,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:00:15,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:15,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:00:15,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-04 10:00:15,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-04 10:00:15,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688933892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:15,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:15,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-03-04 10:00:15,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248460432] [2025-03-04 10:00:15,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:15,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:00:15,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:15,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:00:15,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:00:15,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 10:00:15,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 52 transitions, 488 flow. Second operand has 23 states, 23 states have (on average 12.173913043478262) internal successors, (280), 23 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:15,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:15,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 10:00:15,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:00:16,821 INFO L124 PetriNetUnfolderBase]: 4231/8703 cut-off events. [2025-03-04 10:00:16,821 INFO L125 PetriNetUnfolderBase]: For 50448/50448 co-relation queries the response was YES. [2025-03-04 10:00:16,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34719 conditions, 8703 events. 4231/8703 cut-off events. For 50448/50448 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 54735 event pairs, 182 based on Foata normal form. 420/9123 useless extension candidates. Maximal degree in co-relation 31505. Up to 2163 conditions per place. [2025-03-04 10:00:16,883 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 548 selfloop transitions, 22 changer transitions 0/577 dead transitions. [2025-03-04 10:00:16,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 577 transitions, 6914 flow [2025-03-04 10:00:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:00:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 10:00:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 335 transitions. [2025-03-04 10:00:16,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563973063973064 [2025-03-04 10:00:16,886 INFO L175 Difference]: Start difference. First operand has 105 places, 52 transitions, 488 flow. Second operand 22 states and 335 transitions. [2025-03-04 10:00:16,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 577 transitions, 6914 flow [2025-03-04 10:00:16,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 577 transitions, 6368 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-03-04 10:00:16,949 INFO L231 Difference]: Finished difference. Result has 124 places, 63 transitions, 662 flow [2025-03-04 10:00:16,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=662, PETRI_PLACES=124, PETRI_TRANSITIONS=63} [2025-03-04 10:00:16,950 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 99 predicate places. [2025-03-04 10:00:16,950 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 63 transitions, 662 flow [2025-03-04 10:00:16,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.173913043478262) internal successors, (280), 23 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:16,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:00:16,951 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:00:16,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:00:17,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:17,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 10:00:17,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:00:17,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1453419742, now seen corresponding path program 8 times [2025-03-04 10:00:17,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:00:17,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937371459] [2025-03-04 10:00:17,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:17,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:00:17,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 171 statements into 2 equivalence classes. [2025-03-04 10:00:17,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 10:00:17,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:00:17,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:19,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1789 backedges. 0 proven. 1788 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:00:19,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:00:19,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937371459] [2025-03-04 10:00:19,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937371459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:00:19,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792977860] [2025-03-04 10:00:19,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:00:19,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:00:19,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:00:19,152 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:00:19,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:00:19,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 171 statements into 2 equivalence classes. [2025-03-04 10:00:19,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 10:00:19,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:00:19,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:00:19,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-04 10:00:19,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:00:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1789 backedges. 0 proven. 1788 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:00:19,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:00:21,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1789 backedges. 0 proven. 1788 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:00:21,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792977860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:00:21,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:00:21,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 67 [2025-03-04 10:00:21,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361633798] [2025-03-04 10:00:21,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:00:21,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-04 10:00:21,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:00:21,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-04 10:00:21,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1226, Invalid=3330, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 10:00:21,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 10:00:21,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 63 transitions, 662 flow. Second operand has 68 states, 68 states have (on average 9.073529411764707) internal successors, (617), 68 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:00:21,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:00:21,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 10:00:21,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand