./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/fib_unsafe-12.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 0d5255e9cc8ffb776115e75fa8fa1fa6c2774a79275dfd8235c357288b00417c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:54:08,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:54:08,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:54:08,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:54:08,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:54:08,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:54:08,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:54:08,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:54:08,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:54:08,940 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:54:08,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:54:08,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:54:08,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:54:08,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:54:08,941 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:54:08,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:54:08,941 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:54:08,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:54:08,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:54:08,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:54:08,941 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:54:08,941 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:54:08,941 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:54:08,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:54:08,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:54:08,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:54:08,942 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 -> 0d5255e9cc8ffb776115e75fa8fa1fa6c2774a79275dfd8235c357288b00417c [2025-03-09 00:54:09,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:54:09,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:54:09,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:54:09,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:54:09,174 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:54:09,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-12.i [2025-03-09 00:54:10,304 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf29c339/fd02ba95f57446f9a7e978ec28767443/FLAG28fbc427d [2025-03-09 00:54:10,576 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:54:10,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-12.i [2025-03-09 00:54:10,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf29c339/fd02ba95f57446f9a7e978ec28767443/FLAG28fbc427d [2025-03-09 00:54:10,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf29c339/fd02ba95f57446f9a7e978ec28767443 [2025-03-09 00:54:10,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:54:10,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:54:10,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:54:10,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:54:10,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:54:10,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:54:10" (1/1) ... [2025-03-09 00:54:10,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb1f29c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:10, skipping insertion in model container [2025-03-09 00:54:10,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:54:10" (1/1) ... [2025-03-09 00:54:10,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:54:11,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:54:11,143 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:54:11,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:54:11,207 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:54:11,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:11 WrapperNode [2025-03-09 00:54:11,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:54:11,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:54:11,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:54:11,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:54:11,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:11" (1/1) ... [2025-03-09 00:54:11,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:11" (1/1) ... [2025-03-09 00:54:11,232 INFO L138 Inliner]: procedures = 164, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 65 [2025-03-09 00:54:11,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:54:11,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:54:11,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:54:11,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:54:11,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:11" (1/1) ... [2025-03-09 00:54:11,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:11" (1/1) ... [2025-03-09 00:54:11,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:11" (1/1) ... [2025-03-09 00:54:11,247 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 00:54:11,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:11" (1/1) ... [2025-03-09 00:54:11,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:11" (1/1) ... [2025-03-09 00:54:11,251 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:11" (1/1) ... [2025-03-09 00:54:11,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:11" (1/1) ... [2025-03-09 00:54:11,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:11" (1/1) ... [2025-03-09 00:54:11,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:11" (1/1) ... [2025-03-09 00:54:11,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:54:11,255 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:54:11,255 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:54:11,255 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:54:11,256 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:11" (1/1) ... [2025-03-09 00:54:11,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:54:11,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:11,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:54:11,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:54:11,303 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 00:54:11,303 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 00:54:11,303 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 00:54:11,303 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 00:54:11,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:54:11,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:54:11,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:54:11,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:54:11,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:54:11,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:54:11,306 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:54:11,395 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:54:11,396 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:54:11,510 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:54:11,510 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:54:11,581 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:54:11,581 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:54:11,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:54:11 BoogieIcfgContainer [2025-03-09 00:54:11,582 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:54:11,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:54:11,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:54:11,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:54:11,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:54:10" (1/3) ... [2025-03-09 00:54:11,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3afa3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:54:11, skipping insertion in model container [2025-03-09 00:54:11,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:11" (2/3) ... [2025-03-09 00:54:11,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3afa3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:54:11, skipping insertion in model container [2025-03-09 00:54:11,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:54:11" (3/3) ... [2025-03-09 00:54:11,589 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-12.i [2025-03-09 00:54:11,599 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:54:11,600 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-12.i that has 3 procedures, 30 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-09 00:54:11,600 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:54:11,631 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:54:11,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 76 flow [2025-03-09 00:54:11,674 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-03-09 00:54:11,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:54:11,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 5/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-03-09 00:54:11,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 34 transitions, 76 flow [2025-03-09 00:54:11,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 32 transitions, 70 flow [2025-03-09 00:54:11,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:54:11,694 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;@629e7505, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:54:11,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 00:54:11,701 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:54:11,702 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2025-03-09 00:54:11,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:54:11,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:11,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:11,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:11,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:11,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1473564154, now seen corresponding path program 1 times [2025-03-09 00:54:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:11,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678260985] [2025-03-09 00:54:11,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:11,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:54:11,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:54:11,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:11,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:11,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:11,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678260985] [2025-03-09 00:54:11,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678260985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:54:11,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:54:11,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:54:11,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398635480] [2025-03-09 00:54:11,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:54:11,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:54:11,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:11,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:54:11,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:54:11,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:54:11,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:11,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:11,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:54:11,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:12,078 INFO L124 PetriNetUnfolderBase]: 297/523 cut-off events. [2025-03-09 00:54:12,081 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 00:54:12,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 523 events. 297/523 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2156 event pairs, 39 based on Foata normal form. 32/534 useless extension candidates. Maximal degree in co-relation 974. Up to 353 conditions per place. [2025-03-09 00:54:12,087 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 29 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2025-03-09 00:54:12,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 146 flow [2025-03-09 00:54:12,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:54:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:54:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-09 00:54:12,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2025-03-09 00:54:12,097 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 70 flow. Second operand 3 states and 59 transitions. [2025-03-09 00:54:12,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 146 flow [2025-03-09 00:54:12,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:54:12,102 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 72 flow [2025-03-09 00:54:12,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2025-03-09 00:54:12,107 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-03-09 00:54:12,107 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 72 flow [2025-03-09 00:54:12,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:12,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:12,108 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:12,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:54:12,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:12,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:12,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1404976497, now seen corresponding path program 1 times [2025-03-09 00:54:12,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:12,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268352919] [2025-03-09 00:54:12,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:12,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:12,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:54:12,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:54:12,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:12,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:12,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:12,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268352919] [2025-03-09 00:54:12,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268352919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:12,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309079724] [2025-03-09 00:54:12,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:12,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:12,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:12,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:12,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:54:12,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:54:12,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:54:12,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:12,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:12,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 00:54:12,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 00:54:12,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:54:12,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309079724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:54:12,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 00:54:12,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-09 00:54:12,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452905171] [2025-03-09 00:54:12,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:54:12,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:54:12,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:12,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:54:12,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:54:12,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-09 00:54:12,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:12,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:12,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-09 00:54:12,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:12,392 INFO L124 PetriNetUnfolderBase]: 265/459 cut-off events. [2025-03-09 00:54:12,392 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 00:54:12,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 459 events. 265/459 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1781 event pairs, 183 based on Foata normal form. 16/454 useless extension candidates. Maximal degree in co-relation 926. Up to 405 conditions per place. [2025-03-09 00:54:12,395 INFO L140 encePairwiseOnDemand]: 32/34 looper letters, 21 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2025-03-09 00:54:12,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 116 flow [2025-03-09 00:54:12,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:54:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:54:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-09 00:54:12,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43137254901960786 [2025-03-09 00:54:12,396 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 72 flow. Second operand 3 states and 44 transitions. [2025-03-09 00:54:12,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 116 flow [2025-03-09 00:54:12,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:54:12,397 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 68 flow [2025-03-09 00:54:12,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2025-03-09 00:54:12,398 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2025-03-09 00:54:12,398 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 68 flow [2025-03-09 00:54:12,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:12,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:12,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:12,405 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-09 00:54:12,598 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-09 00:54:12,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:12,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:12,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1404975617, now seen corresponding path program 1 times [2025-03-09 00:54:12,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:12,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747388085] [2025-03-09 00:54:12,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:12,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:12,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:54:12,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:54:12,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:12,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:12,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747388085] [2025-03-09 00:54:12,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747388085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637687386] [2025-03-09 00:54:12,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:12,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:12,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:12,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:12,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:54:12,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:54:12,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:54:12,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:12,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:12,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:54:12,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:12,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:12,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:12,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637687386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:12,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:12,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 00:54:12,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609636083] [2025-03-09 00:54:12,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:12,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:54:12,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:12,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:54:12,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:54:12,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:54:12,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:12,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:12,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:54:12,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:12,926 INFO L124 PetriNetUnfolderBase]: 329/555 cut-off events. [2025-03-09 00:54:12,926 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 00:54:12,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 555 events. 329/555 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2078 event pairs, 39 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1160. Up to 257 conditions per place. [2025-03-09 00:54:12,929 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 52 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-03-09 00:54:12,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 62 transitions, 258 flow [2025-03-09 00:54:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:54:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:54:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-03-09 00:54:12,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2025-03-09 00:54:12,930 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 68 flow. Second operand 6 states and 108 transitions. [2025-03-09 00:54:12,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 62 transitions, 258 flow [2025-03-09 00:54:12,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 62 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:54:12,931 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 103 flow [2025-03-09 00:54:12,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=103, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2025-03-09 00:54:12,933 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2025-03-09 00:54:12,933 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 103 flow [2025-03-09 00:54:12,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:12,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:12,933 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:12,939 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-09 00:54:13,133 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,SelfDestructingSolverStorable2 [2025-03-09 00:54:13,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:13,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:13,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2051551574, now seen corresponding path program 2 times [2025-03-09 00:54:13,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:13,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921608264] [2025-03-09 00:54:13,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:54:13,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:13,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 00:54:13,152 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:54:13,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:54:13,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:13,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:13,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921608264] [2025-03-09 00:54:13,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921608264] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:13,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132197486] [2025-03-09 00:54:13,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:54:13,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:13,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:13,255 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:13,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:54:13,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 00:54:13,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:54:13,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:54:13,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:13,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:54:13,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:13,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:13,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132197486] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:13,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:13,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 00:54:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885362422] [2025-03-09 00:54:13,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:13,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:54:13,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:13,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:54:13,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:54:13,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:54:13,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 103 flow. Second operand has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:13,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:13,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:54:13,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:13,580 INFO L124 PetriNetUnfolderBase]: 521/843 cut-off events. [2025-03-09 00:54:13,581 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-03-09 00:54:13,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2116 conditions, 843 events. 521/843 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3138 event pairs, 39 based on Foata normal form. 96/934 useless extension candidates. Maximal degree in co-relation 2104. Up to 257 conditions per place. [2025-03-09 00:54:13,584 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 100 selfloop transitions, 11 changer transitions 0/116 dead transitions. [2025-03-09 00:54:13,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 116 transitions, 521 flow [2025-03-09 00:54:13,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:54:13,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 00:54:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2025-03-09 00:54:13,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5220588235294118 [2025-03-09 00:54:13,586 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 103 flow. Second operand 12 states and 213 transitions. [2025-03-09 00:54:13,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 116 transitions, 521 flow [2025-03-09 00:54:13,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 116 transitions, 507 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-09 00:54:13,591 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 173 flow [2025-03-09 00:54:13,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=173, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2025-03-09 00:54:13,592 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2025-03-09 00:54:13,592 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 173 flow [2025-03-09 00:54:13,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:13,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:13,593 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:13,599 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-09 00:54:13,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:13,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:13,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1525932406, now seen corresponding path program 3 times [2025-03-09 00:54:13,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:13,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139506551] [2025-03-09 00:54:13,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:54:13,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:13,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-03-09 00:54:13,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 00:54:13,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 00:54:13,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:14,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:14,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139506551] [2025-03-09 00:54:14,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139506551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:14,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946761226] [2025-03-09 00:54:14,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:54:14,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:14,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:14,008 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:14,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:54:14,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-03-09 00:54:14,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 00:54:14,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 00:54:14,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:14,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 00:54:14,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:14,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:14,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946761226] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:14,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:14,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-09 00:54:14,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603063175] [2025-03-09 00:54:14,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:14,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 00:54:14,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:14,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 00:54:14,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-09 00:54:14,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:54:14,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 173 flow. Second operand has 25 states, 25 states have (on average 9.44) internal successors, (236), 25 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:14,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:14,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:54:14,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:14,635 INFO L124 PetriNetUnfolderBase]: 905/1419 cut-off events. [2025-03-09 00:54:14,635 INFO L125 PetriNetUnfolderBase]: For 7468/7468 co-relation queries the response was YES. [2025-03-09 00:54:14,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4123 conditions, 1419 events. 905/1419 cut-off events. For 7468/7468 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5205 event pairs, 39 based on Foata normal form. 192/1606 useless extension candidates. Maximal degree in co-relation 4104. Up to 337 conditions per place. [2025-03-09 00:54:14,643 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 196 selfloop transitions, 23 changer transitions 0/224 dead transitions. [2025-03-09 00:54:14,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 224 transitions, 1059 flow [2025-03-09 00:54:14,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 00:54:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-09 00:54:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 423 transitions. [2025-03-09 00:54:14,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183823529411765 [2025-03-09 00:54:14,645 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 173 flow. Second operand 24 states and 423 transitions. [2025-03-09 00:54:14,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 224 transitions, 1059 flow [2025-03-09 00:54:14,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 224 transitions, 987 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-03-09 00:54:14,658 INFO L231 Difference]: Finished difference. Result has 85 places, 48 transitions, 293 flow [2025-03-09 00:54:14,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=293, PETRI_PLACES=85, PETRI_TRANSITIONS=48} [2025-03-09 00:54:14,661 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2025-03-09 00:54:14,661 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 48 transitions, 293 flow [2025-03-09 00:54:14,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.44) internal successors, (236), 25 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:14,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:14,661 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:14,668 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-09 00:54:14,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:14,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:14,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:14,865 INFO L85 PathProgramCache]: Analyzing trace with hash 773359178, now seen corresponding path program 4 times [2025-03-09 00:54:14,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:14,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494306891] [2025-03-09 00:54:14,865 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 00:54:14,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:14,872 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:54:14,888 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 00:54:14,890 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 00:54:14,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:15,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:15,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494306891] [2025-03-09 00:54:15,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494306891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:15,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205501868] [2025-03-09 00:54:15,270 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 00:54:15,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:15,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:15,273 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:15,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:54:15,313 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-09 00:54:15,338 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 00:54:15,339 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 00:54:15,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:15,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 00:54:15,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:15,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:15,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205501868] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:15,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:15,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 28 [2025-03-09 00:54:15,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608524161] [2025-03-09 00:54:15,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:15,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 00:54:15,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:15,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 00:54:15,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2025-03-09 00:54:15,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:54:15,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 48 transitions, 293 flow. Second operand has 28 states, 28 states have (on average 9.392857142857142) internal successors, (263), 28 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:15,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:15,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:54:15,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:16,086 INFO L124 PetriNetUnfolderBase]: 1033/1611 cut-off events. [2025-03-09 00:54:16,086 INFO L125 PetriNetUnfolderBase]: For 16588/16588 co-relation queries the response was YES. [2025-03-09 00:54:16,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4903 conditions, 1611 events. 1033/1611 cut-off events. For 16588/16588 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5886 event pairs, 39 based on Foata normal form. 64/1670 useless extension candidates. Maximal degree in co-relation 4872. Up to 305 conditions per place. [2025-03-09 00:54:16,093 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 228 selfloop transitions, 27 changer transitions 0/260 dead transitions. [2025-03-09 00:54:16,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 260 transitions, 1251 flow [2025-03-09 00:54:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 00:54:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-09 00:54:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 483 transitions. [2025-03-09 00:54:16,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2025-03-09 00:54:16,095 INFO L175 Difference]: Start difference. First operand has 85 places, 48 transitions, 293 flow. Second operand 28 states and 483 transitions. [2025-03-09 00:54:16,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 260 transitions, 1251 flow [2025-03-09 00:54:16,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 260 transitions, 1147 flow, removed 41 selfloop flow, removed 11 redundant places. [2025-03-09 00:54:16,107 INFO L231 Difference]: Finished difference. Result has 105 places, 52 transitions, 293 flow [2025-03-09 00:54:16,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=293, PETRI_PLACES=105, PETRI_TRANSITIONS=52} [2025-03-09 00:54:16,107 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 71 predicate places. [2025-03-09 00:54:16,108 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 52 transitions, 293 flow [2025-03-09 00:54:16,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.392857142857142) internal successors, (263), 28 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:16,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:16,108 INFO L206 CegarLoopForPetriNet]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:16,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 00:54:16,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:16,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:16,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:16,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2002129802, now seen corresponding path program 5 times [2025-03-09 00:54:16,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:16,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340267945] [2025-03-09 00:54:16,313 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 00:54:16,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:16,319 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 14 equivalence classes. [2025-03-09 00:54:16,392 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 00:54:16,393 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-09 00:54:16,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:17,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:17,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340267945] [2025-03-09 00:54:17,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340267945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:17,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429574216] [2025-03-09 00:54:17,917 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 00:54:17,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:17,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:17,919 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-09 00:54:17,921 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-09 00:54:17,958 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 14 equivalence classes. [2025-03-09 00:54:17,989 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 00:54:17,989 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-09 00:54:17,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:17,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-09 00:54:17,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 300 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:19,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:21,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429574216] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:21,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:21,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 96 [2025-03-09 00:54:21,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723019279] [2025-03-09 00:54:21,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:21,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-03-09 00:54:21,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:21,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-03-09 00:54:21,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1338, Invalid=7974, Unknown=0, NotChecked=0, Total=9312 [2025-03-09 00:54:21,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-09 00:54:21,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 52 transitions, 293 flow. Second operand has 97 states, 97 states have (on average 8.164948453608247) internal successors, (792), 97 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:21,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:21,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-09 00:54:21,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:03,381 INFO L124 PetriNetUnfolderBase]: 41560/67417 cut-off events. [2025-03-09 00:55:03,381 INFO L125 PetriNetUnfolderBase]: For 240492/240492 co-relation queries the response was YES. [2025-03-09 00:55:03,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183785 conditions, 67417 events. 41560/67417 cut-off events. For 240492/240492 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 460359 event pairs, 679 based on Foata normal form. 0/66837 useless extension candidates. Maximal degree in co-relation 183750. Up to 8745 conditions per place. [2025-03-09 00:55:03,883 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 809 selfloop transitions, 1594 changer transitions 1229/3636 dead transitions. [2025-03-09 00:55:03,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 3636 transitions, 24858 flow [2025-03-09 00:55:03,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2025-03-09 00:55:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2025-03-09 00:55:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 4032 transitions. [2025-03-09 00:55:03,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45964432284541723 [2025-03-09 00:55:03,900 INFO L175 Difference]: Start difference. First operand has 105 places, 52 transitions, 293 flow. Second operand 258 states and 4032 transitions. [2025-03-09 00:55:03,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 3636 transitions, 24858 flow [2025-03-09 00:55:04,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 3636 transitions, 20836 flow, removed 754 selfloop flow, removed 23 redundant places. [2025-03-09 00:55:04,509 INFO L231 Difference]: Finished difference. Result has 457 places, 1745 transitions, 10759 flow [2025-03-09 00:55:04,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=258, PETRI_FLOW=10759, PETRI_PLACES=457, PETRI_TRANSITIONS=1745} [2025-03-09 00:55:04,510 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 423 predicate places. [2025-03-09 00:55:04,510 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 1745 transitions, 10759 flow [2025-03-09 00:55:04,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 8.164948453608247) internal successors, (792), 97 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:04,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:04,511 INFO L206 CegarLoopForPetriNet]: trace histogram [26, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:04,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 00:55:04,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:04,716 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:55:04,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:04,717 INFO L85 PathProgramCache]: Analyzing trace with hash 277846046, now seen corresponding path program 1 times [2025-03-09 00:55:04,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:04,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37341724] [2025-03-09 00:55:04,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:04,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:04,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 00:55:04,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 00:55:04,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:04,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:06,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:06,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37341724] [2025-03-09 00:55:06,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37341724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:55:06,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568982328] [2025-03-09 00:55:06,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:06,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:06,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:06,309 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:55:06,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:55:06,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 00:55:06,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 00:55:06,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:06,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:06,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-09 00:55:06,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:55:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 300 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:07,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:55:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:09,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568982328] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:55:09,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:55:09,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 101 [2025-03-09 00:55:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965460062] [2025-03-09 00:55:09,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:55:09,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2025-03-09 00:55:09,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:09,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2025-03-09 00:55:09,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1426, Invalid=8876, Unknown=0, NotChecked=0, Total=10302 [2025-03-09 00:55:09,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-09 00:55:09,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 1745 transitions, 10759 flow. Second operand has 102 states, 102 states have (on average 8.215686274509803) internal successors, (838), 102 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:09,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:09,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-09 00:55:09,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand