./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-1.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-theta/unwind2-1.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 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:19:51,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:19:51,254 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:19:51,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:19:51,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:19:51,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:19:51,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:19:51,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:19:51,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:19:51,287 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:19:51,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:19:51,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:19:51,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:19:51,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:19:51,288 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:19:51,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:19:51,288 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:19:51,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:19:51,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:19:51,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:19:51,288 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:19:51,289 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:19:51,289 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:19:51,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:19:51,289 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:19:51,289 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:19:51,289 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:19:51,289 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:19:51,289 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:19:51,289 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:19:51,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:19:51,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:19:51,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:19:51,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:19:51,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:19:51,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:19:51,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:19:51,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:19:51,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:19:51,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:19:51,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:19:51,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:19:51,290 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 -> 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 [2025-03-04 10:19:51,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:19:51,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:19:51,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:19:51,490 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:19:51,490 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:19:51,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-1.i [2025-03-04 10:19:52,670 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/925de0b61/79ded17a89f04e72a599dad100ac2445/FLAGa015c0f86 [2025-03-04 10:19:52,963 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:19:52,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-1.i [2025-03-04 10:19:52,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/925de0b61/79ded17a89f04e72a599dad100ac2445/FLAGa015c0f86 [2025-03-04 10:19:53,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/925de0b61/79ded17a89f04e72a599dad100ac2445 [2025-03-04 10:19:53,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:19:53,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:19:53,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:19:53,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:19:53,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:19:53,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:19:53" (1/1) ... [2025-03-04 10:19:53,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791e552b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:53, skipping insertion in model container [2025-03-04 10:19:53,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:19:53" (1/1) ... [2025-03-04 10:19:53,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:19:53,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:19:53,470 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:19:53,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:19:53,532 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:19:53,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:53 WrapperNode [2025-03-04 10:19:53,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:19:53,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:19:53,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:19:53,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:19:53,538 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:19:53" (1/1) ... [2025-03-04 10:19:53,549 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:19:53" (1/1) ... [2025-03-04 10:19:53,562 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 79 [2025-03-04 10:19:53,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:19:53,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:19:53,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:19:53,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:19:53,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:53" (1/1) ... [2025-03-04 10:19:53,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:53" (1/1) ... [2025-03-04 10:19:53,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:53" (1/1) ... [2025-03-04 10:19:53,581 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:19:53,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:53" (1/1) ... [2025-03-04 10:19:53,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:53" (1/1) ... [2025-03-04 10:19:53,585 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:53" (1/1) ... [2025-03-04 10:19:53,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:53" (1/1) ... [2025-03-04 10:19:53,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:53" (1/1) ... [2025-03-04 10:19:53,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:53" (1/1) ... [2025-03-04 10:19:53,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:19:53,588 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:19:53,588 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:19:53,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:19:53,589 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:53" (1/1) ... [2025-03-04 10:19:53,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:19:53,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:19:53,618 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:19:53,620 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:19:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:19:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-04 10:19:53,636 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-04 10:19:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-04 10:19:53,636 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-04 10:19:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:19:53,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:19:53,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:19:53,637 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:19:53,740 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:19:53,742 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:19:53,879 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:19:53,879 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:19:53,969 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:19:53,969 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:19:53,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:19:53 BoogieIcfgContainer [2025-03-04 10:19:53,970 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:19:53,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:19:53,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:19:53,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:19:53,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:19:53" (1/3) ... [2025-03-04 10:19:53,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d265e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:19:53, skipping insertion in model container [2025-03-04 10:19:53,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:53" (2/3) ... [2025-03-04 10:19:53,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d265e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:19:53, skipping insertion in model container [2025-03-04 10:19:53,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:19:53" (3/3) ... [2025-03-04 10:19:53,980 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-1.i [2025-03-04 10:19:53,993 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:19:53,996 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-1.i that has 3 procedures, 33 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-04 10:19:53,996 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:19:54,038 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:19:54,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 90 flow [2025-03-04 10:19:54,086 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2025-03-04 10:19:54,088 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:19:54,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 36 events. 6/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-03-04 10:19:54,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 90 flow [2025-03-04 10:19:54,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 35 transitions, 82 flow [2025-03-04 10:19:54,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:19:54,108 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;@766a9407, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:19:54,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 10:19:54,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:19:54,115 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2025-03-04 10:19:54,115 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:19:54,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:54,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:54,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:19:54,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:54,120 INFO L85 PathProgramCache]: Analyzing trace with hash 771893669, now seen corresponding path program 1 times [2025-03-04 10:19:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:54,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986029820] [2025-03-04 10:19:54,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:54,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:54,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:19:54,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:19:54,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:54,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:54,389 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:19:54,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:54,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986029820] [2025-03-04 10:19:54,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986029820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:54,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:54,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:19:54,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402500979] [2025-03-04 10:19:54,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:54,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:19:54,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:54,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:19:54,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:19:54,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:19:54,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 82 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:54,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:54,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:19:54,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:54,730 INFO L124 PetriNetUnfolderBase]: 287/602 cut-off events. [2025-03-04 10:19:54,730 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 10:19:54,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 602 events. 287/602 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3090 event pairs, 42 based on Foata normal form. 112/658 useless extension candidates. Maximal degree in co-relation 1048. Up to 215 conditions per place. [2025-03-04 10:19:54,738 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 58 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2025-03-04 10:19:54,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 74 transitions, 307 flow [2025-03-04 10:19:54,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:19:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:19:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2025-03-04 10:19:54,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 10:19:54,750 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 82 flow. Second operand 7 states and 152 transitions. [2025-03-04 10:19:54,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 74 transitions, 307 flow [2025-03-04 10:19:54,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 74 transitions, 289 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:19:54,756 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 111 flow [2025-03-04 10:19:54,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-03-04 10:19:54,760 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2025-03-04 10:19:54,760 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 111 flow [2025-03-04 10:19:54,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:54,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:54,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:54,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:19:54,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:19:54,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:54,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1842085899, now seen corresponding path program 1 times [2025-03-04 10:19:54,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:54,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300194757] [2025-03-04 10:19:54,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:54,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:19:54,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:19:54,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:54,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:54,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:54,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300194757] [2025-03-04 10:19:54,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300194757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:19:54,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432964727] [2025-03-04 10:19:54,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:54,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:54,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:19:54,916 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:19:54,918 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:19:54,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:19:54,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:19:54,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:54,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:54,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:19:54,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:19:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:55,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:19:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:55,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432964727] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:19:55,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:19:55,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-04 10:19:55,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260236006] [2025-03-04 10:19:55,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:19:55,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:19:55,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:55,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:19:55,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:19:55,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-04 10:19:55,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 111 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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:19:55,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:55,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-04 10:19:55,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:55,381 INFO L124 PetriNetUnfolderBase]: 569/1098 cut-off events. [2025-03-04 10:19:55,381 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-03-04 10:19:55,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2521 conditions, 1098 events. 569/1098 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6027 event pairs, 67 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 938. Up to 401 conditions per place. [2025-03-04 10:19:55,390 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 81 selfloop transitions, 14 changer transitions 0/102 dead transitions. [2025-03-04 10:19:55,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 102 transitions, 475 flow [2025-03-04 10:19:55,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:19:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:19:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2025-03-04 10:19:55,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5058479532163743 [2025-03-04 10:19:55,395 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 111 flow. Second operand 9 states and 173 transitions. [2025-03-04 10:19:55,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 102 transitions, 475 flow [2025-03-04 10:19:55,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 102 transitions, 461 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:19:55,403 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 170 flow [2025-03-04 10:19:55,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=170, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-03-04 10:19:55,404 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2025-03-04 10:19:55,405 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 170 flow [2025-03-04 10:19:55,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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:19:55,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:55,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:55,413 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:19:55,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:55,606 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:19:55,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1083822304, now seen corresponding path program 1 times [2025-03-04 10:19:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265528506] [2025-03-04 10:19:55,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:55,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:55,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:19:55,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:19:55,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:55,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:55,685 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:19:55,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:55,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265528506] [2025-03-04 10:19:55,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265528506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:55,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:55,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:19:55,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538224808] [2025-03-04 10:19:55,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:55,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:19:55,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:55,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:19:55,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:19:55,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:19:55,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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:19:55,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:55,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:19:55,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:55,883 INFO L124 PetriNetUnfolderBase]: 555/1173 cut-off events. [2025-03-04 10:19:55,883 INFO L125 PetriNetUnfolderBase]: For 1160/1178 co-relation queries the response was YES. [2025-03-04 10:19:55,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3003 conditions, 1173 events. 555/1173 cut-off events. For 1160/1178 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7016 event pairs, 138 based on Foata normal form. 0/1116 useless extension candidates. Maximal degree in co-relation 2090. Up to 422 conditions per place. [2025-03-04 10:19:55,890 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 79 selfloop transitions, 10 changer transitions 0/99 dead transitions. [2025-03-04 10:19:55,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 99 transitions, 659 flow [2025-03-04 10:19:55,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:19:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:19:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-03-04 10:19:55,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5075187969924813 [2025-03-04 10:19:55,893 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 170 flow. Second operand 7 states and 135 transitions. [2025-03-04 10:19:55,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 99 transitions, 659 flow [2025-03-04 10:19:55,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 99 transitions, 613 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-03-04 10:19:55,898 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 218 flow [2025-03-04 10:19:55,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2025-03-04 10:19:55,901 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2025-03-04 10:19:55,901 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 218 flow [2025-03-04 10:19:55,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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:19:55,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:55,901 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:55,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:19:55,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:19:55,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:55,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1271073883, now seen corresponding path program 2 times [2025-03-04 10:19:55,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:55,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147095359] [2025-03-04 10:19:55,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:19:55,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:55,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 10:19:55,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:19:55,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:19:55,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:55,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:55,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147095359] [2025-03-04 10:19:55,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147095359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:19:55,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248997968] [2025-03-04 10:19:55,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:19:55,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:55,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:19:55,988 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:19:55,989 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:19:56,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 10:19:56,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:19:56,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:19:56,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:56,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:19:56,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:19:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:56,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:19:56,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248997968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:56,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:19:56,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-04 10:19:56,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910881345] [2025-03-04 10:19:56,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:56,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:19:56,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:56,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:19:56,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:19:56,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:19:56,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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:19:56,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:56,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:19:56,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:56,291 INFO L124 PetriNetUnfolderBase]: 473/1026 cut-off events. [2025-03-04 10:19:56,291 INFO L125 PetriNetUnfolderBase]: For 927/941 co-relation queries the response was YES. [2025-03-04 10:19:56,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 1026 events. 473/1026 cut-off events. For 927/941 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6068 event pairs, 126 based on Foata normal form. 30/1001 useless extension candidates. Maximal degree in co-relation 1827. Up to 433 conditions per place. [2025-03-04 10:19:56,296 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 84 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2025-03-04 10:19:56,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 107 transitions, 658 flow [2025-03-04 10:19:56,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:19:56,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:19:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2025-03-04 10:19:56,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2025-03-04 10:19:56,298 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 218 flow. Second operand 10 states and 185 transitions. [2025-03-04 10:19:56,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 107 transitions, 658 flow [2025-03-04 10:19:56,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 107 transitions, 625 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-04 10:19:56,303 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 256 flow [2025-03-04 10:19:56,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=256, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2025-03-04 10:19:56,304 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2025-03-04 10:19:56,304 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 256 flow [2025-03-04 10:19:56,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 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:19:56,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:56,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:56,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:19:56,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 10:19:56,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:19:56,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:56,509 INFO L85 PathProgramCache]: Analyzing trace with hash -762232793, now seen corresponding path program 1 times [2025-03-04 10:19:56,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:56,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686433164] [2025-03-04 10:19:56,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:56,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:56,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:19:56,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:19:56,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:56,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:56,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:56,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686433164] [2025-03-04 10:19:56,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686433164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:19:56,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134877616] [2025-03-04 10:19:56,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:56,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:56,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:19:56,568 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:19:56,571 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:19:56,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:19:56,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:19:56,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:56,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:56,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:19:56,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:19:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:56,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:19:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:56,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134877616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:19:56,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:19:56,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-04 10:19:56,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781608682] [2025-03-04 10:19:56,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:19:56,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:19:56,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:56,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:19:56,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:19:56,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:19:56,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 256 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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:19:56,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:56,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:19:56,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:56,968 INFO L124 PetriNetUnfolderBase]: 543/1151 cut-off events. [2025-03-04 10:19:56,968 INFO L125 PetriNetUnfolderBase]: For 1513/1537 co-relation queries the response was YES. [2025-03-04 10:19:56,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3420 conditions, 1151 events. 543/1151 cut-off events. For 1513/1537 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6876 event pairs, 154 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 2318. Up to 489 conditions per place. [2025-03-04 10:19:56,975 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 84 selfloop transitions, 15 changer transitions 0/109 dead transitions. [2025-03-04 10:19:56,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 109 transitions, 798 flow [2025-03-04 10:19:56,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:19:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:19:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2025-03-04 10:19:56,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49415204678362573 [2025-03-04 10:19:56,977 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 256 flow. Second operand 9 states and 169 transitions. [2025-03-04 10:19:56,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 109 transitions, 798 flow [2025-03-04 10:19:56,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 109 transitions, 778 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 10:19:56,983 INFO L231 Difference]: Finished difference. Result has 68 places, 52 transitions, 308 flow [2025-03-04 10:19:56,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=308, PETRI_PLACES=68, PETRI_TRANSITIONS=52} [2025-03-04 10:19:56,983 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 32 predicate places. [2025-03-04 10:19:56,983 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 52 transitions, 308 flow [2025-03-04 10:19:56,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 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:19:56,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:56,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:56,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:19:57,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:57,189 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:19:57,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1661732332, now seen corresponding path program 1 times [2025-03-04 10:19:57,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:57,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321100978] [2025-03-04 10:19:57,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:57,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:57,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:19:57,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:19:57,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:57,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:57,239 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:19:57,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:57,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321100978] [2025-03-04 10:19:57,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321100978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:57,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:57,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:19:57,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638183569] [2025-03-04 10:19:57,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:57,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:19:57,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:57,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:19:57,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:19:57,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:19:57,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 52 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:19:57,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:57,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:19:57,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:57,385 INFO L124 PetriNetUnfolderBase]: 473/997 cut-off events. [2025-03-04 10:19:57,386 INFO L125 PetriNetUnfolderBase]: For 1668/1690 co-relation queries the response was YES. [2025-03-04 10:19:57,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3381 conditions, 997 events. 473/997 cut-off events. For 1668/1690 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5558 event pairs, 150 based on Foata normal form. 14/963 useless extension candidates. Maximal degree in co-relation 2130. Up to 522 conditions per place. [2025-03-04 10:19:57,392 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 54 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2025-03-04 10:19:57,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 574 flow [2025-03-04 10:19:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:19:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:19:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2025-03-04 10:19:57,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2025-03-04 10:19:57,394 INFO L175 Difference]: Start difference. First operand has 68 places, 52 transitions, 308 flow. Second operand 6 states and 111 transitions. [2025-03-04 10:19:57,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 574 flow [2025-03-04 10:19:57,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 525 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-04 10:19:57,400 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 289 flow [2025-03-04 10:19:57,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2025-03-04 10:19:57,400 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 31 predicate places. [2025-03-04 10:19:57,400 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 289 flow [2025-03-04 10:19:57,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:19:57,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:57,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:57,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:19:57,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:19:57,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:57,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1628350555, now seen corresponding path program 1 times [2025-03-04 10:19:57,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:57,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356004607] [2025-03-04 10:19:57,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:57,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:57,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:19:57,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:19:57,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:57,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:57,464 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:19:57,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:57,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356004607] [2025-03-04 10:19:57,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356004607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:57,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:57,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:19:57,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113358480] [2025-03-04 10:19:57,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:57,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:19:57,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:57,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:19:57,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:19:57,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:19:57,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:19:57,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:57,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:19:57,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:57,625 INFO L124 PetriNetUnfolderBase]: 487/1034 cut-off events. [2025-03-04 10:19:57,626 INFO L125 PetriNetUnfolderBase]: For 1801/1833 co-relation queries the response was YES. [2025-03-04 10:19:57,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3335 conditions, 1034 events. 487/1034 cut-off events. For 1801/1833 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5835 event pairs, 161 based on Foata normal form. 0/988 useless extension candidates. Maximal degree in co-relation 2143. Up to 546 conditions per place. [2025-03-04 10:19:57,633 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 59 selfloop transitions, 12 changer transitions 0/80 dead transitions. [2025-03-04 10:19:57,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 80 transitions, 578 flow [2025-03-04 10:19:57,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:19:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:19:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-03-04 10:19:57,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5043859649122807 [2025-03-04 10:19:57,635 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 289 flow. Second operand 6 states and 115 transitions. [2025-03-04 10:19:57,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 80 transitions, 578 flow [2025-03-04 10:19:57,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 80 transitions, 549 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-04 10:19:57,642 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 306 flow [2025-03-04 10:19:57,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2025-03-04 10:19:57,644 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2025-03-04 10:19:57,645 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 306 flow [2025-03-04 10:19:57,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:19:57,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:57,645 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:57,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:19:57,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:19:57,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2139601344, now seen corresponding path program 2 times [2025-03-04 10:19:57,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:57,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373415673] [2025-03-04 10:19:57,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:19:57,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:57,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:19:57,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:19:57,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:19:57,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:57,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:57,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373415673] [2025-03-04 10:19:57,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373415673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:19:57,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717752361] [2025-03-04 10:19:57,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:19:57,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:57,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:19:57,794 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:19:57,795 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:19:57,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:19:57,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:19:57,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:19:57,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:57,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:19:57,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:19:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:57,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:19:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:58,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717752361] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:19:58,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:19:58,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-04 10:19:58,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868265145] [2025-03-04 10:19:58,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:19:58,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:19:58,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:58,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:19:58,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:19:58,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-04 10:19:58,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 306 flow. Second operand has 17 states, 17 states have (on average 10.235294117647058) internal successors, (174), 17 states have internal predecessors, (174), 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:19:58,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:58,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-04 10:19:58,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:58,606 INFO L124 PetriNetUnfolderBase]: 787/1523 cut-off events. [2025-03-04 10:19:58,606 INFO L125 PetriNetUnfolderBase]: For 3032/3084 co-relation queries the response was YES. [2025-03-04 10:19:58,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5274 conditions, 1523 events. 787/1523 cut-off events. For 3032/3084 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8777 event pairs, 135 based on Foata normal form. 0/1389 useless extension candidates. Maximal degree in co-relation 4135. Up to 403 conditions per place. [2025-03-04 10:19:58,614 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 141 selfloop transitions, 28 changer transitions 0/177 dead transitions. [2025-03-04 10:19:58,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 177 transitions, 1384 flow [2025-03-04 10:19:58,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:19:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:19:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 271 transitions. [2025-03-04 10:19:58,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47543859649122805 [2025-03-04 10:19:58,616 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 306 flow. Second operand 15 states and 271 transitions. [2025-03-04 10:19:58,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 177 transitions, 1384 flow [2025-03-04 10:19:58,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 177 transitions, 1343 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 10:19:58,626 INFO L231 Difference]: Finished difference. Result has 86 places, 63 transitions, 477 flow [2025-03-04 10:19:58,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=477, PETRI_PLACES=86, PETRI_TRANSITIONS=63} [2025-03-04 10:19:58,628 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 50 predicate places. [2025-03-04 10:19:58,629 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 63 transitions, 477 flow [2025-03-04 10:19:58,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.235294117647058) internal successors, (174), 17 states have internal predecessors, (174), 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:19:58,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:58,629 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:58,636 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:19:58,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:58,830 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:19:58,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:58,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1061726196, now seen corresponding path program 1 times [2025-03-04 10:19:58,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:58,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079761260] [2025-03-04 10:19:58,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:58,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:58,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:19:58,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:19:58,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:58,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:19:58,839 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:19:58,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:19:58,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:19:58,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:58,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:19:58,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:19:58,862 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:19:58,863 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-04 10:19:58,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-04 10:19:58,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-04 10:19:58,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 10:19:58,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-03-04 10:19:58,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-04 10:19:58,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 10:19:58,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:19:58,865 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:19:58,890 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:19:58,890 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:19:58,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:19:58 BasicIcfg [2025-03-04 10:19:58,896 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:19:58,896 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:19:58,896 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:19:58,897 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:19:58,897 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:19:53" (3/4) ... [2025-03-04 10:19:58,898 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 10:19:58,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:19:58,900 INFO L158 Benchmark]: Toolchain (without parser) took 5661.41ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 110.4MB in the beginning and 115.4MB in the end (delta: -5.0MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2025-03-04 10:19:58,901 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:19:58,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.70ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 90.6MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:19:58,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.24ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 88.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:19:58,903 INFO L158 Benchmark]: Boogie Preprocessor took 24.56ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 87.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:19:58,903 INFO L158 Benchmark]: IcfgBuilder took 381.56ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 66.5MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:19:58,903 INFO L158 Benchmark]: TraceAbstraction took 4923.16ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 66.1MB in the beginning and 115.5MB in the end (delta: -49.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:19:58,903 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 176.2MB. Free memory was 115.5MB in the beginning and 115.4MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:19:58,906 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.70ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 90.6MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.24ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 88.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.56ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 87.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 381.56ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 66.5MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4923.16ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 66.1MB in the beginning and 115.5MB in the end (delta: -49.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 176.2MB. Free memory was 115.5MB in the beginning and 115.4MB in the end (delta: 30.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 1 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=1, limit=0, t1=0] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=1, limit=0, t1=0, t2=1] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=2] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=1] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=0, lim=2, limit=1] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [_N=1, limit=1] [L752] 2 __assert_fail ("0", "generated/unwind2.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [_N=1, limit=1] - UnprovableResult [Line: 774]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 57 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.8s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 840 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 837 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1764 IncrementalHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 2 mSDtfsCounter, 1764 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=8, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 562 SizeOfPredicates, 18 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 5/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 10:19:58,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-theta/unwind2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:20:00,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:20:00,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 10:20:00,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:20:00,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:20:00,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:20:00,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:20:00,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:20:00,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:20:00,887 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:20:00,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:20:00,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:20:00,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:20:00,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:20:00,887 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:20:00,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:20:00,887 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:20:00,888 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:20:00,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:20:00,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:20:00,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:20:00,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:20:00,889 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 10:20:00,889 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 10:20:00,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:20:00,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:20:00,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:20:00,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:20:00,889 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 -> 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 [2025-03-04 10:20:01,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:20:01,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:20:01,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:20:01,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:20:01,168 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:20:01,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-1.i [2025-03-04 10:20:02,362 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9295e7a38/7e61bcf563a04cbaaa9f38530ff01a17/FLAGe74818338 [2025-03-04 10:20:02,588 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:20:02,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-1.i [2025-03-04 10:20:02,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9295e7a38/7e61bcf563a04cbaaa9f38530ff01a17/FLAGe74818338 [2025-03-04 10:20:02,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9295e7a38/7e61bcf563a04cbaaa9f38530ff01a17 [2025-03-04 10:20:02,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:20:02,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:20:02,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:20:02,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:20:02,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:20:02,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:20:02" (1/1) ... [2025-03-04 10:20:02,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a9425e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:02, skipping insertion in model container [2025-03-04 10:20:02,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:20:02" (1/1) ... [2025-03-04 10:20:02,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:20:03,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:20:03,179 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:20:03,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:20:03,236 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:20:03,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:03 WrapperNode [2025-03-04 10:20:03,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:20:03,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:20:03,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:20:03,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:20:03,243 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:20:03" (1/1) ... [2025-03-04 10:20:03,260 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:20:03" (1/1) ... [2025-03-04 10:20:03,275 INFO L138 Inliner]: procedures = 170, calls = 12, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 80 [2025-03-04 10:20:03,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:20:03,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:20:03,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:20:03,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:20:03,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:03" (1/1) ... [2025-03-04 10:20:03,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:03" (1/1) ... [2025-03-04 10:20:03,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:03" (1/1) ... [2025-03-04 10:20:03,302 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:20:03,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:03" (1/1) ... [2025-03-04 10:20:03,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:03" (1/1) ... [2025-03-04 10:20:03,308 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:03" (1/1) ... [2025-03-04 10:20:03,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:03" (1/1) ... [2025-03-04 10:20:03,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:03" (1/1) ... [2025-03-04 10:20:03,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:03" (1/1) ... [2025-03-04 10:20:03,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:20:03,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:20:03,316 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:20:03,316 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:20:03,317 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:03" (1/1) ... [2025-03-04 10:20:03,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:20:03,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:03,351 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:20:03,356 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:20:03,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:20:03,372 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-04 10:20:03,372 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-04 10:20:03,372 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-04 10:20:03,372 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-04 10:20:03,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 10:20:03,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:20:03,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:20:03,373 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:20:03,474 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:20:03,476 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:20:03,640 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:20:03,640 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:20:03,743 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:20:03,743 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:20:03,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:20:03 BoogieIcfgContainer [2025-03-04 10:20:03,743 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:20:03,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:20:03,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:20:03,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:20:03,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:20:02" (1/3) ... [2025-03-04 10:20:03,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76bf916f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:20:03, skipping insertion in model container [2025-03-04 10:20:03,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:03" (2/3) ... [2025-03-04 10:20:03,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76bf916f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:20:03, skipping insertion in model container [2025-03-04 10:20:03,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:20:03" (3/3) ... [2025-03-04 10:20:03,754 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-1.i [2025-03-04 10:20:03,763 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:20:03,764 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-1.i that has 3 procedures, 33 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-04 10:20:03,765 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:20:03,800 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:20:03,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 90 flow [2025-03-04 10:20:03,845 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2025-03-04 10:20:03,847 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:20:03,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 36 events. 6/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-03-04 10:20:03,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 90 flow [2025-03-04 10:20:03,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 35 transitions, 82 flow [2025-03-04 10:20:03,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:20:03,866 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;@3e4dc5e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:20:03,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 10:20:03,872 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:20:03,872 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2025-03-04 10:20:03,872 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:20:03,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:03,872 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:03,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:20:03,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:03,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1818187609, now seen corresponding path program 1 times [2025-03-04 10:20:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:20:03,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212952738] [2025-03-04 10:20:03,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:03,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:03,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:03,888 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:20:03,889 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:20:03,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:20:03,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:20:03,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:03,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:03,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:20:03,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:20:04,035 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:20:04,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:20:04,035 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:20:04,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212952738] [2025-03-04 10:20:04,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212952738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:20:04,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:20:04,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:20:04,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880922312] [2025-03-04 10:20:04,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:20:04,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:20:04,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:20:04,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:20:04,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:20:04,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:20:04,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 82 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:20:04,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:20:04,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:20:04,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:04,367 INFO L124 PetriNetUnfolderBase]: 287/602 cut-off events. [2025-03-04 10:20:04,368 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 10:20:04,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 602 events. 287/602 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3082 event pairs, 42 based on Foata normal form. 112/658 useless extension candidates. Maximal degree in co-relation 1048. Up to 215 conditions per place. [2025-03-04 10:20:04,373 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 58 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2025-03-04 10:20:04,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 74 transitions, 307 flow [2025-03-04 10:20:04,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:20:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:20:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2025-03-04 10:20:04,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 10:20:04,384 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 82 flow. Second operand 7 states and 152 transitions. [2025-03-04 10:20:04,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 74 transitions, 307 flow [2025-03-04 10:20:04,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 74 transitions, 289 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:20:04,389 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 111 flow [2025-03-04 10:20:04,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-03-04 10:20:04,392 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2025-03-04 10:20:04,392 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 111 flow [2025-03-04 10:20:04,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:20:04,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:04,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:04,399 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:20:04,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:04,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:20:04,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:04,594 INFO L85 PathProgramCache]: Analyzing trace with hash -530226891, now seen corresponding path program 1 times [2025-03-04 10:20:04,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:20:04,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1126837519] [2025-03-04 10:20:04,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:04,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:04,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:04,596 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:20:04,597 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:20:04,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:20:04,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:20:04,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:04,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:04,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:20:04,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:20:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:20:04,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:20:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:20:04,866 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:20:04,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126837519] [2025-03-04 10:20:04,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126837519] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:20:04,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:20:04,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-04 10:20:04,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256413603] [2025-03-04 10:20:04,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:20:04,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:20:04,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:20:04,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:20:04,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:20:04,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-04 10:20:04,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 111 flow. Second operand has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 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:20:04,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:20:04,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-04 10:20:04,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:05,556 INFO L124 PetriNetUnfolderBase]: 486/948 cut-off events. [2025-03-04 10:20:05,557 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2025-03-04 10:20:05,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2143 conditions, 948 events. 486/948 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5062 event pairs, 42 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 801. Up to 177 conditions per place. [2025-03-04 10:20:05,567 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 123 selfloop transitions, 23 changer transitions 0/153 dead transitions. [2025-03-04 10:20:05,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 153 transitions, 688 flow [2025-03-04 10:20:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:20:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:20:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 295 transitions. [2025-03-04 10:20:05,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48519736842105265 [2025-03-04 10:20:05,572 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 111 flow. Second operand 16 states and 295 transitions. [2025-03-04 10:20:05,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 153 transitions, 688 flow [2025-03-04 10:20:05,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 153 transitions, 675 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:20:05,580 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 237 flow [2025-03-04 10:20:05,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=237, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2025-03-04 10:20:05,582 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2025-03-04 10:20:05,582 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 237 flow [2025-03-04 10:20:05,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 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:20:05,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:05,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:05,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:20:05,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:05,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:20:05,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1198221406, now seen corresponding path program 1 times [2025-03-04 10:20:05,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:20:05,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503268336] [2025-03-04 10:20:05,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:05,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:05,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:05,786 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:20:05,788 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:20:05,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:20:05,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:20:05,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:05,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:05,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:20:05,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:20:05,888 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:20:05,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:20:05,888 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:20:05,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503268336] [2025-03-04 10:20:05,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503268336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:20:05,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:20:05,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:20:05,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771183563] [2025-03-04 10:20:05,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:20:05,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:20:05,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:20:05,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:20:05,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:20:05,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:20:05,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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:20:05,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:20:05,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:20:05,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:06,096 INFO L124 PetriNetUnfolderBase]: 473/1010 cut-off events. [2025-03-04 10:20:06,096 INFO L125 PetriNetUnfolderBase]: For 847/847 co-relation queries the response was YES. [2025-03-04 10:20:06,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2677 conditions, 1010 events. 473/1010 cut-off events. For 847/847 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5886 event pairs, 154 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 2274. Up to 489 conditions per place. [2025-03-04 10:20:06,101 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 70 selfloop transitions, 12 changer transitions 0/92 dead transitions. [2025-03-04 10:20:06,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 630 flow [2025-03-04 10:20:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:20:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:20:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2025-03-04 10:20:06,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2025-03-04 10:20:06,103 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 237 flow. Second operand 7 states and 132 transitions. [2025-03-04 10:20:06,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 630 flow [2025-03-04 10:20:06,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 92 transitions, 538 flow, removed 30 selfloop flow, removed 6 redundant places. [2025-03-04 10:20:06,110 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 262 flow [2025-03-04 10:20:06,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-03-04 10:20:06,110 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2025-03-04 10:20:06,110 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 262 flow [2025-03-04 10:20:06,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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:20:06,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:06,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:06,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:20:06,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:06,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:20:06,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1508856231, now seen corresponding path program 1 times [2025-03-04 10:20:06,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:20:06,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380698568] [2025-03-04 10:20:06,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:06,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:06,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:06,314 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:20:06,314 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:20:06,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:20:06,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:20:06,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:06,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:06,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:20:06,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:20:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:20:06,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:20:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:20:06,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:20:06,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380698568] [2025-03-04 10:20:06,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380698568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:20:06,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:20:06,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 10:20:06,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895310212] [2025-03-04 10:20:06,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:20:06,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:20:06,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:20:06,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:20:06,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:20:06,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:20:06,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 262 flow. Second operand has 12 states, 12 states have (on average 11.583333333333334) internal successors, (139), 12 states have internal predecessors, (139), 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:20:06,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:20:06,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:20:06,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:07,024 INFO L124 PetriNetUnfolderBase]: 734/1450 cut-off events. [2025-03-04 10:20:07,025 INFO L125 PetriNetUnfolderBase]: For 1247/1247 co-relation queries the response was YES. [2025-03-04 10:20:07,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4352 conditions, 1450 events. 734/1450 cut-off events. For 1247/1247 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8686 event pairs, 28 based on Foata normal form. 0/1312 useless extension candidates. Maximal degree in co-relation 3717. Up to 420 conditions per place. [2025-03-04 10:20:07,034 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 141 selfloop transitions, 26 changer transitions 0/177 dead transitions. [2025-03-04 10:20:07,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 177 transitions, 1183 flow [2025-03-04 10:20:07,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:20:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:20:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 273 transitions. [2025-03-04 10:20:07,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4789473684210526 [2025-03-04 10:20:07,036 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 262 flow. Second operand 15 states and 273 transitions. [2025-03-04 10:20:07,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 177 transitions, 1183 flow [2025-03-04 10:20:07,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 177 transitions, 1163 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:20:07,047 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 435 flow [2025-03-04 10:20:07,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=435, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2025-03-04 10:20:07,049 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 40 predicate places. [2025-03-04 10:20:07,049 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 435 flow [2025-03-04 10:20:07,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.583333333333334) internal successors, (139), 12 states have internal predecessors, (139), 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:20:07,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:07,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:07,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:20:07,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:07,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:20:07,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:07,251 INFO L85 PathProgramCache]: Analyzing trace with hash -948951954, now seen corresponding path program 1 times [2025-03-04 10:20:07,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:20:07,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072815360] [2025-03-04 10:20:07,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:07,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:07,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:07,254 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:20:07,256 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:20:07,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:20:07,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:20:07,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:07,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:07,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:20:07,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:20:07,341 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:20:07,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:20:07,341 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:20:07,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072815360] [2025-03-04 10:20:07,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072815360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:20:07,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:20:07,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:20:07,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878058753] [2025-03-04 10:20:07,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:20:07,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:20:07,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:20:07,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:20:07,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:20:07,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:20:07,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:20:07,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:20:07,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:20:07,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:07,553 INFO L124 PetriNetUnfolderBase]: 637/1267 cut-off events. [2025-03-04 10:20:07,553 INFO L125 PetriNetUnfolderBase]: For 3024/3024 co-relation queries the response was YES. [2025-03-04 10:20:07,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4565 conditions, 1267 events. 637/1267 cut-off events. For 3024/3024 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7173 event pairs, 182 based on Foata normal form. 0/1201 useless extension candidates. Maximal degree in co-relation 4028. Up to 697 conditions per place. [2025-03-04 10:20:07,562 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 65 selfloop transitions, 15 changer transitions 0/89 dead transitions. [2025-03-04 10:20:07,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 89 transitions, 729 flow [2025-03-04 10:20:07,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:20:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:20:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2025-03-04 10:20:07,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2025-03-04 10:20:07,564 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 435 flow. Second operand 6 states and 111 transitions. [2025-03-04 10:20:07,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 89 transitions, 729 flow [2025-03-04 10:20:07,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 89 transitions, 630 flow, removed 38 selfloop flow, removed 5 redundant places. [2025-03-04 10:20:07,593 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 376 flow [2025-03-04 10:20:07,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2025-03-04 10:20:07,595 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 39 predicate places. [2025-03-04 10:20:07,595 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 376 flow [2025-03-04 10:20:07,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:20:07,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:07,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:07,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:20:07,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:07,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:20:07,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash -982333731, now seen corresponding path program 1 times [2025-03-04 10:20:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:20:07,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1587875192] [2025-03-04 10:20:07,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:07,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:07,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:07,799 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:20:07,799 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:20:07,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:20:07,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:20:07,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:07,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:07,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:20:07,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:20:07,876 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:20:07,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:20:07,876 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:20:07,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587875192] [2025-03-04 10:20:07,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587875192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:20:07,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:20:07,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:20:07,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696302225] [2025-03-04 10:20:07,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:20:07,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:20:07,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:20:07,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:20:07,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:20:07,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:20:07,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 376 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:20:07,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:20:07,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:20:07,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:08,071 INFO L124 PetriNetUnfolderBase]: 651/1296 cut-off events. [2025-03-04 10:20:08,071 INFO L125 PetriNetUnfolderBase]: For 2807/2807 co-relation queries the response was YES. [2025-03-04 10:20:08,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4103 conditions, 1296 events. 651/1296 cut-off events. For 2807/2807 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7452 event pairs, 199 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 3615. Up to 725 conditions per place. [2025-03-04 10:20:08,078 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 70 selfloop transitions, 15 changer transitions 0/94 dead transitions. [2025-03-04 10:20:08,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 690 flow [2025-03-04 10:20:08,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:20:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:20:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-03-04 10:20:08,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5043859649122807 [2025-03-04 10:20:08,079 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 376 flow. Second operand 6 states and 115 transitions. [2025-03-04 10:20:08,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 690 flow [2025-03-04 10:20:08,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 94 transitions, 644 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 10:20:08,087 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 377 flow [2025-03-04 10:20:08,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2025-03-04 10:20:08,087 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 39 predicate places. [2025-03-04 10:20:08,087 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 377 flow [2025-03-04 10:20:08,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:20:08,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:08,088 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:08,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:20:08,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:08,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:20:08,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:08,289 INFO L85 PathProgramCache]: Analyzing trace with hash -471082942, now seen corresponding path program 2 times [2025-03-04 10:20:08,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:20:08,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101043791] [2025-03-04 10:20:08,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:20:08,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:08,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:08,291 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:20:08,292 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:20:08,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:20:08,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:20:08,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:20:08,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:08,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:20:08,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:20:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:20:08,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:20:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:20:08,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:20:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101043791] [2025-03-04 10:20:08,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101043791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:20:08,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:20:08,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-03-04 10:20:08,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448301087] [2025-03-04 10:20:08,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:20:08,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:20:08,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:20:08,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:20:08,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:20:08,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-04 10:20:08,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 377 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 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:20:08,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:20:08,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-04 10:20:08,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:08,931 INFO L124 PetriNetUnfolderBase]: 942/1811 cut-off events. [2025-03-04 10:20:08,931 INFO L125 PetriNetUnfolderBase]: For 3037/3037 co-relation queries the response was YES. [2025-03-04 10:20:08,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5457 conditions, 1811 events. 942/1811 cut-off events. For 3037/3037 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10830 event pairs, 155 based on Foata normal form. 0/1662 useless extension candidates. Maximal degree in co-relation 4852. Up to 689 conditions per place. [2025-03-04 10:20:08,939 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 158 selfloop transitions, 21 changer transitions 0/187 dead transitions. [2025-03-04 10:20:08,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 187 transitions, 1278 flow [2025-03-04 10:20:08,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:20:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:20:08,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2025-03-04 10:20:08,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4842105263157895 [2025-03-04 10:20:08,941 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 377 flow. Second operand 10 states and 184 transitions. [2025-03-04 10:20:08,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 187 transitions, 1278 flow [2025-03-04 10:20:08,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 187 transitions, 1228 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-04 10:20:08,950 INFO L231 Difference]: Finished difference. Result has 82 places, 72 transitions, 434 flow [2025-03-04 10:20:08,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=434, PETRI_PLACES=82, PETRI_TRANSITIONS=72} [2025-03-04 10:20:08,951 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 46 predicate places. [2025-03-04 10:20:08,951 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 434 flow [2025-03-04 10:20:08,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 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:20:08,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:08,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:08,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:20:09,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:09,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 10:20:09,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:09,152 INFO L85 PathProgramCache]: Analyzing trace with hash -388560436, now seen corresponding path program 1 times [2025-03-04 10:20:09,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:20:09,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507109712] [2025-03-04 10:20:09,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:09,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:09,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:09,154 INFO L229 MonitoredProcess]: Starting monitored process 9 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:20:09,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:20:09,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:20:09,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:20:09,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:09,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:20:09,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:20:09,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:20:09,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:20:09,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:09,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:20:09,239 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 10:20:09,239 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:20:09,240 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-04 10:20:09,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-04 10:20:09,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-04 10:20:09,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 10:20:09,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-03-04 10:20:09,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-04 10:20:09,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 10:20:09,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:20:09,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:09,442 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:09,466 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:20:09,466 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:20:09,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:20:09 BasicIcfg [2025-03-04 10:20:09,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:20:09,473 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:20:09,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:20:09,473 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:20:09,474 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:20:03" (3/4) ... [2025-03-04 10:20:09,475 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 10:20:09,475 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:20:09,476 INFO L158 Benchmark]: Toolchain (without parser) took 6535.04ms. Allocated memory was 109.1MB in the beginning and 151.0MB in the end (delta: 41.9MB). Free memory was 82.6MB in the beginning and 106.8MB in the end (delta: -24.2MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2025-03-04 10:20:09,476 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:20:09,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.90ms. Allocated memory is still 109.1MB. Free memory was 82.6MB in the beginning and 62.1MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:20:09,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.36ms. Allocated memory is still 109.1MB. Free memory was 62.1MB in the beginning and 60.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:20:09,476 INFO L158 Benchmark]: Boogie Preprocessor took 39.50ms. Allocated memory is still 109.1MB. Free memory was 60.1MB in the beginning and 58.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:20:09,476 INFO L158 Benchmark]: IcfgBuilder took 427.16ms. Allocated memory is still 109.1MB. Free memory was 58.5MB in the beginning and 77.5MB in the end (delta: -19.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2025-03-04 10:20:09,477 INFO L158 Benchmark]: TraceAbstraction took 5726.40ms. Allocated memory was 109.1MB in the beginning and 151.0MB in the end (delta: 41.9MB). Free memory was 76.9MB in the beginning and 106.8MB in the end (delta: -29.9MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2025-03-04 10:20:09,477 INFO L158 Benchmark]: Witness Printer took 2.42ms. Allocated memory is still 151.0MB. Free memory was 106.8MB in the beginning and 106.8MB in the end (delta: 10.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:20:09,478 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.90ms. Allocated memory is still 109.1MB. Free memory was 82.6MB in the beginning and 62.1MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.36ms. Allocated memory is still 109.1MB. Free memory was 62.1MB in the beginning and 60.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.50ms. Allocated memory is still 109.1MB. Free memory was 60.1MB in the beginning and 58.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 427.16ms. Allocated memory is still 109.1MB. Free memory was 58.5MB in the beginning and 77.5MB in the end (delta: -19.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5726.40ms. Allocated memory was 109.1MB in the beginning and 151.0MB in the end (delta: 41.9MB). Free memory was 76.9MB in the beginning and 106.8MB in the end (delta: -29.9MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Witness Printer took 2.42ms. Allocated memory is still 151.0MB. Free memory was 106.8MB in the beginning and 106.8MB in the end (delta: 10.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L775] 0 _N = 1 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=1, limit=0, t1=-1] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=1, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=2] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=1] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=0, lim=2, limit=1] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [_N=1, limit=1] [L752] 2 __assert_fail ("0", "generated/unwind2.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [_N=1, limit=1] - UnprovableResult [Line: 774]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 57 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.6s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 970 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 969 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1691 IncrementalHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 3 mSDtfsCounter, 1691 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=435occurred in iteration=4, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 429 SizeOfPredicates, 27 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 0/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 10:20:09,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample