./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/fib_safe-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/fib_safe-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 e169a35d3412f69777e600b250d6db82170a9573bed36816bd393f67ca1b5302 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:40:59,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:40:59,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:40:59,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:40:59,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:40:59,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:40:59,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:40:59,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:40:59,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:40:59,171 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:40:59,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:40:59,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:40:59,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:40:59,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:40:59,172 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:40:59,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:40:59,173 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:40:59,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:40:59,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:40:59,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:40:59,173 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:40:59,173 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:40:59,173 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:40:59,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:40:59,173 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:40:59,174 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:40:59,174 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:40:59,174 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:40:59,174 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:40:59,174 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:40:59,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:40:59,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:40:59,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:40:59,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:40:59,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:40:59,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:40:59,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:40:59,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:40:59,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:40:59,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:40:59,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:40:59,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:40:59,176 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 -> e169a35d3412f69777e600b250d6db82170a9573bed36816bd393f67ca1b5302 [2025-03-04 09:40:59,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:40:59,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:40:59,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:40:59,418 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:40:59,419 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:40:59,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_safe-12.i [2025-03-04 09:41:00,606 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1262a63ea/f81a8708803a48fea84791a8ecb8c86c/FLAGc0e491b78 [2025-03-04 09:41:00,884 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:41:00,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_safe-12.i [2025-03-04 09:41:00,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1262a63ea/f81a8708803a48fea84791a8ecb8c86c/FLAGc0e491b78 [2025-03-04 09:41:00,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1262a63ea/f81a8708803a48fea84791a8ecb8c86c [2025-03-04 09:41:00,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:41:00,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:41:00,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:41:00,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:41:00,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:41:00,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:41:00" (1/1) ... [2025-03-04 09:41:00,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ff2de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:00, skipping insertion in model container [2025-03-04 09:41:00,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:41:00" (1/1) ... [2025-03-04 09:41:00,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:41:01,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:41:01,167 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:41:01,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:41:01,242 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:41:01,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:01 WrapperNode [2025-03-04 09:41:01,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:41:01,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:41:01,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:41:01,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:41:01,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:01" (1/1) ... [2025-03-04 09:41:01,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:01" (1/1) ... [2025-03-04 09:41:01,269 INFO L138 Inliner]: procedures = 164, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 65 [2025-03-04 09:41:01,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:41:01,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:41:01,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:41:01,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:41:01,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:01" (1/1) ... [2025-03-04 09:41:01,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:01" (1/1) ... [2025-03-04 09:41:01,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:01" (1/1) ... [2025-03-04 09:41:01,284 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 09:41:01,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:01" (1/1) ... [2025-03-04 09:41:01,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:01" (1/1) ... [2025-03-04 09:41:01,287 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:01" (1/1) ... [2025-03-04 09:41:01,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:01" (1/1) ... [2025-03-04 09:41:01,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:01" (1/1) ... [2025-03-04 09:41:01,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:01" (1/1) ... [2025-03-04 09:41:01,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:41:01,290 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:41:01,290 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:41:01,290 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:41:01,291 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:01" (1/1) ... [2025-03-04 09:41:01,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:41:01,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:41:01,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:41:01,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:41:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 09:41:01,334 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 09:41:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 09:41:01,334 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 09:41:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:41:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:41:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:41:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:41:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:41:01,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:41:01,336 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:41:01,428 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:41:01,429 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:41:01,574 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:41:01,574 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:41:01,672 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:41:01,672 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:41:01,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:41:01 BoogieIcfgContainer [2025-03-04 09:41:01,672 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:41:01,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:41:01,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:41:01,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:41:01,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:41:00" (1/3) ... [2025-03-04 09:41:01,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3e47de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:41:01, skipping insertion in model container [2025-03-04 09:41:01,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:41:01" (2/3) ... [2025-03-04 09:41:01,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3e47de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:41:01, skipping insertion in model container [2025-03-04 09:41:01,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:41:01" (3/3) ... [2025-03-04 09:41:01,681 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_safe-12.i [2025-03-04 09:41:01,692 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:41:01,693 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_safe-12.i that has 3 procedures, 30 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-04 09:41:01,694 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:41:01,731 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:41:01,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 76 flow [2025-03-04 09:41:01,780 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-03-04 09:41:01,781 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:41:01,784 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-04 09:41:01,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 34 transitions, 76 flow [2025-03-04 09:41:01,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 32 transitions, 70 flow [2025-03-04 09:41:01,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:41:01,802 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;@8685415, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:41:01,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 09:41:01,813 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:41:01,813 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2025-03-04 09:41:01,813 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:41:01,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:01,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:41:01,816 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-04 09:41:01,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1473564154, now seen corresponding path program 1 times [2025-03-04 09:41:01,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:01,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538284961] [2025-03-04 09:41:01,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:01,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:01,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 09:41:01,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 09:41:01,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:01,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:41:02,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:02,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538284961] [2025-03-04 09:41:02,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538284961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:41:02,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:41:02,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:41:02,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931389814] [2025-03-04 09:41:02,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:41:02,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:41:02,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:02,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:41:02,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:41:02,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-04 09:41:02,037 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-04 09:41:02,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:02,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-04 09:41:02,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:02,206 INFO L124 PetriNetUnfolderBase]: 297/523 cut-off events. [2025-03-04 09:41:02,206 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 09:41:02,208 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-04 09:41:02,211 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 29 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2025-03-04 09:41:02,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 146 flow [2025-03-04 09:41:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:41:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:41:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-04 09:41:02,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2025-03-04 09:41:02,224 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 70 flow. Second operand 3 states and 59 transitions. [2025-03-04 09:41:02,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 146 flow [2025-03-04 09:41:02,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:41:02,229 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 72 flow [2025-03-04 09:41:02,231 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-04 09:41:02,233 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-03-04 09:41:02,233 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 72 flow [2025-03-04 09:41:02,234 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-04 09:41:02,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:02,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:41:02,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:41:02,234 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-04 09:41:02,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:02,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1404976497, now seen corresponding path program 1 times [2025-03-04 09:41:02,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:02,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744900251] [2025-03-04 09:41:02,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:02,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:02,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:41:02,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:41:02,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:02,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:41:02,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:02,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744900251] [2025-03-04 09:41:02,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744900251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:41:02,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977837107] [2025-03-04 09:41:02,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:02,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:41:02,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:41:02,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:41:02,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:41:02,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:41:02,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:41:02,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:02,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:02,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 09:41:02,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:41:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:41:02,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:41:02,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977837107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:41:02,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 09:41:02,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-04 09:41:02,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581560767] [2025-03-04 09:41:02,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:41:02,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:41:02,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:02,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:41:02,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:41:02,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 09:41:02,434 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-04 09:41:02,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:02,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 09:41:02,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:02,500 INFO L124 PetriNetUnfolderBase]: 265/459 cut-off events. [2025-03-04 09:41:02,501 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 09:41:02,503 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-04 09:41:02,505 INFO L140 encePairwiseOnDemand]: 32/34 looper letters, 21 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2025-03-04 09:41:02,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 116 flow [2025-03-04 09:41:02,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:41:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:41:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-04 09:41:02,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43137254901960786 [2025-03-04 09:41:02,506 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 72 flow. Second operand 3 states and 44 transitions. [2025-03-04 09:41:02,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 116 flow [2025-03-04 09:41:02,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:41:02,507 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 68 flow [2025-03-04 09:41:02,508 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-04 09:41:02,508 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2025-03-04 09:41:02,508 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 68 flow [2025-03-04 09:41:02,508 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-04 09:41:02,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:02,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:41:02,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:41:02,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:41:02,709 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-04 09:41:02,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:02,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1404975617, now seen corresponding path program 1 times [2025-03-04 09:41:02,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:02,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129296909] [2025-03-04 09:41:02,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:02,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:02,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:41:02,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:41:02,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:02,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:41:02,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:02,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129296909] [2025-03-04 09:41:02,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129296909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:41:02,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319345375] [2025-03-04 09:41:02,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:02,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:41:02,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:41:02,782 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:41:02,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:41:02,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:41:02,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:41:02,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:02,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:02,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:41:02,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:41:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:41:02,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:41:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:41:02,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319345375] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:41:02,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:41:02,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 09:41:02,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772457263] [2025-03-04 09:41:02,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:41:02,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:41:02,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:02,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:41:02,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:41:02,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-04 09:41:02,875 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-04 09:41:02,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:02,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-04 09:41:02,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:02,986 INFO L124 PetriNetUnfolderBase]: 329/555 cut-off events. [2025-03-04 09:41:02,986 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 09:41:02,987 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-04 09:41:02,989 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 52 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-03-04 09:41:02,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 62 transitions, 258 flow [2025-03-04 09:41:02,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:41:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:41:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-03-04 09:41:02,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2025-03-04 09:41:02,991 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 68 flow. Second operand 6 states and 108 transitions. [2025-03-04 09:41:02,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 62 transitions, 258 flow [2025-03-04 09:41:02,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 62 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:41:02,992 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 103 flow [2025-03-04 09:41:02,992 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-04 09:41:02,993 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2025-03-04 09:41:02,993 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 103 flow [2025-03-04 09:41:02,993 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-04 09:41:02,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:02,993 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:41:02,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 09:41:03,194 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-04 09:41:03,194 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-04 09:41:03,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:03,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2051551574, now seen corresponding path program 2 times [2025-03-04 09:41:03,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:03,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211058362] [2025-03-04 09:41:03,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:41:03,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:03,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 09:41:03,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:41:03,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:41:03,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:03,306 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-04 09:41:03,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:03,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211058362] [2025-03-04 09:41:03,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211058362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:41:03,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19050284] [2025-03-04 09:41:03,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:41:03,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:41:03,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:41:03,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:41:03,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:41:03,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 09:41:03,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:41:03,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:41:03,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:03,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:41:03,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:41:03,386 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-04 09:41:03,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:41:03,443 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-04 09:41:03,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19050284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:41:03,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:41:03,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 09:41:03,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789553980] [2025-03-04 09:41:03,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:41:03,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:41:03,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:03,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:41:03,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:41:03,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-04 09:41:03,446 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-04 09:41:03,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:03,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-04 09:41:03,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:03,633 INFO L124 PetriNetUnfolderBase]: 521/843 cut-off events. [2025-03-04 09:41:03,633 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-03-04 09:41:03,643 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-04 09:41:03,646 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 100 selfloop transitions, 11 changer transitions 0/116 dead transitions. [2025-03-04 09:41:03,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 116 transitions, 521 flow [2025-03-04 09:41:03,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:41:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 09:41:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2025-03-04 09:41:03,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5220588235294118 [2025-03-04 09:41:03,648 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 103 flow. Second operand 12 states and 213 transitions. [2025-03-04 09:41:03,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 116 transitions, 521 flow [2025-03-04 09:41:03,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 116 transitions, 507 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 09:41:03,654 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 173 flow [2025-03-04 09:41:03,655 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-04 09:41:03,655 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2025-03-04 09:41:03,655 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 173 flow [2025-03-04 09:41:03,655 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-04 09:41:03,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:03,656 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:41:03,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 09:41:03,856 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-04 09:41:03,856 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-04 09:41:03,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1525932406, now seen corresponding path program 3 times [2025-03-04 09:41:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:03,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215127705] [2025-03-04 09:41:03,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:41:03,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:03,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-03-04 09:41:03,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:41:03,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 09:41:03,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:04,052 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-04 09:41:04,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:04,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215127705] [2025-03-04 09:41:04,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215127705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:41:04,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505749034] [2025-03-04 09:41:04,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:41:04,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:41:04,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:41:04,054 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:41:04,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:41:04,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-03-04 09:41:04,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:41:04,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 09:41:04,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:04,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 09:41:04,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:41:04,140 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-04 09:41:04,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:41:04,324 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-04 09:41:04,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505749034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:41:04,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:41:04,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-04 09:41:04,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197237855] [2025-03-04 09:41:04,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:41:04,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 09:41:04,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:04,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 09:41:04,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-04 09:41:04,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-04 09:41:04,326 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-04 09:41:04,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:04,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-04 09:41:04,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:04,651 INFO L124 PetriNetUnfolderBase]: 905/1419 cut-off events. [2025-03-04 09:41:04,651 INFO L125 PetriNetUnfolderBase]: For 7468/7468 co-relation queries the response was YES. [2025-03-04 09:41:04,655 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-04 09:41:04,659 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 196 selfloop transitions, 23 changer transitions 0/224 dead transitions. [2025-03-04 09:41:04,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 224 transitions, 1059 flow [2025-03-04 09:41:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 09:41:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 09:41:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 423 transitions. [2025-03-04 09:41:04,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183823529411765 [2025-03-04 09:41:04,662 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 173 flow. Second operand 24 states and 423 transitions. [2025-03-04 09:41:04,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 224 transitions, 1059 flow [2025-03-04 09:41:04,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 224 transitions, 987 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-03-04 09:41:04,670 INFO L231 Difference]: Finished difference. Result has 85 places, 48 transitions, 293 flow [2025-03-04 09:41:04,671 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-04 09:41:04,671 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2025-03-04 09:41:04,671 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 48 transitions, 293 flow [2025-03-04 09:41:04,672 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-04 09:41:04,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:04,672 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:41:04,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 09:41:04,872 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-04 09:41:04,873 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-04 09:41:04,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:04,873 INFO L85 PathProgramCache]: Analyzing trace with hash 773359178, now seen corresponding path program 4 times [2025-03-04 09:41:04,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:04,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40370025] [2025-03-04 09:41:04,873 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 09:41:04,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:04,881 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-04 09:41:04,895 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 09:41:04,896 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 09:41:04,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:05,293 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-04 09:41:05,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:05,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40370025] [2025-03-04 09:41:05,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40370025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:41:05,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194847468] [2025-03-04 09:41:05,294 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 09:41:05,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:41:05,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:41:05,296 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:41:05,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:41:05,346 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-04 09:41:05,380 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 09:41:05,380 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 09:41:05,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:05,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 09:41:05,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:41:05,430 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-04 09:41:05,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:41:05,766 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-04 09:41:05,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194847468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:41:05,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:41:05,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 28 [2025-03-04 09:41:05,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560041871] [2025-03-04 09:41:05,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:41:05,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 09:41:05,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:05,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 09:41:05,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2025-03-04 09:41:05,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-04 09:41:05,770 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-04 09:41:05,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:05,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-04 09:41:05,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:06,146 INFO L124 PetriNetUnfolderBase]: 1033/1611 cut-off events. [2025-03-04 09:41:06,146 INFO L125 PetriNetUnfolderBase]: For 16588/16588 co-relation queries the response was YES. [2025-03-04 09:41:06,149 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-04 09:41:06,154 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 228 selfloop transitions, 27 changer transitions 0/260 dead transitions. [2025-03-04 09:41:06,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 260 transitions, 1251 flow [2025-03-04 09:41:06,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 09:41:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 09:41:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 483 transitions. [2025-03-04 09:41:06,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2025-03-04 09:41:06,159 INFO L175 Difference]: Start difference. First operand has 85 places, 48 transitions, 293 flow. Second operand 28 states and 483 transitions. [2025-03-04 09:41:06,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 260 transitions, 1251 flow [2025-03-04 09:41:06,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 260 transitions, 1147 flow, removed 41 selfloop flow, removed 11 redundant places. [2025-03-04 09:41:06,177 INFO L231 Difference]: Finished difference. Result has 105 places, 52 transitions, 293 flow [2025-03-04 09:41:06,177 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-04 09:41:06,177 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 71 predicate places. [2025-03-04 09:41:06,177 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 52 transitions, 293 flow [2025-03-04 09:41:06,180 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-04 09:41:06,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:06,180 INFO L206 CegarLoopForPetriNet]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:41:06,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:41:06,380 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-04 09:41:06,381 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-04 09:41:06,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:06,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2002129802, now seen corresponding path program 5 times [2025-03-04 09:41:06,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:06,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335958459] [2025-03-04 09:41:06,381 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 09:41:06,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:06,388 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 14 equivalence classes. [2025-03-04 09:41:06,483 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 09:41:06,483 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-04 09:41:06,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:07,948 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-04 09:41:07,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:07,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335958459] [2025-03-04 09:41:07,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335958459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:41:07,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524565126] [2025-03-04 09:41:07,948 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 09:41:07,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:41:07,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:41:07,951 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:41:07,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:41:07,994 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 14 equivalence classes. [2025-03-04 09:41:08,025 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 09:41:08,025 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-04 09:41:08,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:08,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-04 09:41:08,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:41:09,524 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-04 09:41:09,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:41:11,149 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-04 09:41:11,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524565126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:41:11,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:41:11,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 96 [2025-03-04 09:41:11,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917598020] [2025-03-04 09:41:11,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:41:11,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-03-04 09:41:11,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:11,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-03-04 09:41:11,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1343, Invalid=7969, Unknown=0, NotChecked=0, Total=9312 [2025-03-04 09:41:11,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 09:41:11,157 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-04 09:41:11,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:11,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 09:41:11,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:41:53,504 INFO L124 PetriNetUnfolderBase]: 41836/68850 cut-off events. [2025-03-04 09:41:53,504 INFO L125 PetriNetUnfolderBase]: For 264312/264312 co-relation queries the response was YES. [2025-03-04 09:41:53,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185890 conditions, 68850 events. 41836/68850 cut-off events. For 264312/264312 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 479398 event pairs, 711 based on Foata normal form. 0/68270 useless extension candidates. Maximal degree in co-relation 185855. Up to 8823 conditions per place. [2025-03-04 09:41:53,991 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 813 selfloop transitions, 1600 changer transitions 1229/3646 dead transitions. [2025-03-04 09:41:53,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 3646 transitions, 24934 flow [2025-03-04 09:41:53,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 258 states. [2025-03-04 09:41:53,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2025-03-04 09:41:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 4034 transitions. [2025-03-04 09:41:54,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45987232102143183 [2025-03-04 09:41:54,002 INFO L175 Difference]: Start difference. First operand has 105 places, 52 transitions, 293 flow. Second operand 258 states and 4034 transitions. [2025-03-04 09:41:54,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 3646 transitions, 24934 flow [2025-03-04 09:41:54,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 3646 transitions, 20896 flow, removed 754 selfloop flow, removed 23 redundant places. [2025-03-04 09:41:54,320 INFO L231 Difference]: Finished difference. Result has 457 places, 1753 transitions, 10815 flow [2025-03-04 09:41:54,320 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=10815, PETRI_PLACES=457, PETRI_TRANSITIONS=1753} [2025-03-04 09:41:54,322 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 423 predicate places. [2025-03-04 09:41:54,322 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 1753 transitions, 10815 flow [2025-03-04 09:41:54,323 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-04 09:41:54,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:41:54,323 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-04 09:41:54,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 09:41:54,523 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-04 09:41:54,524 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-04 09:41:54,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:41:54,524 INFO L85 PathProgramCache]: Analyzing trace with hash 277846046, now seen corresponding path program 1 times [2025-03-04 09:41:54,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:41:54,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993576710] [2025-03-04 09:41:54,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:54,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:41:54,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 09:41:54,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 09:41:54,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:54,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:55,982 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-04 09:41:55,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:41:55,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993576710] [2025-03-04 09:41:55,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993576710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:41:55,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505511546] [2025-03-04 09:41:55,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:41:55,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:41:55,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:41:55,985 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:41:55,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 09:41:56,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 09:41:56,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 09:41:56,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:41:56,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:41:56,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-04 09:41:56,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:41:57,433 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-04 09:41:57,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:41:58,931 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-04 09:41:58,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505511546] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:41:58,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:41:58,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 101 [2025-03-04 09:41:58,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890966155] [2025-03-04 09:41:58,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:41:58,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2025-03-04 09:41:58,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:41:58,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2025-03-04 09:41:58,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1435, Invalid=8867, Unknown=0, NotChecked=0, Total=10302 [2025-03-04 09:41:58,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-04 09:41:58,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 1753 transitions, 10815 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-04 09:41:58,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:41:58,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-04 09:41:58,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand