./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-nondet.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-nondet.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 797a9e1bf9dc9387a2e0877719131f75c1f5b0797aa4bcc7c94038568bc56c2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:19:55,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:19:55,327 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:55,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:19:55,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:19:55,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:19:55,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:19:55,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:19:55,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:19:55,359 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:19:55,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:19:55,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:19:55,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:19:55,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:19:55,360 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:19:55,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:19:55,360 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:19:55,361 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:19:55,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:19:55,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:19:55,361 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:19:55,361 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:19:55,361 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:19:55,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:19:55,361 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:19:55,361 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:19:55,361 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:19:55,361 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:19:55,361 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:19:55,362 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:19:55,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:19:55,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:19:55,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:19:55,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:19:55,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:19:55,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:19:55,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:19:55,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:19:55,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:19:55,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:19:55,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:19:55,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:19:55,363 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 -> 797a9e1bf9dc9387a2e0877719131f75c1f5b0797aa4bcc7c94038568bc56c2d [2025-03-04 10:19:55,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:19:55,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:19:55,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:19:55,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:19:55,579 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:19:55,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-nondet.i [2025-03-04 10:19:56,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/062e39d8a/fa41ed7c52bb4aa2b9b81433afbd9dc3/FLAGd4319eaf7 [2025-03-04 10:19:57,018 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:19:57,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-nondet.i [2025-03-04 10:19:57,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/062e39d8a/fa41ed7c52bb4aa2b9b81433afbd9dc3/FLAGd4319eaf7 [2025-03-04 10:19:57,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/062e39d8a/fa41ed7c52bb4aa2b9b81433afbd9dc3 [2025-03-04 10:19:57,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:19:57,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:19:57,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:19:57,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:19:57,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:19:57,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:19:57" (1/1) ... [2025-03-04 10:19:57,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba7706c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:57, skipping insertion in model container [2025-03-04 10:19:57,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:19:57" (1/1) ... [2025-03-04 10:19:57,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:19:57,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:19:57,612 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:19:57,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:19:57,682 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:19:57,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:57 WrapperNode [2025-03-04 10:19:57,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:19:57,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:19:57,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:19:57,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:19:57,688 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:57" (1/1) ... [2025-03-04 10:19:57,696 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:57" (1/1) ... [2025-03-04 10:19:57,707 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 82 [2025-03-04 10:19:57,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:19:57,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:19:57,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:19:57,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:19:57,713 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:57" (1/1) ... [2025-03-04 10:19:57,713 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:57" (1/1) ... [2025-03-04 10:19:57,714 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:57" (1/1) ... [2025-03-04 10:19:57,725 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:57,726 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:57" (1/1) ... [2025-03-04 10:19:57,726 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:57" (1/1) ... [2025-03-04 10:19:57,729 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:57" (1/1) ... [2025-03-04 10:19:57,729 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:57" (1/1) ... [2025-03-04 10:19:57,730 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:57" (1/1) ... [2025-03-04 10:19:57,731 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:57" (1/1) ... [2025-03-04 10:19:57,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:19:57,732 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:19:57,732 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:19:57,732 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:19:57,733 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:57" (1/1) ... [2025-03-04 10:19:57,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:19:57,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:19:57,772 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:57,777 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:57,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:19:57,797 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-04 10:19:57,797 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-04 10:19:57,797 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-04 10:19:57,797 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-04 10:19:57,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:19:57,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:19:57,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:19:57,799 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:57,896 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:19:57,897 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:19:58,042 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:19:58,042 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:19:58,111 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:19:58,111 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:19:58,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:19:58 BoogieIcfgContainer [2025-03-04 10:19:58,112 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:19:58,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:19:58,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:19:58,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:19:58,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:19:57" (1/3) ... [2025-03-04 10:19:58,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe88b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:19:58, skipping insertion in model container [2025-03-04 10:19:58,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:19:57" (2/3) ... [2025-03-04 10:19:58,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe88b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:19:58, skipping insertion in model container [2025-03-04 10:19:58,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:19:58" (3/3) ... [2025-03-04 10:19:58,119 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-nondet.i [2025-03-04 10:19:58,130 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:19:58,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-nondet.i that has 3 procedures, 33 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-04 10:19:58,131 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:19:58,170 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:19:58,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 90 flow [2025-03-04 10:19:58,217 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2025-03-04 10:19:58,219 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:19:58,221 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:58,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 90 flow [2025-03-04 10:19:58,224 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 35 transitions, 82 flow [2025-03-04 10:19:58,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:19:58,237 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;@6e33baf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:19:58,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 10:19:58,244 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:19:58,244 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2025-03-04 10:19:58,244 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:19:58,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:58,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:58,246 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:58,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:58,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1591584427, now seen corresponding path program 1 times [2025-03-04 10:19:58,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:58,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103941061] [2025-03-04 10:19:58,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:58,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:58,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:19:58,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:19:58,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:58,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:58,622 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:58,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:58,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103941061] [2025-03-04 10:19:58,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103941061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:58,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:58,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:19:58,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651011271] [2025-03-04 10:19:58,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:58,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:19:58,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:58,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:19:58,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:19:58,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-04 10:19:58,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:58,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:58,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-04 10:19:58,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:59,093 INFO L124 PetriNetUnfolderBase]: 451/881 cut-off events. [2025-03-04 10:19:59,093 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-04 10:19:59,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 881 events. 451/881 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4665 event pairs, 42 based on Foata normal form. 148/903 useless extension candidates. Maximal degree in co-relation 1558. Up to 215 conditions per place. [2025-03-04 10:19:59,100 INFO L140 encePairwiseOnDemand]: 24/38 looper letters, 92 selfloop transitions, 18 changer transitions 0/117 dead transitions. [2025-03-04 10:19:59,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 117 transitions, 499 flow [2025-03-04 10:19:59,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:19:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:19:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 233 transitions. [2025-03-04 10:19:59,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5574162679425837 [2025-03-04 10:19:59,113 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 82 flow. Second operand 11 states and 233 transitions. [2025-03-04 10:19:59,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 117 transitions, 499 flow [2025-03-04 10:19:59,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 117 transitions, 469 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:19:59,119 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 177 flow [2025-03-04 10:19:59,122 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=177, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2025-03-04 10:19:59,125 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2025-03-04 10:19:59,126 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 177 flow [2025-03-04 10:19:59,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:59,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:59,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:59,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:19:59,127 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:59,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:59,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2093491125, now seen corresponding path program 1 times [2025-03-04 10:19:59,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:59,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919933131] [2025-03-04 10:19:59,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:59,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:59,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:19:59,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:19:59,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:59,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:59,253 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:59,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:59,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919933131] [2025-03-04 10:19:59,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919933131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:19:59,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048145594] [2025-03-04 10:19:59,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:59,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:59,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:19:59,257 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:59,259 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:59,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:19:59,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:19:59,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:59,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:59,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:19:59,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:19:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:19:59,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:19:59,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048145594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:59,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:19:59,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-04 10:19:59,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146613893] [2025-03-04 10:19:59,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:59,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:19:59,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:59,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:19:59,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:19:59,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:19:59,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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:59,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:59,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:19:59,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:59,604 INFO L124 PetriNetUnfolderBase]: 411/852 cut-off events. [2025-03-04 10:19:59,604 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2025-03-04 10:19:59,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 852 events. 411/852 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4714 event pairs, 86 based on Foata normal form. 26/793 useless extension candidates. Maximal degree in co-relation 1929. Up to 203 conditions per place. [2025-03-04 10:19:59,610 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 89 selfloop transitions, 14 changer transitions 0/113 dead transitions. [2025-03-04 10:19:59,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 113 transitions, 560 flow [2025-03-04 10:19:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:19:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:19:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2025-03-04 10:19:59,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2025-03-04 10:19:59,612 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 177 flow. Second operand 9 states and 192 transitions. [2025-03-04 10:19:59,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 113 transitions, 560 flow [2025-03-04 10:19:59,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 113 transitions, 559 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:19:59,622 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 249 flow [2025-03-04 10:19:59,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=249, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2025-03-04 10:19:59,623 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2025-03-04 10:19:59,625 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 249 flow [2025-03-04 10:19:59,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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:59,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:59,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:59,633 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:59,830 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:59,830 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:59,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:59,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1467341530, now seen corresponding path program 1 times [2025-03-04 10:19:59,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:59,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828296663] [2025-03-04 10:19:59,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:19:59,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:59,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:19:59,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:19:59,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:19:59,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:59,913 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:59,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:59,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828296663] [2025-03-04 10:19:59,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828296663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:19:59,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:19:59,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:19:59,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409978404] [2025-03-04 10:19:59,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:19:59,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:19:59,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:59,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:19:59,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:19:59,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:19:59,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 249 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:59,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:59,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:19:59,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:00,144 INFO L124 PetriNetUnfolderBase]: 477/1003 cut-off events. [2025-03-04 10:20:00,144 INFO L125 PetriNetUnfolderBase]: For 1189/1191 co-relation queries the response was YES. [2025-03-04 10:20:00,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2682 conditions, 1003 events. 477/1003 cut-off events. For 1189/1191 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5727 event pairs, 107 based on Foata normal form. 2/954 useless extension candidates. Maximal degree in co-relation 2395. Up to 385 conditions per place. [2025-03-04 10:20:00,152 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 71 selfloop transitions, 15 changer transitions 0/96 dead transitions. [2025-03-04 10:20:00,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 96 transitions, 677 flow [2025-03-04 10:20:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:20:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:20:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2025-03-04 10:20:00,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2025-03-04 10:20:00,153 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 249 flow. Second operand 7 states and 132 transitions. [2025-03-04 10:20:00,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 96 transitions, 677 flow [2025-03-04 10:20:00,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 96 transitions, 665 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:20:00,164 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 324 flow [2025-03-04 10:20:00,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=324, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2025-03-04 10:20:00,165 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2025-03-04 10:20:00,165 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 324 flow [2025-03-04 10:20:00,165 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:00,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:00,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:00,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:20:00,165 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:00,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:00,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1756066983, now seen corresponding path program 1 times [2025-03-04 10:20:00,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:20:00,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533687710] [2025-03-04 10:20:00,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:00,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:20:00,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:20:00,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:20:00,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:00,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:00,302 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:00,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:20:00,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533687710] [2025-03-04 10:20:00,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533687710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:20:00,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255904970] [2025-03-04 10:20:00,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:00,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:00,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:00,307 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:00,308 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:00,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:20:00,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:20:00,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:00,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:00,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:20:00,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:20:00,452 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:00,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:20:00,621 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:00,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255904970] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:20:00,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:20:00,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 10:20:00,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23185437] [2025-03-04 10:20:00,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:20:00,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:20:00,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:20:00,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:20:00,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:20:00,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-04 10:20:00,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 324 flow. Second operand has 15 states, 15 states have (on average 10.533333333333333) internal successors, (158), 15 states have internal predecessors, (158), 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:00,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:20:00,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-04 10:20:00,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:01,089 INFO L124 PetriNetUnfolderBase]: 807/1551 cut-off events. [2025-03-04 10:20:01,089 INFO L125 PetriNetUnfolderBase]: For 2276/2278 co-relation queries the response was YES. [2025-03-04 10:20:01,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4930 conditions, 1551 events. 807/1551 cut-off events. For 2276/2278 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9039 event pairs, 107 based on Foata normal form. 2/1410 useless extension candidates. Maximal degree in co-relation 4397. Up to 385 conditions per place. [2025-03-04 10:20:01,098 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 139 selfloop transitions, 28 changer transitions 0/176 dead transitions. [2025-03-04 10:20:01,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 176 transitions, 1377 flow [2025-03-04 10:20:01,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:20:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:20:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 236 transitions. [2025-03-04 10:20:01,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4777327935222672 [2025-03-04 10:20:01,101 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 324 flow. Second operand 13 states and 236 transitions. [2025-03-04 10:20:01,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 176 transitions, 1377 flow [2025-03-04 10:20:01,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 176 transitions, 1356 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:20:01,114 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 484 flow [2025-03-04 10:20:01,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=484, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2025-03-04 10:20:01,115 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 41 predicate places. [2025-03-04 10:20:01,115 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 484 flow [2025-03-04 10:20:01,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.533333333333333) internal successors, (158), 15 states have internal predecessors, (158), 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:01,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:01,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:01,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:20:01,315 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:20:01,316 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:01,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash -501643260, now seen corresponding path program 1 times [2025-03-04 10:20:01,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:20:01,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896342600] [2025-03-04 10:20:01,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:01,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:20:01,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:20:01,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:20:01,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:01,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:01,385 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:01,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:20:01,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896342600] [2025-03-04 10:20:01,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896342600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:20:01,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:20:01,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:20:01,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832595843] [2025-03-04 10:20:01,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:20:01,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:20:01,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:20:01,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:20:01,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:20:01,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:20:01,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 484 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:01,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:20:01,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:20:01,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:01,599 INFO L124 PetriNetUnfolderBase]: 704/1462 cut-off events. [2025-03-04 10:20:01,599 INFO L125 PetriNetUnfolderBase]: For 3246/3248 co-relation queries the response was YES. [2025-03-04 10:20:01,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5427 conditions, 1462 events. 704/1462 cut-off events. For 3246/3248 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9094 event pairs, 152 based on Foata normal form. 20/1429 useless extension candidates. Maximal degree in co-relation 4872. Up to 676 conditions per place. [2025-03-04 10:20:01,611 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 67 selfloop transitions, 17 changer transitions 0/96 dead transitions. [2025-03-04 10:20:01,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 96 transitions, 849 flow [2025-03-04 10:20:01,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:20:01,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:20:01,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2025-03-04 10:20:01,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2025-03-04 10:20:01,612 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 484 flow. Second operand 6 states and 111 transitions. [2025-03-04 10:20:01,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 96 transitions, 849 flow [2025-03-04 10:20:01,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 96 transitions, 799 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 10:20:01,629 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 492 flow [2025-03-04 10:20:01,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=492, PETRI_PLACES=78, PETRI_TRANSITIONS=67} [2025-03-04 10:20:01,629 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 42 predicate places. [2025-03-04 10:20:01,629 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 492 flow [2025-03-04 10:20:01,630 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:01,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:01,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:01,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:20:01,630 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:01,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:01,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1158191573, now seen corresponding path program 1 times [2025-03-04 10:20:01,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:20:01,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924831775] [2025-03-04 10:20:01,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:01,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:20:01,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:20:01,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:20:01,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:01,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:20:01,639 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:20:01,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:20:01,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:20:01,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:01,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:20:01,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:20:01,662 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:20:01,663 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-04 10:20:01,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-04 10:20:01,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-04 10:20:01,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 10:20:01,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-03-04 10:20:01,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-04 10:20:01,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 10:20:01,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:20:01,665 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 10:20:01,691 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:20:01,691 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:20:01,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:20:01 BasicIcfg [2025-03-04 10:20:01,698 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:20:01,698 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:20:01,698 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:20:01,698 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:20:01,699 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:58" (3/4) ... [2025-03-04 10:20:01,700 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 10:20:01,700 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:20:01,701 INFO L158 Benchmark]: Toolchain (without parser) took 4415.32ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 105.4MB in the beginning and 161.2MB in the end (delta: -55.8MB). Peak memory consumption was 100.3MB. Max. memory is 16.1GB. [2025-03-04 10:20:01,701 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:20:01,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.50ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 85.3MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:20:01,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.89ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:20:01,701 INFO L158 Benchmark]: Boogie Preprocessor took 24.15ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 82.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:20:01,702 INFO L158 Benchmark]: IcfgBuilder took 379.44ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 61.0MB in the end (delta: 21.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:20:01,702 INFO L158 Benchmark]: TraceAbstraction took 3584.40ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 60.2MB in the beginning and 161.2MB in the end (delta: -101.1MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2025-03-04 10:20:01,702 INFO L158 Benchmark]: Witness Printer took 2.18ms. Allocated memory is still 302.0MB. Free memory was 161.2MB in the beginning and 161.2MB in the end (delta: 4.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:20:01,705 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.18ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.50ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 85.3MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.89ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.15ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 82.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 379.44ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 61.0MB in the end (delta: 21.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3584.40ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 60.2MB in the beginning and 161.2MB in the end (delta: -101.1MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. * Witness Printer took 2.18ms. Allocated memory is still 302.0MB. Free memory was 161.2MB in the beginning and 161.2MB in the end (delta: 4.4kB). 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 = __VERIFIER_nondet_int() [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=0, limit=0, t1=-1] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=0, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=0, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=1, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=1, limit=1] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=0, limit=0] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=0, arg={0:0}, bound=0, i=0, lim=1, limit=0] [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=0, limit=0] [L752] 2 __assert_fail ("0", "generated/unwind2.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [_N=0, limit=0] - 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: 3.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 573 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 570 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1120 IncrementalHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 3 mSDtfsCounter, 1120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=492occurred in iteration=5, InterpolantAutomatonStates: 46, 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.0s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 328 SizeOfPredicates, 11 NumberOfNonLiveVariables, 138 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 1/5 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:01,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-nondet.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 797a9e1bf9dc9387a2e0877719131f75c1f5b0797aa4bcc7c94038568bc56c2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:20:03,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:20:03,646 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:03,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:20:03,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:20:03,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:20:03,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:20:03,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:20:03,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:20:03,678 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:20:03,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:20:03,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:20:03,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:20:03,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:20:03,679 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:20:03,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:20:03,680 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:20:03,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:20:03,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:20:03,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:20:03,680 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:20:03,680 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:20:03,680 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:20:03,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:20:03,681 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:20:03,681 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 10:20:03,681 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 10:20:03,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:20:03,681 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:20:03,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:20:03,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:20:03,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:20:03,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:20:03,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:20:03,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:20:03,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:20:03,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:20:03,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:20:03,683 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 10:20:03,683 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 10:20:03,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:20:03,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:20:03,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:20:03,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:20:03,683 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 -> 797a9e1bf9dc9387a2e0877719131f75c1f5b0797aa4bcc7c94038568bc56c2d [2025-03-04 10:20:03,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:20:03,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:20:03,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:20:03,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:20:03,929 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:20:03,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-nondet.i [2025-03-04 10:20:05,093 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/525ea8f30/8054e65464e2444098cfc859dc198d50/FLAGcad69cd4e [2025-03-04 10:20:05,361 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:20:05,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-nondet.i [2025-03-04 10:20:05,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/525ea8f30/8054e65464e2444098cfc859dc198d50/FLAGcad69cd4e [2025-03-04 10:20:05,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/525ea8f30/8054e65464e2444098cfc859dc198d50 [2025-03-04 10:20:05,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:20:05,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:20:05,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:20:05,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:20:05,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:20:05,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:20:05" (1/1) ... [2025-03-04 10:20:05,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36b2e5a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:05, skipping insertion in model container [2025-03-04 10:20:05,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:20:05" (1/1) ... [2025-03-04 10:20:05,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:20:05,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:20:05,940 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:20:05,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:20:06,029 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:20:06,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:06 WrapperNode [2025-03-04 10:20:06,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:20:06,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:20:06,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:20:06,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:20:06,036 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:06" (1/1) ... [2025-03-04 10:20:06,052 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:06" (1/1) ... [2025-03-04 10:20:06,069 INFO L138 Inliner]: procedures = 170, calls = 12, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 82 [2025-03-04 10:20:06,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:20:06,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:20:06,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:20:06,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:20:06,077 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:06" (1/1) ... [2025-03-04 10:20:06,078 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:06" (1/1) ... [2025-03-04 10:20:06,081 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:06" (1/1) ... [2025-03-04 10:20:06,089 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:06,089 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:06" (1/1) ... [2025-03-04 10:20:06,089 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:06" (1/1) ... [2025-03-04 10:20:06,097 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:06" (1/1) ... [2025-03-04 10:20:06,098 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:06" (1/1) ... [2025-03-04 10:20:06,099 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:06" (1/1) ... [2025-03-04 10:20:06,099 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:06" (1/1) ... [2025-03-04 10:20:06,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:20:06,101 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:20:06,102 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:20:06,102 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:20:06,102 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:06" (1/1) ... [2025-03-04 10:20:06,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:20:06,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:06,138 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:06,141 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:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:20:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-04 10:20:06,159 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-04 10:20:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-04 10:20:06,159 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-04 10:20:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 10:20:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:20:06,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:20:06,160 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:06,264 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:20:06,265 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:20:06,395 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:20:06,395 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:20:06,486 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:20:06,486 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:20:06,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:20:06 BoogieIcfgContainer [2025-03-04 10:20:06,487 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:20:06,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:20:06,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:20:06,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:20:06,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:20:05" (1/3) ... [2025-03-04 10:20:06,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b16a8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:20:06, skipping insertion in model container [2025-03-04 10:20:06,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:20:06" (2/3) ... [2025-03-04 10:20:06,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b16a8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:20:06, skipping insertion in model container [2025-03-04 10:20:06,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:20:06" (3/3) ... [2025-03-04 10:20:06,496 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind2-nondet.i [2025-03-04 10:20:06,507 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:20:06,508 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-nondet.i that has 3 procedures, 33 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-04 10:20:06,508 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:20:06,577 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:20:06,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 90 flow [2025-03-04 10:20:06,619 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2025-03-04 10:20:06,621 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:20:06,623 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:06,624 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 90 flow [2025-03-04 10:20:06,625 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 35 transitions, 82 flow [2025-03-04 10:20:06,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:20:06,644 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;@61bf1a8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:20:06,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 10:20:06,654 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:20:06,654 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2025-03-04 10:20:06,654 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:20:06,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:06,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:06,655 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:06,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:06,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1591584427, now seen corresponding path program 1 times [2025-03-04 10:20:06,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:20:06,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094124595] [2025-03-04 10:20:06,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:06,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:06,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:06,669 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:06,670 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:06,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:20:06,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:20:06,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:06,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:06,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:20:06,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:20:06,900 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:06,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:20:06,901 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:20:06,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094124595] [2025-03-04 10:20:06,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094124595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:20:06,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:20:06,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:20:06,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485639743] [2025-03-04 10:20:06,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:20:06,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:20:06,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:20:06,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:20:06,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:20:06,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:20:06,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:20:06,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:20:06,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:07,435 INFO L124 PetriNetUnfolderBase]: 375/791 cut-off events. [2025-03-04 10:20:07,437 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-04 10:20:07,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489 conditions, 791 events. 375/791 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4409 event pairs, 42 based on Foata normal form. 158/857 useless extension candidates. Maximal degree in co-relation 1351. Up to 215 conditions per place. [2025-03-04 10:20:07,448 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 77 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2025-03-04 10:20:07,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 98 transitions, 418 flow [2025-03-04 10:20:07,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:20:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:20:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2025-03-04 10:20:07,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5847953216374269 [2025-03-04 10:20:07,463 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 82 flow. Second operand 9 states and 200 transitions. [2025-03-04 10:20:07,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 98 transitions, 418 flow [2025-03-04 10:20:07,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 98 transitions, 390 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:20:07,473 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 151 flow [2025-03-04 10:20:07,475 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=151, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2025-03-04 10:20:07,479 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2025-03-04 10:20:07,479 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 151 flow [2025-03-04 10:20:07,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:07,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:07,487 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:07,684 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:07,684 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:07,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:07,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2093491125, now seen corresponding path program 1 times [2025-03-04 10:20:07,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:20:07,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546056403] [2025-03-04 10:20:07,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:07,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:07,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:07,687 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:07,689 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:07,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:20:07,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:20:07,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:07,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:07,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:20:07,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:20:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:20:07,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:20:07,953 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:07,953 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:20:07,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546056403] [2025-03-04 10:20:07,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546056403] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:20:07,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:20:07,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2025-03-04 10:20:07,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943705048] [2025-03-04 10:20:07,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:20:07,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:20:07,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:20:07,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:20:07,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:20:07,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-04 10:20:07,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 151 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:07,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:20:07,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-04 10:20:07,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:09,213 INFO L124 PetriNetUnfolderBase]: 883/1677 cut-off events. [2025-03-04 10:20:09,213 INFO L125 PetriNetUnfolderBase]: For 530/530 co-relation queries the response was YES. [2025-03-04 10:20:09,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4172 conditions, 1677 events. 883/1677 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9975 event pairs, 14 based on Foata normal form. 62/1540 useless extension candidates. Maximal degree in co-relation 2898. Up to 257 conditions per place. [2025-03-04 10:20:09,222 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 206 selfloop transitions, 44 changer transitions 0/257 dead transitions. [2025-03-04 10:20:09,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 257 transitions, 1217 flow [2025-03-04 10:20:09,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:20:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-04 10:20:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 489 transitions. [2025-03-04 10:20:09,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4949392712550607 [2025-03-04 10:20:09,226 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 151 flow. Second operand 26 states and 489 transitions. [2025-03-04 10:20:09,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 257 transitions, 1217 flow [2025-03-04 10:20:09,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 257 transitions, 1216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:20:09,240 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 438 flow [2025-03-04 10:20:09,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=438, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2025-03-04 10:20:09,240 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 38 predicate places. [2025-03-04 10:20:09,240 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 438 flow [2025-03-04 10:20:09,241 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:09,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:09,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:09,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:20:09,441 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:09,441 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:09,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:09,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1467341530, now seen corresponding path program 1 times [2025-03-04 10:20:09,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:20:09,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011033798] [2025-03-04 10:20:09,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:09,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:09,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:09,444 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:09,445 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:09,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:20:09,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:20:09,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:09,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:09,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:20:09,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:20:09,555 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:09,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:20:09,555 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:20:09,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011033798] [2025-03-04 10:20:09,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011033798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:20:09,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:20:09,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:20:09,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020591774] [2025-03-04 10:20:09,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:20:09,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:20:09,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:20:09,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:20:09,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:20:09,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:20:09,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 438 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:09,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:20:09,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:20:09,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:09,885 INFO L124 PetriNetUnfolderBase]: 831/1712 cut-off events. [2025-03-04 10:20:09,885 INFO L125 PetriNetUnfolderBase]: For 3046/3048 co-relation queries the response was YES. [2025-03-04 10:20:09,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5132 conditions, 1712 events. 831/1712 cut-off events. For 3046/3048 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11008 event pairs, 223 based on Foata normal form. 2/1633 useless extension candidates. Maximal degree in co-relation 4572. Up to 568 conditions per place. [2025-03-04 10:20:09,896 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 112 selfloop transitions, 19 changer transitions 0/141 dead transitions. [2025-03-04 10:20:09,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 141 transitions, 1225 flow [2025-03-04 10:20:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:20:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:20:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-03-04 10:20:09,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5075187969924813 [2025-03-04 10:20:09,898 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 438 flow. Second operand 7 states and 135 transitions. [2025-03-04 10:20:09,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 141 transitions, 1225 flow [2025-03-04 10:20:09,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 141 transitions, 909 flow, removed 119 selfloop flow, removed 10 redundant places. [2025-03-04 10:20:09,916 INFO L231 Difference]: Finished difference. Result has 73 places, 74 transitions, 392 flow [2025-03-04 10:20:09,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=392, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2025-03-04 10:20:09,917 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 37 predicate places. [2025-03-04 10:20:09,917 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 392 flow [2025-03-04 10:20:09,917 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:09,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:09,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:09,924 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:10,118 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:10,118 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:10,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1756066983, now seen corresponding path program 1 times [2025-03-04 10:20:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:20:10,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1938807509] [2025-03-04 10:20:10,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:10,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:10,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:10,121 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:10,122 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:10,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:20:10,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:20:10,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:10,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:10,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:20:10,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:20:10,204 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:10,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:20:10,273 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:10,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:20:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938807509] [2025-03-04 10:20:10,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938807509] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:20:10,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:20:10,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-04 10:20:10,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144753752] [2025-03-04 10:20:10,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:20:10,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:20:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:20:10,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:20:10,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:20:10,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-03-04 10:20:10,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 392 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 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:10,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:20:10,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-03-04 10:20:10,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:11,172 INFO L124 PetriNetUnfolderBase]: 2157/4039 cut-off events. [2025-03-04 10:20:11,173 INFO L125 PetriNetUnfolderBase]: For 4554/4554 co-relation queries the response was YES. [2025-03-04 10:20:11,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11801 conditions, 4039 events. 2157/4039 cut-off events. For 4554/4554 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 27955 event pairs, 145 based on Foata normal form. 0/3654 useless extension candidates. Maximal degree in co-relation 10418. Up to 668 conditions per place. [2025-03-04 10:20:11,194 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 403 selfloop transitions, 50 changer transitions 0/462 dead transitions. [2025-03-04 10:20:11,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 462 transitions, 3227 flow [2025-03-04 10:20:11,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:20:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 10:20:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 416 transitions. [2025-03-04 10:20:11,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49760765550239233 [2025-03-04 10:20:11,198 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 392 flow. Second operand 22 states and 416 transitions. [2025-03-04 10:20:11,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 462 transitions, 3227 flow [2025-03-04 10:20:11,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 462 transitions, 3198 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:20:11,229 INFO L231 Difference]: Finished difference. Result has 99 places, 105 transitions, 687 flow [2025-03-04 10:20:11,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=687, PETRI_PLACES=99, PETRI_TRANSITIONS=105} [2025-03-04 10:20:11,230 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 63 predicate places. [2025-03-04 10:20:11,230 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 105 transitions, 687 flow [2025-03-04 10:20:11,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 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:11,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:11,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:11,237 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:11,431 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:11,431 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:11,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash -201607974, now seen corresponding path program 1 times [2025-03-04 10:20:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:20:11,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593878607] [2025-03-04 10:20:11,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:11,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:11,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:11,434 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:11,435 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:11,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:20:11,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:20:11,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:11,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:20:11,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:20:11,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:20:11,539 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:11,540 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:20:11,540 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 10:20:11,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593878607] [2025-03-04 10:20:11,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593878607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:20:11,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:20:11,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:20:11,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533865151] [2025-03-04 10:20:11,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:20:11,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:20:11,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 10:20:11,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:20:11,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:20:11,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2025-03-04 10:20:11,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 105 transitions, 687 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:11,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:20:11,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2025-03-04 10:20:11,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:20:11,920 INFO L124 PetriNetUnfolderBase]: 1810/3628 cut-off events. [2025-03-04 10:20:11,920 INFO L125 PetriNetUnfolderBase]: For 7558/7560 co-relation queries the response was YES. [2025-03-04 10:20:11,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12360 conditions, 3628 events. 1810/3628 cut-off events. For 7558/7560 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 26737 event pairs, 393 based on Foata normal form. 28/3650 useless extension candidates. Maximal degree in co-relation 11002. Up to 1437 conditions per place. [2025-03-04 10:20:11,966 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 110 selfloop transitions, 25 changer transitions 0/147 dead transitions. [2025-03-04 10:20:11,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 147 transitions, 1220 flow [2025-03-04 10:20:11,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:20:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:20:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2025-03-04 10:20:11,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4956140350877193 [2025-03-04 10:20:11,968 INFO L175 Difference]: Start difference. First operand has 99 places, 105 transitions, 687 flow. Second operand 6 states and 113 transitions. [2025-03-04 10:20:11,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 147 transitions, 1220 flow [2025-03-04 10:20:12,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 147 transitions, 1085 flow, removed 51 selfloop flow, removed 4 redundant places. [2025-03-04 10:20:12,014 INFO L231 Difference]: Finished difference. Result has 101 places, 106 transitions, 650 flow [2025-03-04 10:20:12,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=650, PETRI_PLACES=101, PETRI_TRANSITIONS=106} [2025-03-04 10:20:12,015 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 65 predicate places. [2025-03-04 10:20:12,015 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 106 transitions, 650 flow [2025-03-04 10:20:12,015 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:12,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:20:12,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:20:12,025 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:12,219 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:12,219 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:12,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:20:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1908735007, now seen corresponding path program 1 times [2025-03-04 10:20:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 10:20:12,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1136517316] [2025-03-04 10:20:12,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:20:12,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:20:12,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:20:12,223 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:12,225 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:12,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:20:12,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:20:12,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:12,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:20:12,270 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:20:12,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:20:12,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:20:12,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:20:12,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:20:12,307 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 10:20:12,308 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:20:12,308 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-04 10:20:12,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-03-04 10:20:12,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-04 10:20:12,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-03-04 10:20:12,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2025-03-04 10:20:12,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-04 10:20:12,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 10:20:12,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:20:12,510 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:12,511 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 10:20:12,532 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:20:12,532 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:20:12,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:20:12 BasicIcfg [2025-03-04 10:20:12,537 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:20:12,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:20:12,539 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:20:12,539 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:20:12,539 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:06" (3/4) ... [2025-03-04 10:20:12,540 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 10:20:12,541 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:20:12,541 INFO L158 Benchmark]: Toolchain (without parser) took 6868.07ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 91.1MB in the beginning and 47.6MB in the end (delta: 43.5MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2025-03-04 10:20:12,541 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:20:12,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.74ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 70.6MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:20:12,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.62ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 68.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:20:12,542 INFO L158 Benchmark]: Boogie Preprocessor took 29.57ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 66.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:20:12,542 INFO L158 Benchmark]: IcfgBuilder took 385.57ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 39.9MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:20:12,542 INFO L158 Benchmark]: TraceAbstraction took 6048.53ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 39.4MB in the beginning and 47.6MB in the end (delta: -8.2MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-03-04 10:20:12,542 INFO L158 Benchmark]: Witness Printer took 2.17ms. Allocated memory is still 142.6MB. Free memory was 47.6MB in the beginning and 47.6MB in the end (delta: 9.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:20:12,544 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.91ms. Allocated memory is still 83.9MB. Free memory is still 61.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.74ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 70.6MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.62ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 68.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.57ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 66.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 385.57ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 39.9MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6048.53ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 39.4MB in the beginning and 47.6MB in the end (delta: -8.2MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Witness Printer took 2.17ms. Allocated memory is still 142.6MB. Free memory was 47.6MB in the beginning and 47.6MB in the end (delta: 9.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 = __VERIFIER_nondet_int() [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=0, limit=0, t1=-1] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=0, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=0, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=1, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=1, limit=1] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=0, arg={0:0}, lim=0, limit=0] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=0, arg={0:0}, bound=0, i=0, lim=1, limit=0] [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=0, limit=0] [L752] 2 __assert_fail ("0", "generated/unwind2.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [_N=0, limit=0] - 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.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 867 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 865 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1455 IncrementalHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 0 mSDtfsCounter, 1455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=687occurred in iteration=4, InterpolantAutomatonStates: 70, 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.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 379 SizeOfPredicates, 28 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 0/4 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:12,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample