./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/fib_unsafe-6.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 854e371c98b43d805c328b457758892c4a501d7b326c2672c089850792494a4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:54:11,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:54:11,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:54:11,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:54:11,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:54:11,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:54:11,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:54:11,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:54:11,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:54:11,158 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:54:11,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:54:11,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:54:11,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:54:11,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:54:11,159 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:54:11,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:54:11,159 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:54:11,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:54:11,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:54:11,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:54:11,160 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:54:11,160 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:54:11,160 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:54:11,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:54:11,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:54:11,160 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:54:11,160 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:54:11,160 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:54:11,160 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:54:11,161 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:54:11,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:54:11,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:54:11,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:54:11,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:54:11,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:54:11,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:54:11,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:54:11,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:54:11,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:54:11,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:54:11,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:54:11,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:54:11,161 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 -> 854e371c98b43d805c328b457758892c4a501d7b326c2672c089850792494a4b [2025-03-09 00:54:11,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:54:11,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:54:11,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:54:11,370 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:54:11,370 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:54:11,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-6.i [2025-03-09 00:54:12,481 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69bf38b0c/cfb00187702341f2ade8dcf36d9c478f/FLAGcdca5f05a [2025-03-09 00:54:12,784 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:54:12,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-6.i [2025-03-09 00:54:12,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69bf38b0c/cfb00187702341f2ade8dcf36d9c478f/FLAGcdca5f05a [2025-03-09 00:54:12,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69bf38b0c/cfb00187702341f2ade8dcf36d9c478f [2025-03-09 00:54:12,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:54:12,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:54:12,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:54:12,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:54:12,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:54:12,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:54:12" (1/1) ... [2025-03-09 00:54:12,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0e4973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:12, skipping insertion in model container [2025-03-09 00:54:12,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:54:12" (1/1) ... [2025-03-09 00:54:12,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:54:13,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:54:13,060 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:54:13,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:54:13,120 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:54:13,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:13 WrapperNode [2025-03-09 00:54:13,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:54:13,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:54:13,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:54:13,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:54:13,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:13" (1/1) ... [2025-03-09 00:54:13,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:13" (1/1) ... [2025-03-09 00:54:13,157 INFO L138 Inliner]: procedures = 164, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 65 [2025-03-09 00:54:13,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:54:13,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:54:13,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:54:13,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:54:13,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:13" (1/1) ... [2025-03-09 00:54:13,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:13" (1/1) ... [2025-03-09 00:54:13,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:13" (1/1) ... [2025-03-09 00:54:13,177 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 00:54:13,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:13" (1/1) ... [2025-03-09 00:54:13,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:13" (1/1) ... [2025-03-09 00:54:13,180 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:13" (1/1) ... [2025-03-09 00:54:13,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:13" (1/1) ... [2025-03-09 00:54:13,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:13" (1/1) ... [2025-03-09 00:54:13,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:13" (1/1) ... [2025-03-09 00:54:13,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:54:13,187 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:54:13,187 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:54:13,187 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:54:13,187 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:13" (1/1) ... [2025-03-09 00:54:13,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:54:13,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:13,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:54:13,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:54:13,241 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 00:54:13,241 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 00:54:13,241 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 00:54:13,242 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 00:54:13,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:54:13,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:54:13,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:54:13,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:54:13,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:54:13,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:54:13,243 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:54:13,329 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:54:13,330 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:54:13,456 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:54:13,456 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:54:13,523 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:54:13,524 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:54:13,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:54:13 BoogieIcfgContainer [2025-03-09 00:54:13,524 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:54:13,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:54:13,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:54:13,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:54:13,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:54:12" (1/3) ... [2025-03-09 00:54:13,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efef103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:54:13, skipping insertion in model container [2025-03-09 00:54:13,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:54:13" (2/3) ... [2025-03-09 00:54:13,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efef103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:54:13, skipping insertion in model container [2025-03-09 00:54:13,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:54:13" (3/3) ... [2025-03-09 00:54:13,530 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-6.i [2025-03-09 00:54:13,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:54:13,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-6.i that has 3 procedures, 30 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-09 00:54:13,542 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:54:13,572 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 00:54:13,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 76 flow [2025-03-09 00:54:13,615 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-03-09 00:54:13,616 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:54:13,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 5/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-03-09 00:54:13,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 34 transitions, 76 flow [2025-03-09 00:54:13,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 32 transitions, 70 flow [2025-03-09 00:54:13,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:54:13,636 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;@18fadb86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:54:13,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 00:54:13,642 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:54:13,642 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2025-03-09 00:54:13,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:54:13,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:13,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:13,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:13,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1473564154, now seen corresponding path program 1 times [2025-03-09 00:54:13,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:13,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177636151] [2025-03-09 00:54:13,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:13,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:13,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:54:13,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:54:13,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:13,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:13,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:13,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:13,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177636151] [2025-03-09 00:54:13,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177636151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:54:13,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:54:13,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:54:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871311657] [2025-03-09 00:54:13,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:54:13,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:54:13,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:13,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:54:13,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:54:13,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:54:13,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:13,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:13,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:54:13,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:14,021 INFO L124 PetriNetUnfolderBase]: 297/523 cut-off events. [2025-03-09 00:54:14,021 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 00:54:14,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 523 events. 297/523 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2156 event pairs, 39 based on Foata normal form. 32/534 useless extension candidates. Maximal degree in co-relation 974. Up to 353 conditions per place. [2025-03-09 00:54:14,028 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 29 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2025-03-09 00:54:14,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 146 flow [2025-03-09 00:54:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:54:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:54:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-09 00:54:14,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2025-03-09 00:54:14,040 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 70 flow. Second operand 3 states and 59 transitions. [2025-03-09 00:54:14,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 146 flow [2025-03-09 00:54:14,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:54:14,059 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 72 flow [2025-03-09 00:54:14,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2025-03-09 00:54:14,064 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-03-09 00:54:14,064 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 72 flow [2025-03-09 00:54:14,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:14,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:14,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:14,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:54:14,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:14,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1404976497, now seen corresponding path program 1 times [2025-03-09 00:54:14,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:14,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613303700] [2025-03-09 00:54:14,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:14,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:14,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:54:14,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:54:14,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:14,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:14,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:14,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:14,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613303700] [2025-03-09 00:54:14,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613303700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:14,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611751700] [2025-03-09 00:54:14,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:14,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:14,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:14,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:14,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:54:14,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:54:14,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:54:14,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:14,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:14,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 00:54:14,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 00:54:14,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:54:14,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611751700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:54:14,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 00:54:14,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-03-09 00:54:14,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842667563] [2025-03-09 00:54:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:54:14,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:54:14,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:14,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:54:14,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:54:14,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-09 00:54:14,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:14,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:14,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-09 00:54:14,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:14,320 INFO L124 PetriNetUnfolderBase]: 265/459 cut-off events. [2025-03-09 00:54:14,321 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 00:54:14,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 459 events. 265/459 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1781 event pairs, 183 based on Foata normal form. 16/454 useless extension candidates. Maximal degree in co-relation 926. Up to 405 conditions per place. [2025-03-09 00:54:14,326 INFO L140 encePairwiseOnDemand]: 32/34 looper letters, 21 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2025-03-09 00:54:14,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 116 flow [2025-03-09 00:54:14,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:54:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:54:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-09 00:54:14,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43137254901960786 [2025-03-09 00:54:14,328 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 72 flow. Second operand 3 states and 44 transitions. [2025-03-09 00:54:14,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 116 flow [2025-03-09 00:54:14,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:54:14,329 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 68 flow [2025-03-09 00:54:14,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2025-03-09 00:54:14,329 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2025-03-09 00:54:14,329 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 68 flow [2025-03-09 00:54:14,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:14,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:14,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:14,338 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-09 00:54:14,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:14,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:14,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:14,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1404975617, now seen corresponding path program 1 times [2025-03-09 00:54:14,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:14,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849729631] [2025-03-09 00:54:14,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:14,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:14,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:54:14,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:54:14,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:14,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:14,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:14,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849729631] [2025-03-09 00:54:14,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849729631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:14,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343010785] [2025-03-09 00:54:14,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:14,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:14,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:14,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:14,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:54:14,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 00:54:14,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 00:54:14,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:14,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:14,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:54:14,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:14,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:14,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343010785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:14,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:14,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 00:54:14,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664682340] [2025-03-09 00:54:14,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:14,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:54:14,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:14,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:54:14,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:54:14,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:54:14,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:14,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:14,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:54:14,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:14,810 INFO L124 PetriNetUnfolderBase]: 329/555 cut-off events. [2025-03-09 00:54:14,810 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 00:54:14,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 555 events. 329/555 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2078 event pairs, 39 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1160. Up to 257 conditions per place. [2025-03-09 00:54:14,813 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 52 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-03-09 00:54:14,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 62 transitions, 258 flow [2025-03-09 00:54:14,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:54:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:54:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-03-09 00:54:14,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2025-03-09 00:54:14,815 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 68 flow. Second operand 6 states and 108 transitions. [2025-03-09 00:54:14,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 62 transitions, 258 flow [2025-03-09 00:54:14,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 62 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:54:14,816 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 103 flow [2025-03-09 00:54:14,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=103, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2025-03-09 00:54:14,816 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2025-03-09 00:54:14,816 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 103 flow [2025-03-09 00:54:14,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:14,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:14,818 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:14,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:54:15,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-09 00:54:15,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:15,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:15,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2051551574, now seen corresponding path program 2 times [2025-03-09 00:54:15,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:15,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124054108] [2025-03-09 00:54:15,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:54:15,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:15,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 00:54:15,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:54:15,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:54:15,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:15,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:15,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124054108] [2025-03-09 00:54:15,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124054108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:15,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114165820] [2025-03-09 00:54:15,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 00:54:15,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:15,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:15,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:15,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:54:15,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 00:54:15,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:54:15,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 00:54:15,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:15,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:54:15,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:15,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:15,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114165820] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:15,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:15,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 00:54:15,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968960916] [2025-03-09 00:54:15,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:15,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 00:54:15,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:15,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 00:54:15,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 00:54:15,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:54:15,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 103 flow. Second operand has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:15,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:15,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:54:15,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:15,431 INFO L124 PetriNetUnfolderBase]: 521/843 cut-off events. [2025-03-09 00:54:15,431 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-03-09 00:54:15,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2116 conditions, 843 events. 521/843 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3138 event pairs, 39 based on Foata normal form. 96/934 useless extension candidates. Maximal degree in co-relation 2104. Up to 257 conditions per place. [2025-03-09 00:54:15,435 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 100 selfloop transitions, 11 changer transitions 0/116 dead transitions. [2025-03-09 00:54:15,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 116 transitions, 521 flow [2025-03-09 00:54:15,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:54:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 00:54:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2025-03-09 00:54:15,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5220588235294118 [2025-03-09 00:54:15,437 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 103 flow. Second operand 12 states and 213 transitions. [2025-03-09 00:54:15,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 116 transitions, 521 flow [2025-03-09 00:54:15,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 116 transitions, 507 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-09 00:54:15,440 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 173 flow [2025-03-09 00:54:15,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=173, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2025-03-09 00:54:15,441 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2025-03-09 00:54:15,441 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 173 flow [2025-03-09 00:54:15,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:15,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:15,441 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:15,448 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-09 00:54:15,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:15,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:15,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:15,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1525932406, now seen corresponding path program 3 times [2025-03-09 00:54:15,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:15,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152255209] [2025-03-09 00:54:15,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:54:15,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:15,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-03-09 00:54:15,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 00:54:15,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 00:54:15,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:15,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:15,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152255209] [2025-03-09 00:54:15,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152255209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:15,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013683989] [2025-03-09 00:54:15,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 00:54:15,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:15,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:15,851 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:15,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:54:15,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-03-09 00:54:15,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 00:54:15,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 00:54:15,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:15,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 00:54:15,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:15,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:16,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013683989] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:16,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:16,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 17 [2025-03-09 00:54:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802239762] [2025-03-09 00:54:16,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:16,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 00:54:16,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:16,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 00:54:16,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-09 00:54:16,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-03-09 00:54:16,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 173 flow. Second operand has 17 states, 17 states have (on average 9.705882352941176) internal successors, (165), 17 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:16,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:16,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-03-09 00:54:16,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:16,281 INFO L124 PetriNetUnfolderBase]: 649/1035 cut-off events. [2025-03-09 00:54:16,281 INFO L125 PetriNetUnfolderBase]: For 2860/2860 co-relation queries the response was YES. [2025-03-09 00:54:16,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2971 conditions, 1035 events. 649/1035 cut-off events. For 2860/2860 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3809 event pairs, 39 based on Foata normal form. 64/1094 useless extension candidates. Maximal degree in co-relation 2952. Up to 257 conditions per place. [2025-03-09 00:54:16,288 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 132 selfloop transitions, 15 changer transitions 0/152 dead transitions. [2025-03-09 00:54:16,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 152 transitions, 723 flow [2025-03-09 00:54:16,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 00:54:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-09 00:54:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 279 transitions. [2025-03-09 00:54:16,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5128676470588235 [2025-03-09 00:54:16,290 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 173 flow. Second operand 16 states and 279 transitions. [2025-03-09 00:54:16,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 152 transitions, 723 flow [2025-03-09 00:54:16,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 152 transitions, 667 flow, removed 23 selfloop flow, removed 5 redundant places. [2025-03-09 00:54:16,301 INFO L231 Difference]: Finished difference. Result has 69 places, 40 transitions, 197 flow [2025-03-09 00:54:16,302 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=16, PETRI_FLOW=197, PETRI_PLACES=69, PETRI_TRANSITIONS=40} [2025-03-09 00:54:16,302 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2025-03-09 00:54:16,302 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 40 transitions, 197 flow [2025-03-09 00:54:16,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.705882352941176) internal successors, (165), 17 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:16,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:16,303 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:16,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 00:54:16,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:16,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:16,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:16,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1639740470, now seen corresponding path program 4 times [2025-03-09 00:54:16,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:16,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118588659] [2025-03-09 00:54:16,507 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 00:54:16,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:16,512 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-09 00:54:16,537 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 00:54:16,537 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 00:54:16,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:17,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:17,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118588659] [2025-03-09 00:54:17,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118588659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:17,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010862833] [2025-03-09 00:54:17,273 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 00:54:17,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:17,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:17,274 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:17,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:54:17,312 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-09 00:54:17,333 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 00:54:17,333 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 00:54:17,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:17,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-09 00:54:17,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:18,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:18,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010862833] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:18,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:18,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2025-03-09 00:54:18,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49201162] [2025-03-09 00:54:18,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:19,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-09 00:54:19,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:19,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-09 00:54:19,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=3288, Unknown=0, NotChecked=0, Total=3782 [2025-03-09 00:54:19,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-09 00:54:19,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 40 transitions, 197 flow. Second operand has 62 states, 62 states have (on average 8.258064516129032) internal successors, (512), 62 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:19,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:19,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-09 00:54:19,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:54:32,731 INFO L124 PetriNetUnfolderBase]: 15598/25719 cut-off events. [2025-03-09 00:54:32,731 INFO L125 PetriNetUnfolderBase]: For 54615/54615 co-relation queries the response was YES. [2025-03-09 00:54:32,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67891 conditions, 25719 events. 15598/25719 cut-off events. For 54615/54615 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 168214 event pairs, 104 based on Foata normal form. 0/25391 useless extension candidates. Maximal degree in co-relation 67868. Up to 3297 conditions per place. [2025-03-09 00:54:32,846 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 569 selfloop transitions, 574 changer transitions 701/1848 dead transitions. [2025-03-09 00:54:32,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 1848 transitions, 10950 flow [2025-03-09 00:54:32,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2025-03-09 00:54:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2025-03-09 00:54:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 2677 transitions. [2025-03-09 00:54:32,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45250169033130494 [2025-03-09 00:54:32,860 INFO L175 Difference]: Start difference. First operand has 69 places, 40 transitions, 197 flow. Second operand 174 states and 2677 transitions. [2025-03-09 00:54:32,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 1848 transitions, 10950 flow [2025-03-09 00:54:32,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 1848 transitions, 9424 flow, removed 442 selfloop flow, removed 11 redundant places. [2025-03-09 00:54:32,940 INFO L231 Difference]: Finished difference. Result has 301 places, 667 transitions, 4021 flow [2025-03-09 00:54:32,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=174, PETRI_FLOW=4021, PETRI_PLACES=301, PETRI_TRANSITIONS=667} [2025-03-09 00:54:32,942 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 267 predicate places. [2025-03-09 00:54:32,942 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 667 transitions, 4021 flow [2025-03-09 00:54:32,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 8.258064516129032) internal successors, (512), 62 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:32,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:54:32,943 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:54:32,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 00:54:33,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:33,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 00:54:33,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:54:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1266177186, now seen corresponding path program 1 times [2025-03-09 00:54:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:54:33,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51342679] [2025-03-09 00:54:33,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:33,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:54:33,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:54:33,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:54:33,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:33,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:33,884 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:33,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:54:33,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51342679] [2025-03-09 00:54:33,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51342679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:54:33,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033821712] [2025-03-09 00:54:33,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:54:33,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:54:33,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:54:33,886 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:54:33,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:54:33,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:54:33,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:54:33,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:54:33,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:54:33,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-09 00:54:33,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:54:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 78 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:34,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:54:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:54:35,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033821712] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:54:35,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:54:35,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 66 [2025-03-09 00:54:35,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372123960] [2025-03-09 00:54:35,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:54:35,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-09 00:54:35,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:54:35,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-09 00:54:35,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=3874, Unknown=0, NotChecked=0, Total=4422 [2025-03-09 00:54:35,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-03-09 00:54:35,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 667 transitions, 4021 flow. Second operand has 67 states, 67 states have (on average 8.328358208955224) internal successors, (558), 67 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:54:35,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:54:35,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-03-09 00:54:35,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand