./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c --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/weaver/chl-name-comparator-symm.wvr.c -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 e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:20:12,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:20:12,630 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:20:12,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:20:12,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:20:12,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:20:12,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:20:12,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:20:12,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:20:12,651 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:20:12,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:20:12,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:20:12,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:20:12,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:20:12,652 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:20:12,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:20:12,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:20:12,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:20:12,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:20:12,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:20:12,653 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:20:12,653 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:20:12,653 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:20:12,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:20:12,653 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:20:12,653 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:20:12,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:20:12,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:20:12,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:20:12,653 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:20:12,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:20:12,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:20:12,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:20:12,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:20:12,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:20:12,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:20:12,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:20:12,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:20:12,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:20:12,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:20:12,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:20:12,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:20:12,654 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 -> e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc [2025-03-09 01:20:12,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:20:12,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:20:12,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:20:12,919 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:20:12,919 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:20:12,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2025-03-09 01:20:14,032 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57742b5f/9d2496a7972b40768120e6715034f163/FLAG3db62672b [2025-03-09 01:20:14,290 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:20:14,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2025-03-09 01:20:14,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57742b5f/9d2496a7972b40768120e6715034f163/FLAG3db62672b [2025-03-09 01:20:14,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57742b5f/9d2496a7972b40768120e6715034f163 [2025-03-09 01:20:14,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:20:14,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:20:14,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:20:14,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:20:14,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:20:14,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:20:14" (1/1) ... [2025-03-09 01:20:14,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70575208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14, skipping insertion in model container [2025-03-09 01:20:14,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:20:14" (1/1) ... [2025-03-09 01:20:14,338 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:20:14,480 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:20:14,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:20:14,488 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:20:14,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:20:14,533 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:20:14,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14 WrapperNode [2025-03-09 01:20:14,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:20:14,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:20:14,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:20:14,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:20:14,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14" (1/1) ... [2025-03-09 01:20:14,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14" (1/1) ... [2025-03-09 01:20:14,564 INFO L138 Inliner]: procedures = 24, calls = 25, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 216 [2025-03-09 01:20:14,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:20:14,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:20:14,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:20:14,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:20:14,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14" (1/1) ... [2025-03-09 01:20:14,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14" (1/1) ... [2025-03-09 01:20:14,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14" (1/1) ... [2025-03-09 01:20:14,585 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-09 01:20:14,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14" (1/1) ... [2025-03-09 01:20:14,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14" (1/1) ... [2025-03-09 01:20:14,590 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14" (1/1) ... [2025-03-09 01:20:14,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14" (1/1) ... [2025-03-09 01:20:14,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14" (1/1) ... [2025-03-09 01:20:14,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14" (1/1) ... [2025-03-09 01:20:14,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:20:14,594 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:20:14,594 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:20:14,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:20:14,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14" (1/1) ... [2025-03-09 01:20:14,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:20:14,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:14,617 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 01:20:14,618 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 01:20:14,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:20:14,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:20:14,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:20:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:20:14,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:20:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:20:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:20:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:20:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:20:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:20:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:20:14,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:20:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:20:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:20:14,637 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:20:14,722 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:20:14,723 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:20:15,015 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:20:15,015 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:20:15,250 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:20:15,250 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:20:15,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:20:15 BoogieIcfgContainer [2025-03-09 01:20:15,251 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:20:15,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:20:15,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:20:15,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:20:15,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:20:14" (1/3) ... [2025-03-09 01:20:15,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235066e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:20:15, skipping insertion in model container [2025-03-09 01:20:15,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:14" (2/3) ... [2025-03-09 01:20:15,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235066e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:20:15, skipping insertion in model container [2025-03-09 01:20:15,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:20:15" (3/3) ... [2025-03-09 01:20:15,257 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2025-03-09 01:20:15,271 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:20:15,272 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-symm.wvr.c that has 3 procedures, 33 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-09 01:20:15,272 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:20:15,321 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:20:15,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 88 flow [2025-03-09 01:20:15,369 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2025-03-09 01:20:15,371 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:20:15,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 5/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-09 01:20:15,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 88 flow [2025-03-09 01:20:15,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 34 transitions, 80 flow [2025-03-09 01:20:15,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:20:15,397 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;@24020fa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:20:15,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-09 01:20:15,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:20:15,404 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-09 01:20:15,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:20:15,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:15,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:20:15,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:15,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash 591908, now seen corresponding path program 1 times [2025-03-09 01:20:15,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:15,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613563875] [2025-03-09 01:20:15,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:15,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:15,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:20:15,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:20:15,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:15,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:15,618 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 01:20:15,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:15,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613563875] [2025-03-09 01:20:15,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613563875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:15,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:15,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:20:15,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668835778] [2025-03-09 01:20:15,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:15,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:20:15,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:15,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:20:15,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:20:15,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-03-09 01:20:15,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 01:20:15,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:15,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-03-09 01:20:15,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:15,769 INFO L124 PetriNetUnfolderBase]: 128/261 cut-off events. [2025-03-09 01:20:15,769 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-09 01:20:15,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 261 events. 128/261 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 988 event pairs, 100 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 456. Up to 221 conditions per place. [2025-03-09 01:20:15,772 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 21 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2025-03-09 01:20:15,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 116 flow [2025-03-09 01:20:15,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-03-09 01:20:15,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2025-03-09 01:20:15,786 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 80 flow. Second operand 3 states and 54 transitions. [2025-03-09 01:20:15,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 116 flow [2025-03-09 01:20:15,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:15,792 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2025-03-09 01:20:15,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-03-09 01:20:15,798 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-03-09 01:20:15,799 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2025-03-09 01:20:15,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 01:20:15,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:15,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:20:15,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:20:15,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:15,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:15,801 INFO L85 PathProgramCache]: Analyzing trace with hash 591909, now seen corresponding path program 1 times [2025-03-09 01:20:15,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:15,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298468027] [2025-03-09 01:20:15,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:15,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:20:15,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:20:15,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:15,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:15,991 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 01:20:15,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:15,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298468027] [2025-03-09 01:20:15,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298468027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:15,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:15,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:20:15,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900988185] [2025-03-09 01:20:15,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:15,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:15,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:15,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:15,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:16,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-03-09 01:20:16,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 01:20:16,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:16,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-03-09 01:20:16,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:16,113 INFO L124 PetriNetUnfolderBase]: 129/264 cut-off events. [2025-03-09 01:20:16,113 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:20:16,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 264 events. 129/264 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1000 event pairs, 100 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 482. Up to 226 conditions per place. [2025-03-09 01:20:16,115 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 24 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-03-09 01:20:16,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 128 flow [2025-03-09 01:20:16,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-09 01:20:16,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2025-03-09 01:20:16,116 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 3 states and 55 transitions. [2025-03-09 01:20:16,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 128 flow [2025-03-09 01:20:16,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:16,118 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 81 flow [2025-03-09 01:20:16,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2025-03-09 01:20:16,118 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2025-03-09 01:20:16,118 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 81 flow [2025-03-09 01:20:16,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 01:20:16,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:16,119 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:20:16,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:20:16,119 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:16,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:16,119 INFO L85 PathProgramCache]: Analyzing trace with hash 568843702, now seen corresponding path program 1 times [2025-03-09 01:20:16,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:16,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47470108] [2025-03-09 01:20:16,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:16,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:16,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:20:16,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:20:16,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:16,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:16,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:16,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47470108] [2025-03-09 01:20:16,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47470108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:16,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992896942] [2025-03-09 01:20:16,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:16,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:16,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:16,358 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 01:20:16,359 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 01:20:16,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:20:16,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:20:16,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:16,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:16,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:20:16,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:16,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:16,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:16,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992896942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:16,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:16,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-03-09 01:20:16,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570198117] [2025-03-09 01:20:16,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:16,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:20:16,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:16,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:20:16,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:20:16,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-03-09 01:20:16,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 81 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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 01:20:16,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:16,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-03-09 01:20:16,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:16,725 INFO L124 PetriNetUnfolderBase]: 131/270 cut-off events. [2025-03-09 01:20:16,725 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:20:16,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 270 events. 131/270 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1031 event pairs, 100 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 482. Up to 228 conditions per place. [2025-03-09 01:20:16,728 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 26 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2025-03-09 01:20:16,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 169 flow [2025-03-09 01:20:16,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-03-09 01:20:16,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2025-03-09 01:20:16,730 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 81 flow. Second operand 5 states and 80 transitions. [2025-03-09 01:20:16,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 169 flow [2025-03-09 01:20:16,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:20:16,731 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 122 flow [2025-03-09 01:20:16,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-03-09 01:20:16,731 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-03-09 01:20:16,731 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 122 flow [2025-03-09 01:20:16,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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 01:20:16,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:16,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:16,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:20:16,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:16,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:16,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:16,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1215010267, now seen corresponding path program 1 times [2025-03-09 01:20:16,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:16,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744146686] [2025-03-09 01:20:16,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:16,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:16,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:20:16,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:20:16,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:16,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:17,013 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 01:20:17,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:17,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744146686] [2025-03-09 01:20:17,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744146686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:17,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:17,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:20:17,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392819814] [2025-03-09 01:20:17,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:17,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:17,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:17,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:17,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:17,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-09 01:20:17,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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 01:20:17,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:17,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-09 01:20:17,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:17,098 INFO L124 PetriNetUnfolderBase]: 131/252 cut-off events. [2025-03-09 01:20:17,099 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-09 01:20:17,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 252 events. 131/252 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 850 event pairs, 100 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 485. Up to 223 conditions per place. [2025-03-09 01:20:17,100 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 24 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2025-03-09 01:20:17,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 176 flow [2025-03-09 01:20:17,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-03-09 01:20:17,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3581081081081081 [2025-03-09 01:20:17,101 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 122 flow. Second operand 4 states and 53 transitions. [2025-03-09 01:20:17,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 176 flow [2025-03-09 01:20:17,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 165 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-09 01:20:17,102 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 117 flow [2025-03-09 01:20:17,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-03-09 01:20:17,103 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-03-09 01:20:17,103 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 117 flow [2025-03-09 01:20:17,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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 01:20:17,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:17,103 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:17,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:20:17,104 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:17,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:17,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1215010268, now seen corresponding path program 1 times [2025-03-09 01:20:17,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:17,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869089272] [2025-03-09 01:20:17,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:17,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:17,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:20:17,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:20:17,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:17,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:17,144 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 01:20:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:17,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869089272] [2025-03-09 01:20:17,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869089272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:17,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:17,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:20:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136989779] [2025-03-09 01:20:17,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:17,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:20:17,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:17,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:20:17,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:20:17,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:17,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 117 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 01:20:17,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:17,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:17,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:17,203 INFO L124 PetriNetUnfolderBase]: 130/251 cut-off events. [2025-03-09 01:20:17,204 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-09 01:20:17,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 251 events. 130/251 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 834 event pairs, 100 based on Foata normal form. 1/225 useless extension candidates. Maximal degree in co-relation 488. Up to 230 conditions per place. [2025-03-09 01:20:17,205 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-09 01:20:17,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 170 flow [2025-03-09 01:20:17,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-09 01:20:17,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2025-03-09 01:20:17,206 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 117 flow. Second operand 3 states and 56 transitions. [2025-03-09 01:20:17,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 170 flow [2025-03-09 01:20:17,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:17,207 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 109 flow [2025-03-09 01:20:17,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-03-09 01:20:17,207 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-03-09 01:20:17,208 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 109 flow [2025-03-09 01:20:17,208 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 01:20:17,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:17,208 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1] [2025-03-09 01:20:17,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:20:17,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:17,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:17,208 INFO L85 PathProgramCache]: Analyzing trace with hash 198129688, now seen corresponding path program 2 times [2025-03-09 01:20:17,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:17,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004697008] [2025-03-09 01:20:17,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:17,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:17,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-09 01:20:17,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:20:17,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:17,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:17,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:17,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004697008] [2025-03-09 01:20:17,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004697008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:17,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875714733] [2025-03-09 01:20:17,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:17,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:17,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:17,289 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 01:20:17,291 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 01:20:17,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-09 01:20:17,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:20:17,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:17,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:17,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:20:17,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:17,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:17,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875714733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:17,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:17,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-09 01:20:17,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736128507] [2025-03-09 01:20:17,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:17,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:20:17,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:17,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:20:17,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:20:17,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:17,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:17,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:17,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:17,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:17,505 INFO L124 PetriNetUnfolderBase]: 129/248 cut-off events. [2025-03-09 01:20:17,506 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 01:20:17,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 248 events. 129/248 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 816 event pairs, 100 based on Foata normal form. 1/222 useless extension candidates. Maximal degree in co-relation 491. Up to 223 conditions per place. [2025-03-09 01:20:17,508 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 22 selfloop transitions, 7 changer transitions 0/32 dead transitions. [2025-03-09 01:20:17,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 157 flow [2025-03-09 01:20:17,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:20:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:20:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2025-03-09 01:20:17,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40540540540540543 [2025-03-09 01:20:17,510 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 109 flow. Second operand 6 states and 90 transitions. [2025-03-09 01:20:17,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 157 flow [2025-03-09 01:20:17,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 143 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:17,512 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 99 flow [2025-03-09 01:20:17,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=99, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2025-03-09 01:20:17,512 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-03-09 01:20:17,512 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 99 flow [2025-03-09 01:20:17,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:17,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:17,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:17,519 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 01:20:17,717 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,SelfDestructingSolverStorable5 [2025-03-09 01:20:17,717 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:17,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash 215169773, now seen corresponding path program 1 times [2025-03-09 01:20:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:17,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851180324] [2025-03-09 01:20:17,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:17,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:20:17,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:20:17,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:17,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:17,764 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 01:20:17,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:17,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851180324] [2025-03-09 01:20:17,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851180324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:17,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848070659] [2025-03-09 01:20:17,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:17,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:17,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:17,767 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 01:20:17,768 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 01:20:17,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:20:17,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:20:17,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:17,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:17,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:20:17,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:17,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:17,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-09 01:20:17,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848070659] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:17,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:17,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 01:20:17,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969118314] [2025-03-09 01:20:17,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:17,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:20:17,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:17,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:20:17,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:20:17,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:17,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 99 flow. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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 01:20:17,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:17,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:17,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:17,924 INFO L124 PetriNetUnfolderBase]: 127/246 cut-off events. [2025-03-09 01:20:17,924 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:20:17,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 246 events. 127/246 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 804 event pairs, 100 based on Foata normal form. 2/221 useless extension candidates. Maximal degree in co-relation 464. Up to 222 conditions per place. [2025-03-09 01:20:17,926 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 23 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-03-09 01:20:17,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 147 flow [2025-03-09 01:20:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:17,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-03-09 01:20:17,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42702702702702705 [2025-03-09 01:20:17,927 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 99 flow. Second operand 5 states and 79 transitions. [2025-03-09 01:20:17,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 147 flow [2025-03-09 01:20:17,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 135 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:17,928 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 81 flow [2025-03-09 01:20:17,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=81, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-03-09 01:20:17,928 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2025-03-09 01:20:17,928 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 81 flow [2025-03-09 01:20:17,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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 01:20:17,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:17,928 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:17,935 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 01:20:18,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:18,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:18,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:18,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1528654769, now seen corresponding path program 2 times [2025-03-09 01:20:18,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:18,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565350630] [2025-03-09 01:20:18,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:18,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:18,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:20:18,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 13 statements. [2025-03-09 01:20:18,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:20:18,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:18,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:18,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565350630] [2025-03-09 01:20:18,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565350630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:18,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:18,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:18,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109575431] [2025-03-09 01:20:18,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:18,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:18,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:18,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:20:18,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-03-09 01:20:18,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 01:20:18,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:18,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-03-09 01:20:18,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:18,383 INFO L124 PetriNetUnfolderBase]: 253/451 cut-off events. [2025-03-09 01:20:18,383 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:20:18,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 451 events. 253/451 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1700 event pairs, 118 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 897. Up to 254 conditions per place. [2025-03-09 01:20:18,385 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 39 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-03-09 01:20:18,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 204 flow [2025-03-09 01:20:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-03-09 01:20:18,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4702702702702703 [2025-03-09 01:20:18,387 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 81 flow. Second operand 5 states and 87 transitions. [2025-03-09 01:20:18,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 204 flow [2025-03-09 01:20:18,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:18,388 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 89 flow [2025-03-09 01:20:18,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-03-09 01:20:18,389 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-03-09 01:20:18,389 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 89 flow [2025-03-09 01:20:18,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 01:20:18,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:18,389 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:18,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:20:18,389 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:18,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:18,391 INFO L85 PathProgramCache]: Analyzing trace with hash -572013103, now seen corresponding path program 1 times [2025-03-09 01:20:18,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:18,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433243328] [2025-03-09 01:20:18,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:18,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:18,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:20:18,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:20:18,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:18,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:20:18,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:18,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433243328] [2025-03-09 01:20:18,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433243328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:18,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643118301] [2025-03-09 01:20:18,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:18,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:18,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:18,561 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 01:20:18,562 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 01:20:18,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:20:18,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:20:18,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:18,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:18,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:20:18,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:18,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:18,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-09 01:20:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:18,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643118301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:18,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:18,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 15 [2025-03-09 01:20:18,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312517685] [2025-03-09 01:20:18,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:18,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:20:18,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:18,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:20:18,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:20:18,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-03-09 01:20:18,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 89 flow. Second operand has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 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 01:20:18,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:18,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-03-09 01:20:18,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:19,263 INFO L124 PetriNetUnfolderBase]: 618/1080 cut-off events. [2025-03-09 01:20:19,263 INFO L125 PetriNetUnfolderBase]: For 196/224 co-relation queries the response was YES. [2025-03-09 01:20:19,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 1080 events. 618/1080 cut-off events. For 196/224 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4675 event pairs, 228 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 2294. Up to 463 conditions per place. [2025-03-09 01:20:19,268 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 54 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-09 01:20:19,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 303 flow [2025-03-09 01:20:19,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:20:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:20:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2025-03-09 01:20:19,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44594594594594594 [2025-03-09 01:20:19,269 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 89 flow. Second operand 8 states and 132 transitions. [2025-03-09 01:20:19,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 303 flow [2025-03-09 01:20:19,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 63 transitions, 293 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:19,272 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 111 flow [2025-03-09 01:20:19,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=111, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2025-03-09 01:20:19,273 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2025-03-09 01:20:19,273 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 111 flow [2025-03-09 01:20:19,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 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 01:20:19,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:19,274 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:19,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:20:19,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:19,478 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:19,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:19,478 INFO L85 PathProgramCache]: Analyzing trace with hash -615373990, now seen corresponding path program 1 times [2025-03-09 01:20:19,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:19,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682401059] [2025-03-09 01:20:19,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:19,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:19,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:20:19,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:20:19,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:19,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:19,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:19,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682401059] [2025-03-09 01:20:19,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682401059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:19,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171471237] [2025-03-09 01:20:19,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:19,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:19,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:19,659 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 01:20:19,660 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 01:20:19,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:20:19,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:20:19,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:19,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:19,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:20:19,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:19,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:20:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:19,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:20,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171471237] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:20,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:20,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 19 [2025-03-09 01:20:20,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176889959] [2025-03-09 01:20:20,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:20,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 01:20:20,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:20,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 01:20:20,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:20:20,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-09 01:20:20,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 111 flow. Second operand has 21 states, 21 states have (on average 10.142857142857142) internal successors, (213), 21 states have internal predecessors, (213), 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 01:20:20,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:20,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-09 01:20:20,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:20,645 INFO L124 PetriNetUnfolderBase]: 1165/2025 cut-off events. [2025-03-09 01:20:20,646 INFO L125 PetriNetUnfolderBase]: For 403/403 co-relation queries the response was YES. [2025-03-09 01:20:20,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4577 conditions, 2025 events. 1165/2025 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9979 event pairs, 318 based on Foata normal form. 0/1711 useless extension candidates. Maximal degree in co-relation 4541. Up to 628 conditions per place. [2025-03-09 01:20:20,655 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 79 selfloop transitions, 8 changer transitions 0/89 dead transitions. [2025-03-09 01:20:20,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 89 transitions, 454 flow [2025-03-09 01:20:20,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:20:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:20:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2025-03-09 01:20:20,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2025-03-09 01:20:20,656 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 111 flow. Second operand 9 states and 153 transitions. [2025-03-09 01:20:20,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 89 transitions, 454 flow [2025-03-09 01:20:20,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 447 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:20,658 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 138 flow [2025-03-09 01:20:20,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=138, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-03-09 01:20:20,659 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2025-03-09 01:20:20,659 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 138 flow [2025-03-09 01:20:20,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.142857142857142) internal successors, (213), 21 states have internal predecessors, (213), 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 01:20:20,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:20,659 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:20,665 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 01:20:20,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-09 01:20:20,864 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:20,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:20,864 INFO L85 PathProgramCache]: Analyzing trace with hash 988702673, now seen corresponding path program 1 times [2025-03-09 01:20:20,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:20,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626913612] [2025-03-09 01:20:20,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:20,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:20,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:20:20,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:20:20,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:20,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:21,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:21,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626913612] [2025-03-09 01:20:21,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626913612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:21,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022028078] [2025-03-09 01:20:21,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:21,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:21,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:21,103 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 01:20:21,105 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 01:20:21,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:20:21,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:20:21,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:21,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:21,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:20:21,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:21,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:21,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-09 01:20:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:21,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022028078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:21,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:21,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2025-03-09 01:20:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523707976] [2025-03-09 01:20:21,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:21,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:20:21,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:21,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:20:21,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:20:21,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-03-09 01:20:21,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 138 flow. Second operand has 24 states, 24 states have (on average 11.5) internal successors, (276), 24 states have internal predecessors, (276), 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 01:20:21,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:21,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-03-09 01:20:21,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:22,388 INFO L124 PetriNetUnfolderBase]: 1517/2633 cut-off events. [2025-03-09 01:20:22,389 INFO L125 PetriNetUnfolderBase]: For 1312/1348 co-relation queries the response was YES. [2025-03-09 01:20:22,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6273 conditions, 2633 events. 1517/2633 cut-off events. For 1312/1348 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 13214 event pairs, 450 based on Foata normal form. 46/2311 useless extension candidates. Maximal degree in co-relation 6234. Up to 885 conditions per place. [2025-03-09 01:20:22,398 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 77 selfloop transitions, 8 changer transitions 0/87 dead transitions. [2025-03-09 01:20:22,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 500 flow [2025-03-09 01:20:22,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:20:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:20:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2025-03-09 01:20:22,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46546546546546547 [2025-03-09 01:20:22,401 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 138 flow. Second operand 9 states and 155 transitions. [2025-03-09 01:20:22,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 500 flow [2025-03-09 01:20:22,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 87 transitions, 469 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:22,404 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 151 flow [2025-03-09 01:20:22,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=151, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-03-09 01:20:22,405 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2025-03-09 01:20:22,405 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 151 flow [2025-03-09 01:20:22,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.5) internal successors, (276), 24 states have internal predecessors, (276), 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 01:20:22,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:22,406 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-09 01:20:22,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:20:22,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:22,607 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:22,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash -474607814, now seen corresponding path program 2 times [2025-03-09 01:20:22,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:22,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846510154] [2025-03-09 01:20:22,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:22,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:22,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:20:22,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:20:22,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:22,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:22,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:22,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846510154] [2025-03-09 01:20:22,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846510154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:22,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876357259] [2025-03-09 01:20:22,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:22,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:22,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:22,837 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:22,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:20:22,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:20:22,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:20:22,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:22,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:22,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:20:22,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:22,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:22,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876357259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:22,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:22,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2025-03-09 01:20:22,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633617503] [2025-03-09 01:20:22,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:22,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:20:22,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:22,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:20:22,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:20:22,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:22,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:22,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:22,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:22,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:23,215 INFO L124 PetriNetUnfolderBase]: 1341/2363 cut-off events. [2025-03-09 01:20:23,215 INFO L125 PetriNetUnfolderBase]: For 1339/1379 co-relation queries the response was YES. [2025-03-09 01:20:23,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5640 conditions, 2363 events. 1341/2363 cut-off events. For 1339/1379 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12102 event pairs, 20 based on Foata normal form. 0/2055 useless extension candidates. Maximal degree in co-relation 5599. Up to 595 conditions per place. [2025-03-09 01:20:23,223 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 94 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2025-03-09 01:20:23,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 100 transitions, 583 flow [2025-03-09 01:20:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:20:23,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:20:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-03-09 01:20:23,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6396396396396397 [2025-03-09 01:20:23,224 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 151 flow. Second operand 6 states and 142 transitions. [2025-03-09 01:20:23,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 100 transitions, 583 flow [2025-03-09 01:20:23,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 100 transitions, 526 flow, removed 5 selfloop flow, removed 11 redundant places. [2025-03-09 01:20:23,227 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 123 flow [2025-03-09 01:20:23,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2025-03-09 01:20:23,227 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2025-03-09 01:20:23,227 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 123 flow [2025-03-09 01:20:23,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:23,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:23,228 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:23,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:23,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:23,428 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:23,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:23,429 INFO L85 PathProgramCache]: Analyzing trace with hash 914719892, now seen corresponding path program 1 times [2025-03-09 01:20:23,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:23,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880962689] [2025-03-09 01:20:23,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:23,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:23,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:20:23,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:20:23,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:23,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:23,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:23,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880962689] [2025-03-09 01:20:23,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880962689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:23,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:23,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:20:23,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670700937] [2025-03-09 01:20:23,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:23,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:20:23,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:23,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:20:23,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:20:23,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:23,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:23,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:23,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:23,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:23,973 INFO L124 PetriNetUnfolderBase]: 1343/2417 cut-off events. [2025-03-09 01:20:23,973 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2025-03-09 01:20:23,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5781 conditions, 2417 events. 1343/2417 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 12580 event pairs, 987 based on Foata normal form. 3/2244 useless extension candidates. Maximal degree in co-relation 5747. Up to 1808 conditions per place. [2025-03-09 01:20:23,985 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 52 selfloop transitions, 3 changer transitions 7/64 dead transitions. [2025-03-09 01:20:23,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 350 flow [2025-03-09 01:20:23,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-03-09 01:20:23,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5621621621621622 [2025-03-09 01:20:23,986 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 123 flow. Second operand 5 states and 104 transitions. [2025-03-09 01:20:23,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 350 flow [2025-03-09 01:20:23,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 329 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:23,989 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 136 flow [2025-03-09 01:20:23,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2025-03-09 01:20:23,990 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2025-03-09 01:20:23,990 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 136 flow [2025-03-09 01:20:23,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:23,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:23,990 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:23,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:20:23,990 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:23,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:23,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2027284642, now seen corresponding path program 2 times [2025-03-09 01:20:23,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:23,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980202851] [2025-03-09 01:20:23,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:23,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:23,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:20:24,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 24 statements. [2025-03-09 01:20:24,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:20:24,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:24,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:24,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980202851] [2025-03-09 01:20:24,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980202851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:24,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:24,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:20:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983881424] [2025-03-09 01:20:24,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:24,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:20:24,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:24,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:20:24,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:20:24,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:24,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:24,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:24,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:24,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:24,423 INFO L124 PetriNetUnfolderBase]: 1344/2410 cut-off events. [2025-03-09 01:20:24,423 INFO L125 PetriNetUnfolderBase]: For 1609/1618 co-relation queries the response was YES. [2025-03-09 01:20:24,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6162 conditions, 2410 events. 1344/2410 cut-off events. For 1609/1618 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 12874 event pairs, 966 based on Foata normal form. 1/2235 useless extension candidates. Maximal degree in co-relation 6125. Up to 1751 conditions per place. [2025-03-09 01:20:24,433 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 58 selfloop transitions, 3 changer transitions 9/72 dead transitions. [2025-03-09 01:20:24,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 430 flow [2025-03-09 01:20:24,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-09 01:20:24,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5783783783783784 [2025-03-09 01:20:24,434 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 136 flow. Second operand 5 states and 107 transitions. [2025-03-09 01:20:24,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 430 flow [2025-03-09 01:20:24,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 410 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:24,437 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 148 flow [2025-03-09 01:20:24,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-03-09 01:20:24,437 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2025-03-09 01:20:24,437 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 148 flow [2025-03-09 01:20:24,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:24,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:24,438 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:24,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:20:24,438 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:24,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:24,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1970936384, now seen corresponding path program 3 times [2025-03-09 01:20:24,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:24,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103990108] [2025-03-09 01:20:24,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:24,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:24,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-03-09 01:20:24,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 24 statements. [2025-03-09 01:20:24,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:20:24,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:24,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:24,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103990108] [2025-03-09 01:20:24,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103990108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:24,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:24,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:20:24,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167561341] [2025-03-09 01:20:24,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:24,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:20:24,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:24,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:20:24,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:20:24,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:24,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:24,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:24,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:24,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:24,883 INFO L124 PetriNetUnfolderBase]: 1441/2581 cut-off events. [2025-03-09 01:20:24,884 INFO L125 PetriNetUnfolderBase]: For 1858/1858 co-relation queries the response was YES. [2025-03-09 01:20:24,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7052 conditions, 2581 events. 1441/2581 cut-off events. For 1858/1858 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 13572 event pairs, 993 based on Foata normal form. 3/2584 useless extension candidates. Maximal degree in co-relation 7013. Up to 1839 conditions per place. [2025-03-09 01:20:24,898 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 56 selfloop transitions, 10 changer transitions 5/73 dead transitions. [2025-03-09 01:20:24,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 445 flow [2025-03-09 01:20:24,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-09 01:20:24,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-03-09 01:20:24,901 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 148 flow. Second operand 5 states and 110 transitions. [2025-03-09 01:20:24,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 445 flow [2025-03-09 01:20:24,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 421 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:24,907 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 235 flow [2025-03-09 01:20:24,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2025-03-09 01:20:24,907 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2025-03-09 01:20:24,907 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 235 flow [2025-03-09 01:20:24,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:24,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:24,908 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:24,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:20:24,908 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:24,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:24,908 INFO L85 PathProgramCache]: Analyzing trace with hash -151228002, now seen corresponding path program 4 times [2025-03-09 01:20:24,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:24,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827824559] [2025-03-09 01:20:24,909 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:20:24,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:24,916 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:20:24,921 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:20:24,921 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:20:24,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:25,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:25,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827824559] [2025-03-09 01:20:25,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827824559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:25,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:25,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:20:25,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665284368] [2025-03-09 01:20:25,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:25,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:20:25,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:25,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:20:25,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:20:25,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:25,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:25,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:25,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:25,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:25,408 INFO L124 PetriNetUnfolderBase]: 1455/2603 cut-off events. [2025-03-09 01:20:25,409 INFO L125 PetriNetUnfolderBase]: For 3222/3222 co-relation queries the response was YES. [2025-03-09 01:20:25,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7760 conditions, 2603 events. 1455/2603 cut-off events. For 3222/3222 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 13864 event pairs, 976 based on Foata normal form. 3/2606 useless extension candidates. Maximal degree in co-relation 7719. Up to 1835 conditions per place. [2025-03-09 01:20:25,425 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 62 selfloop transitions, 11 changer transitions 5/80 dead transitions. [2025-03-09 01:20:25,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 80 transitions, 562 flow [2025-03-09 01:20:25,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-09 01:20:25,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-09 01:20:25,426 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 235 flow. Second operand 5 states and 111 transitions. [2025-03-09 01:20:25,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 80 transitions, 562 flow [2025-03-09 01:20:25,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 80 transitions, 556 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:20:25,432 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 332 flow [2025-03-09 01:20:25,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2025-03-09 01:20:25,433 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2025-03-09 01:20:25,433 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 332 flow [2025-03-09 01:20:25,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:25,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:25,433 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:25,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:20:25,433 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:25,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:25,434 INFO L85 PathProgramCache]: Analyzing trace with hash -443765887, now seen corresponding path program 2 times [2025-03-09 01:20:25,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:25,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122622478] [2025-03-09 01:20:25,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:25,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:25,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:20:25,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:20:25,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:25,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:25,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:25,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122622478] [2025-03-09 01:20:25,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122622478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:25,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237932401] [2025-03-09 01:20:25,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:25,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:25,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:25,642 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:25,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:20:25,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:20:25,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:20:25,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:25,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:25,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:20:25,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:25,741 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:25,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237932401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:25,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:25,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2025-03-09 01:20:25,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396781898] [2025-03-09 01:20:25,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:25,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:20:25,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:25,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:20:25,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:20:25,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:25,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:25,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:25,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:25,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:26,017 INFO L124 PetriNetUnfolderBase]: 1349/2410 cut-off events. [2025-03-09 01:20:26,017 INFO L125 PetriNetUnfolderBase]: For 4240/4240 co-relation queries the response was YES. [2025-03-09 01:20:26,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7494 conditions, 2410 events. 1349/2410 cut-off events. For 4240/4240 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12279 event pairs, 107 based on Foata normal form. 44/2454 useless extension candidates. Maximal degree in co-relation 7450. Up to 696 conditions per place. [2025-03-09 01:20:26,027 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 96 selfloop transitions, 7 changer transitions 1/105 dead transitions. [2025-03-09 01:20:26,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 105 transitions, 821 flow [2025-03-09 01:20:26,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:20:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:20:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-03-09 01:20:26,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2025-03-09 01:20:26,029 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 332 flow. Second operand 6 states and 135 transitions. [2025-03-09 01:20:26,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 105 transitions, 821 flow [2025-03-09 01:20:26,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 105 transitions, 787 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:26,036 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 308 flow [2025-03-09 01:20:26,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2025-03-09 01:20:26,037 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2025-03-09 01:20:26,037 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 308 flow [2025-03-09 01:20:26,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:26,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:26,037 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:26,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:20:26,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:20:26,237 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:26,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:26,238 INFO L85 PathProgramCache]: Analyzing trace with hash 292779309, now seen corresponding path program 1 times [2025-03-09 01:20:26,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:26,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420212761] [2025-03-09 01:20:26,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:26,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:26,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:20:26,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:20:26,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:26,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:26,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:26,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420212761] [2025-03-09 01:20:26,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420212761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:26,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889284891] [2025-03-09 01:20:26,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:26,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:26,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:26,317 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:26,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:20:26,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:20:26,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:20:26,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:26,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:26,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:20:26,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:26,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:26,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889284891] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:26,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:20:26,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-03-09 01:20:26,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831679177] [2025-03-09 01:20:26,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:26,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:26,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:26,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:26,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:20:26,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:26,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:26,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:26,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:26,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:26,747 INFO L124 PetriNetUnfolderBase]: 1487/2647 cut-off events. [2025-03-09 01:20:26,748 INFO L125 PetriNetUnfolderBase]: For 3942/3942 co-relation queries the response was YES. [2025-03-09 01:20:26,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8179 conditions, 2647 events. 1487/2647 cut-off events. For 3942/3942 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 14176 event pairs, 91 based on Foata normal form. 33/2680 useless extension candidates. Maximal degree in co-relation 8138. Up to 1450 conditions per place. [2025-03-09 01:20:26,758 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 72 selfloop transitions, 25 changer transitions 4/102 dead transitions. [2025-03-09 01:20:26,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 102 transitions, 817 flow [2025-03-09 01:20:26,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:20:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:20:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2025-03-09 01:20:26,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.528957528957529 [2025-03-09 01:20:26,760 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 308 flow. Second operand 7 states and 137 transitions. [2025-03-09 01:20:26,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 102 transitions, 817 flow [2025-03-09 01:20:26,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 788 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:26,768 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 521 flow [2025-03-09 01:20:26,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=521, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2025-03-09 01:20:26,769 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 32 predicate places. [2025-03-09 01:20:26,769 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 521 flow [2025-03-09 01:20:26,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:26,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:26,769 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:26,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:26,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:20:26,970 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:26,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:26,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1405582044, now seen corresponding path program 1 times [2025-03-09 01:20:26,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:26,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305118654] [2025-03-09 01:20:26,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:26,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:26,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:20:26,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:20:26,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:26,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:27,038 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:27,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:27,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305118654] [2025-03-09 01:20:27,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305118654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:27,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157148195] [2025-03-09 01:20:27,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:27,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:27,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:27,041 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:27,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:20:27,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:20:27,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:20:27,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:27,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:27,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:20:27,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:27,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:27,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157148195] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:27,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:20:27,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-03-09 01:20:27,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048402130] [2025-03-09 01:20:27,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:27,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:27,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:27,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:27,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:20:27,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:27,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 521 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:27,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:27,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:27,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:27,448 INFO L124 PetriNetUnfolderBase]: 1616/2866 cut-off events. [2025-03-09 01:20:27,449 INFO L125 PetriNetUnfolderBase]: For 7472/7472 co-relation queries the response was YES. [2025-03-09 01:20:27,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9847 conditions, 2866 events. 1616/2866 cut-off events. For 7472/7472 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 15234 event pairs, 209 based on Foata normal form. 30/2896 useless extension candidates. Maximal degree in co-relation 9802. Up to 1481 conditions per place. [2025-03-09 01:20:27,463 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 78 selfloop transitions, 38 changer transitions 4/121 dead transitions. [2025-03-09 01:20:27,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 121 transitions, 1151 flow [2025-03-09 01:20:27,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:20:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:20:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2025-03-09 01:20:27,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5173745173745173 [2025-03-09 01:20:27,465 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 521 flow. Second operand 7 states and 134 transitions. [2025-03-09 01:20:27,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 121 transitions, 1151 flow [2025-03-09 01:20:27,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 121 transitions, 1119 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-09 01:20:27,479 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 823 flow [2025-03-09 01:20:27,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=823, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2025-03-09 01:20:27,479 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 42 predicate places. [2025-03-09 01:20:27,479 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 823 flow [2025-03-09 01:20:27,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:27,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:27,479 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:27,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:27,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:27,680 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:27,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:27,681 INFO L85 PathProgramCache]: Analyzing trace with hash 134405626, now seen corresponding path program 2 times [2025-03-09 01:20:27,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:27,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088687877] [2025-03-09 01:20:27,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:27,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:20:27,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:20:27,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:27,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:27,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:27,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088687877] [2025-03-09 01:20:27,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088687877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:27,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:27,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:20:27,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946360390] [2025-03-09 01:20:27,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:27,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:27,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:27,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:27,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:20:27,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:27,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 823 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:27,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:27,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:27,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:28,055 INFO L124 PetriNetUnfolderBase]: 1618/2883 cut-off events. [2025-03-09 01:20:28,055 INFO L125 PetriNetUnfolderBase]: For 11744/11744 co-relation queries the response was YES. [2025-03-09 01:20:28,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10766 conditions, 2883 events. 1618/2883 cut-off events. For 11744/11744 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 15869 event pairs, 977 based on Foata normal form. 6/2889 useless extension candidates. Maximal degree in co-relation 10716. Up to 1951 conditions per place. [2025-03-09 01:20:28,069 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 96 selfloop transitions, 17 changer transitions 1/115 dead transitions. [2025-03-09 01:20:28,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 115 transitions, 1243 flow [2025-03-09 01:20:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-09 01:20:28,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-03-09 01:20:28,073 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 823 flow. Second operand 5 states and 110 transitions. [2025-03-09 01:20:28,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 115 transitions, 1243 flow [2025-03-09 01:20:28,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 115 transitions, 1211 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-09 01:20:28,091 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 865 flow [2025-03-09 01:20:28,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=865, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2025-03-09 01:20:28,092 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 48 predicate places. [2025-03-09 01:20:28,092 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 865 flow [2025-03-09 01:20:28,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:28,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:28,093 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:28,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:20:28,093 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:28,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:28,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1315454920, now seen corresponding path program 3 times [2025-03-09 01:20:28,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:28,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548085959] [2025-03-09 01:20:28,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:28,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:28,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-09 01:20:28,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 27 statements. [2025-03-09 01:20:28,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:20:28,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:28,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:28,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548085959] [2025-03-09 01:20:28,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548085959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:28,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26114204] [2025-03-09 01:20:28,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:28,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:28,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:28,167 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:28,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:20:28,214 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-09 01:20:28,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 27 statements. [2025-03-09 01:20:28,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:20:28,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:28,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:20:28,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:28,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:28,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26114204] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:28,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:20:28,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-09 01:20:28,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63783039] [2025-03-09 01:20:28,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:28,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:28,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:28,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:28,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:20:28,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:28,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 865 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:28,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:28,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:28,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:28,678 INFO L124 PetriNetUnfolderBase]: 1729/3060 cut-off events. [2025-03-09 01:20:28,678 INFO L125 PetriNetUnfolderBase]: For 12275/12275 co-relation queries the response was YES. [2025-03-09 01:20:28,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11423 conditions, 3060 events. 1729/3060 cut-off events. For 12275/12275 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 16905 event pairs, 917 based on Foata normal form. 30/3090 useless extension candidates. Maximal degree in co-relation 11370. Up to 1707 conditions per place. [2025-03-09 01:20:28,692 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 82 selfloop transitions, 32 changer transitions 7/122 dead transitions. [2025-03-09 01:20:28,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 122 transitions, 1314 flow [2025-03-09 01:20:28,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:28,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-09 01:20:28,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6108108108108108 [2025-03-09 01:20:28,693 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 865 flow. Second operand 5 states and 113 transitions. [2025-03-09 01:20:28,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 122 transitions, 1314 flow [2025-03-09 01:20:28,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 122 transitions, 1285 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:28,720 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 955 flow [2025-03-09 01:20:28,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=955, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2025-03-09 01:20:28,720 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 52 predicate places. [2025-03-09 01:20:28,721 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 955 flow [2025-03-09 01:20:28,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:28,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:28,721 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:28,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:28,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-09 01:20:28,925 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:28,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash 103833201, now seen corresponding path program 2 times [2025-03-09 01:20:28,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:28,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152655712] [2025-03-09 01:20:28,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:28,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:28,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:20:28,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 27 statements. [2025-03-09 01:20:28,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:20:28,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:29,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:29,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152655712] [2025-03-09 01:20:29,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152655712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:29,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:29,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:20:29,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156995480] [2025-03-09 01:20:29,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:29,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:29,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:29,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:29,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:20:29,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:29,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 955 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:29,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:29,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:29,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:29,422 INFO L124 PetriNetUnfolderBase]: 1928/3399 cut-off events. [2025-03-09 01:20:29,422 INFO L125 PetriNetUnfolderBase]: For 17758/17758 co-relation queries the response was YES. [2025-03-09 01:20:29,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13390 conditions, 3399 events. 1928/3399 cut-off events. For 17758/17758 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 19171 event pairs, 1053 based on Foata normal form. 33/3432 useless extension candidates. Maximal degree in co-relation 13335. Up to 2003 conditions per place. [2025-03-09 01:20:29,436 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 97 selfloop transitions, 31 changer transitions 7/136 dead transitions. [2025-03-09 01:20:29,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 136 transitions, 1580 flow [2025-03-09 01:20:29,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:20:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:20:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-03-09 01:20:29,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-03-09 01:20:29,438 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 955 flow. Second operand 7 states and 147 transitions. [2025-03-09 01:20:29,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 136 transitions, 1580 flow [2025-03-09 01:20:29,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 136 transitions, 1484 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:29,462 INFO L231 Difference]: Finished difference. Result has 91 places, 96 transitions, 1151 flow [2025-03-09 01:20:29,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1151, PETRI_PLACES=91, PETRI_TRANSITIONS=96} [2025-03-09 01:20:29,462 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 55 predicate places. [2025-03-09 01:20:29,462 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 96 transitions, 1151 flow [2025-03-09 01:20:29,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:29,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:29,463 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:29,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:20:29,463 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:29,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:29,463 INFO L85 PathProgramCache]: Analyzing trace with hash 994925326, now seen corresponding path program 4 times [2025-03-09 01:20:29,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:29,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964433100] [2025-03-09 01:20:29,463 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:20:29,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:29,469 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:20:29,475 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:20:29,475 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:20:29,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:29,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:29,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964433100] [2025-03-09 01:20:29,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964433100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:29,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:29,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:20:29,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021013655] [2025-03-09 01:20:29,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:29,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:29,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:29,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:29,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:20:29,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:29,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 96 transitions, 1151 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:29,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:29,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:29,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:29,882 INFO L124 PetriNetUnfolderBase]: 1923/3403 cut-off events. [2025-03-09 01:20:29,882 INFO L125 PetriNetUnfolderBase]: For 17280/17280 co-relation queries the response was YES. [2025-03-09 01:20:29,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13392 conditions, 3403 events. 1923/3403 cut-off events. For 17280/17280 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 18910 event pairs, 1104 based on Foata normal form. 6/3409 useless extension candidates. Maximal degree in co-relation 13336. Up to 2170 conditions per place. [2025-03-09 01:20:29,896 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 104 selfloop transitions, 22 changer transitions 1/128 dead transitions. [2025-03-09 01:20:29,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 128 transitions, 1604 flow [2025-03-09 01:20:29,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:29,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-09 01:20:29,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5837837837837838 [2025-03-09 01:20:29,898 INFO L175 Difference]: Start difference. First operand has 91 places, 96 transitions, 1151 flow. Second operand 5 states and 108 transitions. [2025-03-09 01:20:29,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 128 transitions, 1604 flow [2025-03-09 01:20:29,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 128 transitions, 1551 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:29,923 INFO L231 Difference]: Finished difference. Result has 94 places, 100 transitions, 1239 flow [2025-03-09 01:20:29,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1239, PETRI_PLACES=94, PETRI_TRANSITIONS=100} [2025-03-09 01:20:29,924 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 58 predicate places. [2025-03-09 01:20:29,924 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 1239 flow [2025-03-09 01:20:29,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:29,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:29,924 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:29,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 01:20:29,924 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:29,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:29,925 INFO L85 PathProgramCache]: Analyzing trace with hash -897876192, now seen corresponding path program 5 times [2025-03-09 01:20:29,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:29,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487771424] [2025-03-09 01:20:29,925 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:20:29,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:29,932 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-03-09 01:20:29,936 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:20:29,936 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 01:20:29,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:29,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487771424] [2025-03-09 01:20:29,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487771424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:29,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:29,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:20:29,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988835960] [2025-03-09 01:20:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:29,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:29,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:29,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:29,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:20:29,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:29,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 100 transitions, 1239 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:29,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:29,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:29,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:30,385 INFO L124 PetriNetUnfolderBase]: 1901/3340 cut-off events. [2025-03-09 01:20:30,386 INFO L125 PetriNetUnfolderBase]: For 17570/17570 co-relation queries the response was YES. [2025-03-09 01:20:30,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13488 conditions, 3340 events. 1901/3340 cut-off events. For 17570/17570 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 18291 event pairs, 970 based on Foata normal form. 30/3370 useless extension candidates. Maximal degree in co-relation 13429. Up to 1885 conditions per place. [2025-03-09 01:20:30,399 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 102 selfloop transitions, 33 changer transitions 9/145 dead transitions. [2025-03-09 01:20:30,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 145 transitions, 1770 flow [2025-03-09 01:20:30,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:20:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:20:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2025-03-09 01:20:30,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-09 01:20:30,400 INFO L175 Difference]: Start difference. First operand has 94 places, 100 transitions, 1239 flow. Second operand 7 states and 148 transitions. [2025-03-09 01:20:30,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 145 transitions, 1770 flow [2025-03-09 01:20:30,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 145 transitions, 1737 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-09 01:20:30,429 INFO L231 Difference]: Finished difference. Result has 102 places, 107 transitions, 1379 flow [2025-03-09 01:20:30,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1379, PETRI_PLACES=102, PETRI_TRANSITIONS=107} [2025-03-09 01:20:30,429 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 66 predicate places. [2025-03-09 01:20:30,429 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 107 transitions, 1379 flow [2025-03-09 01:20:30,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:30,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:30,430 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:30,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 01:20:30,430 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:30,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:30,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1915613571, now seen corresponding path program 3 times [2025-03-09 01:20:30,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:30,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397926275] [2025-03-09 01:20:30,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:30,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:30,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-09 01:20:30,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 27 statements. [2025-03-09 01:20:30,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:20:30,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:30,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:30,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397926275] [2025-03-09 01:20:30,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397926275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:30,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052229450] [2025-03-09 01:20:30,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:30,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:30,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:30,507 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:30,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:20:30,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-09 01:20:30,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 27 statements. [2025-03-09 01:20:30,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:20:30,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:30,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:20:30,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:30,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:30,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052229450] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:30,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:20:30,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-09 01:20:30,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287716574] [2025-03-09 01:20:30,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:30,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:30,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:30,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:30,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:20:30,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:30,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 107 transitions, 1379 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:30,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:30,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:30,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:31,126 INFO L124 PetriNetUnfolderBase]: 1839/3218 cut-off events. [2025-03-09 01:20:31,126 INFO L125 PetriNetUnfolderBase]: For 18188/18188 co-relation queries the response was YES. [2025-03-09 01:20:31,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13220 conditions, 3218 events. 1839/3218 cut-off events. For 18188/18188 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 17465 event pairs, 840 based on Foata normal form. 33/3251 useless extension candidates. Maximal degree in co-relation 13158. Up to 1861 conditions per place. [2025-03-09 01:20:31,149 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 85 selfloop transitions, 42 changer transitions 6/134 dead transitions. [2025-03-09 01:20:31,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 134 transitions, 1797 flow [2025-03-09 01:20:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-03-09 01:20:31,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-03-09 01:20:31,150 INFO L175 Difference]: Start difference. First operand has 102 places, 107 transitions, 1379 flow. Second operand 5 states and 105 transitions. [2025-03-09 01:20:31,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 134 transitions, 1797 flow [2025-03-09 01:20:31,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 134 transitions, 1646 flow, removed 11 selfloop flow, removed 9 redundant places. [2025-03-09 01:20:31,192 INFO L231 Difference]: Finished difference. Result has 96 places, 106 transitions, 1319 flow [2025-03-09 01:20:31,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1319, PETRI_PLACES=96, PETRI_TRANSITIONS=106} [2025-03-09 01:20:31,192 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 60 predicate places. [2025-03-09 01:20:31,192 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 106 transitions, 1319 flow [2025-03-09 01:20:31,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 01:20:31,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:31,192 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:31,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:20:31,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 01:20:31,393 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:31,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:31,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2006737179, now seen corresponding path program 1 times [2025-03-09 01:20:31,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:31,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651052586] [2025-03-09 01:20:31,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:31,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:31,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:20:31,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:20:31,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:31,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:32,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:32,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651052586] [2025-03-09 01:20:32,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651052586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:32,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55861349] [2025-03-09 01:20:32,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:32,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:32,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:32,058 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:32,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:20:32,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:20:32,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:20:32,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:32,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:32,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 01:20:32,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:32,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 131 [2025-03-09 01:20:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:32,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:34,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:20:34,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 165 [2025-03-09 01:20:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:34,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55861349] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:34,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:34,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-09 01:20:34,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945464215] [2025-03-09 01:20:34,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:34,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 01:20:34,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:34,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 01:20:34,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:20:34,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:34,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 106 transitions, 1319 flow. Second operand has 25 states, 25 states have (on average 12.64) internal successors, (316), 25 states have internal predecessors, (316), 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 01:20:34,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:34,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:34,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:38,939 INFO L124 PetriNetUnfolderBase]: 2694/4750 cut-off events. [2025-03-09 01:20:38,940 INFO L125 PetriNetUnfolderBase]: For 24285/24285 co-relation queries the response was YES. [2025-03-09 01:20:38,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19833 conditions, 4750 events. 2694/4750 cut-off events. For 24285/24285 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 28698 event pairs, 515 based on Foata normal form. 8/4758 useless extension candidates. Maximal degree in co-relation 19775. Up to 980 conditions per place. [2025-03-09 01:20:38,958 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 235 selfloop transitions, 228 changer transitions 37/501 dead transitions. [2025-03-09 01:20:38,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 501 transitions, 5450 flow [2025-03-09 01:20:38,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-09 01:20:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-09 01:20:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 840 transitions. [2025-03-09 01:20:38,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2025-03-09 01:20:38,960 INFO L175 Difference]: Start difference. First operand has 96 places, 106 transitions, 1319 flow. Second operand 48 states and 840 transitions. [2025-03-09 01:20:38,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 501 transitions, 5450 flow [2025-03-09 01:20:38,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 501 transitions, 4939 flow, removed 46 selfloop flow, removed 7 redundant places. [2025-03-09 01:20:39,000 INFO L231 Difference]: Finished difference. Result has 153 places, 278 transitions, 3995 flow [2025-03-09 01:20:39,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=3995, PETRI_PLACES=153, PETRI_TRANSITIONS=278} [2025-03-09 01:20:39,000 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 117 predicate places. [2025-03-09 01:20:39,000 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 278 transitions, 3995 flow [2025-03-09 01:20:39,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.64) internal successors, (316), 25 states have internal predecessors, (316), 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 01:20:39,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:39,001 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:39,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 01:20:39,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 01:20:39,201 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:39,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2086512605, now seen corresponding path program 2 times [2025-03-09 01:20:39,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:39,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91378726] [2025-03-09 01:20:39,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:39,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:39,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 01:20:39,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-03-09 01:20:39,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:20:39,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:39,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:39,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91378726] [2025-03-09 01:20:39,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91378726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:39,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:39,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:20:39,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710659242] [2025-03-09 01:20:39,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:39,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:20:39,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:39,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:20:39,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:20:39,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:39,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 278 transitions, 3995 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 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 01:20:39,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:39,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:39,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:40,493 INFO L124 PetriNetUnfolderBase]: 2766/4867 cut-off events. [2025-03-09 01:20:40,493 INFO L125 PetriNetUnfolderBase]: For 31968/31968 co-relation queries the response was YES. [2025-03-09 01:20:40,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23118 conditions, 4867 events. 2766/4867 cut-off events. For 31968/31968 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 29754 event pairs, 1553 based on Foata normal form. 1/4868 useless extension candidates. Maximal degree in co-relation 23043. Up to 3608 conditions per place. [2025-03-09 01:20:40,520 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 275 selfloop transitions, 51 changer transitions 7/334 dead transitions. [2025-03-09 01:20:40,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 334 transitions, 5063 flow [2025-03-09 01:20:40,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2025-03-09 01:20:40,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2025-03-09 01:20:40,521 INFO L175 Difference]: Start difference. First operand has 153 places, 278 transitions, 3995 flow. Second operand 10 states and 183 transitions. [2025-03-09 01:20:40,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 334 transitions, 5063 flow [2025-03-09 01:20:40,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 334 transitions, 4586 flow, removed 223 selfloop flow, removed 7 redundant places. [2025-03-09 01:20:40,714 INFO L231 Difference]: Finished difference. Result has 155 places, 288 transitions, 3818 flow [2025-03-09 01:20:40,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3556, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3818, PETRI_PLACES=155, PETRI_TRANSITIONS=288} [2025-03-09 01:20:40,715 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 119 predicate places. [2025-03-09 01:20:40,715 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 288 transitions, 3818 flow [2025-03-09 01:20:40,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 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 01:20:40,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:40,716 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:40,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 01:20:40,716 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:40,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:40,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1633412713, now seen corresponding path program 3 times [2025-03-09 01:20:40,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:40,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021018233] [2025-03-09 01:20:40,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:40,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:40,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-09 01:20:40,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 30 statements. [2025-03-09 01:20:40,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:20:40,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:41,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:41,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021018233] [2025-03-09 01:20:41,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021018233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:41,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874829550] [2025-03-09 01:20:41,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:41,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:41,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:41,219 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:41,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 01:20:41,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-09 01:20:41,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 30 statements. [2025-03-09 01:20:41,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:20:41,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:41,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 01:20:41,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:41,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 132 [2025-03-09 01:20:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:41,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:42,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:20:42,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 222 [2025-03-09 01:20:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:43,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874829550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:43,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:43,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 22 [2025-03-09 01:20:43,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980131711] [2025-03-09 01:20:43,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:43,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:20:43,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:43,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:20:43,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:20:43,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:43,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 288 transitions, 3818 flow. Second operand has 22 states, 22 states have (on average 12.818181818181818) internal successors, (282), 22 states have internal predecessors, (282), 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 01:20:43,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:43,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:43,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:46,119 INFO L124 PetriNetUnfolderBase]: 3320/5830 cut-off events. [2025-03-09 01:20:46,119 INFO L125 PetriNetUnfolderBase]: For 35346/35346 co-relation queries the response was YES. [2025-03-09 01:20:46,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26978 conditions, 5830 events. 3320/5830 cut-off events. For 35346/35346 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 37057 event pairs, 921 based on Foata normal form. 8/5838 useless extension candidates. Maximal degree in co-relation 26905. Up to 2185 conditions per place. [2025-03-09 01:20:46,152 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 177 selfloop transitions, 306 changer transitions 24/508 dead transitions. [2025-03-09 01:20:46,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 508 transitions, 6685 flow [2025-03-09 01:20:46,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-09 01:20:46,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-09 01:20:46,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 511 transitions. [2025-03-09 01:20:46,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4603603603603604 [2025-03-09 01:20:46,154 INFO L175 Difference]: Start difference. First operand has 155 places, 288 transitions, 3818 flow. Second operand 30 states and 511 transitions. [2025-03-09 01:20:46,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 508 transitions, 6685 flow [2025-03-09 01:20:46,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 508 transitions, 6605 flow, removed 23 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:46,278 INFO L231 Difference]: Finished difference. Result has 190 places, 384 transitions, 6071 flow [2025-03-09 01:20:46,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3762, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=6071, PETRI_PLACES=190, PETRI_TRANSITIONS=384} [2025-03-09 01:20:46,278 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 154 predicate places. [2025-03-09 01:20:46,278 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 384 transitions, 6071 flow [2025-03-09 01:20:46,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 12.818181818181818) internal successors, (282), 22 states have internal predecessors, (282), 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 01:20:46,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:46,279 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:46,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 01:20:46,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:46,479 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:46,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1700180941, now seen corresponding path program 4 times [2025-03-09 01:20:46,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:46,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622959474] [2025-03-09 01:20:46,481 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:20:46,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:46,492 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-09 01:20:46,520 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:20:46,525 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:20:46,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622959474] [2025-03-09 01:20:46,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622959474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:46,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032155517] [2025-03-09 01:20:46,955 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:20:46,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:46,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:46,957 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:46,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 01:20:47,013 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-09 01:20:47,037 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:20:47,037 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:20:47,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:47,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 01:20:47,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:47,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 131 [2025-03-09 01:20:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:47,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:49,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:20:49,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 388 treesize of output 252 [2025-03-09 01:20:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:49,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032155517] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:49,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:49,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2025-03-09 01:20:49,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147310476] [2025-03-09 01:20:49,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:49,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 01:20:49,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:49,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 01:20:49,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:20:50,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:50,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 384 transitions, 6071 flow. Second operand has 25 states, 25 states have (on average 12.6) internal successors, (315), 25 states have internal predecessors, (315), 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 01:20:50,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:50,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:50,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:55,582 INFO L124 PetriNetUnfolderBase]: 4209/7679 cut-off events. [2025-03-09 01:20:55,582 INFO L125 PetriNetUnfolderBase]: For 74958/74958 co-relation queries the response was YES. [2025-03-09 01:20:55,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40790 conditions, 7679 events. 4209/7679 cut-off events. For 74958/74958 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 53482 event pairs, 795 based on Foata normal form. 17/7696 useless extension candidates. Maximal degree in co-relation 40705. Up to 2202 conditions per place. [2025-03-09 01:20:55,635 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 295 selfloop transitions, 505 changer transitions 63/864 dead transitions. [2025-03-09 01:20:55,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 864 transitions, 12213 flow [2025-03-09 01:20:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-09 01:20:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2025-03-09 01:20:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 1113 transitions. [2025-03-09 01:20:55,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4489713594191206 [2025-03-09 01:20:55,637 INFO L175 Difference]: Start difference. First operand has 190 places, 384 transitions, 6071 flow. Second operand 67 states and 1113 transitions. [2025-03-09 01:20:55,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 864 transitions, 12213 flow [2025-03-09 01:20:56,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 864 transitions, 11803 flow, removed 116 selfloop flow, removed 13 redundant places. [2025-03-09 01:20:56,088 INFO L231 Difference]: Finished difference. Result has 256 places, 591 transitions, 10749 flow [2025-03-09 01:20:56,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5803, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=10749, PETRI_PLACES=256, PETRI_TRANSITIONS=591} [2025-03-09 01:20:56,089 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 220 predicate places. [2025-03-09 01:20:56,089 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 591 transitions, 10749 flow [2025-03-09 01:20:56,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.6) internal successors, (315), 25 states have internal predecessors, (315), 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 01:20:56,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:56,089 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:56,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 01:20:56,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 01:20:56,289 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:56,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:56,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1285070619, now seen corresponding path program 5 times [2025-03-09 01:20:56,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:56,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036403983] [2025-03-09 01:20:56,290 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:20:56,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:56,297 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-09 01:20:56,312 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:20:56,313 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 01:20:56,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:20:56,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:56,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036403983] [2025-03-09 01:20:56,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036403983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:56,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:56,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:20:56,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349917403] [2025-03-09 01:20:56,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:56,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:20:56,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:56,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:20:56,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:20:56,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:20:56,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 591 transitions, 10749 flow. Second operand has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 states have internal predecessors, (145), 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 01:20:56,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:56,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:20:56,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:58,390 INFO L124 PetriNetUnfolderBase]: 4241/7719 cut-off events. [2025-03-09 01:20:58,390 INFO L125 PetriNetUnfolderBase]: For 92974/92974 co-relation queries the response was YES. [2025-03-09 01:20:58,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45618 conditions, 7719 events. 4241/7719 cut-off events. For 92974/92974 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 53977 event pairs, 2307 based on Foata normal form. 1/7720 useless extension candidates. Maximal degree in co-relation 45522. Up to 6134 conditions per place. [2025-03-09 01:20:58,449 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 557 selfloop transitions, 90 changer transitions 12/660 dead transitions. [2025-03-09 01:20:58,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 660 transitions, 12759 flow [2025-03-09 01:20:58,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:20:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:20:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2025-03-09 01:20:58,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49385749385749383 [2025-03-09 01:20:58,451 INFO L175 Difference]: Start difference. First operand has 256 places, 591 transitions, 10749 flow. Second operand 11 states and 201 transitions. [2025-03-09 01:20:58,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 660 transitions, 12759 flow [2025-03-09 01:20:59,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 660 transitions, 11946 flow, removed 393 selfloop flow, removed 8 redundant places. [2025-03-09 01:20:59,699 INFO L231 Difference]: Finished difference. Result has 256 places, 605 transitions, 10562 flow [2025-03-09 01:20:59,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10050, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10562, PETRI_PLACES=256, PETRI_TRANSITIONS=605} [2025-03-09 01:20:59,700 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 220 predicate places. [2025-03-09 01:20:59,700 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 605 transitions, 10562 flow [2025-03-09 01:20:59,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 states have internal predecessors, (145), 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 01:20:59,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:59,700 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:59,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-09 01:20:59,700 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:20:59,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash 839949755, now seen corresponding path program 6 times [2025-03-09 01:20:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:59,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755310337] [2025-03-09 01:20:59,700 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:20:59,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:59,708 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-03-09 01:20:59,725 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-03-09 01:20:59,725 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:20:59,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:00,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:00,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755310337] [2025-03-09 01:21:00,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755310337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:00,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167763755] [2025-03-09 01:21:00,175 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:21:00,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:00,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:00,177 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:00,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 01:21:00,230 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-03-09 01:21:00,249 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-03-09 01:21:00,249 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:21:00,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:00,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 01:21:00,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:00,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 78 [2025-03-09 01:21:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:00,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:01,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:21:01,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 417 treesize of output 257 [2025-03-09 01:21:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:02,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167763755] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:02,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:02,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 22 [2025-03-09 01:21:02,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613925761] [2025-03-09 01:21:02,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:02,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:21:02,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:02,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:21:02,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:21:02,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:21:02,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 605 transitions, 10562 flow. Second operand has 22 states, 22 states have (on average 12.772727272727273) internal successors, (281), 22 states have internal predecessors, (281), 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 01:21:02,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:02,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:21:02,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:05,173 INFO L124 PetriNetUnfolderBase]: 4242/7822 cut-off events. [2025-03-09 01:21:05,174 INFO L125 PetriNetUnfolderBase]: For 65539/65539 co-relation queries the response was YES. [2025-03-09 01:21:05,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42593 conditions, 7822 events. 4242/7822 cut-off events. For 65539/65539 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 55336 event pairs, 1252 based on Foata normal form. 5/7827 useless extension candidates. Maximal degree in co-relation 42497. Up to 3390 conditions per place. [2025-03-09 01:21:05,226 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 183 selfloop transitions, 506 changer transitions 26/716 dead transitions. [2025-03-09 01:21:05,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 716 transitions, 12641 flow [2025-03-09 01:21:05,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:21:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 01:21:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 391 transitions. [2025-03-09 01:21:05,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48034398034398035 [2025-03-09 01:21:05,227 INFO L175 Difference]: Start difference. First operand has 256 places, 605 transitions, 10562 flow. Second operand 22 states and 391 transitions. [2025-03-09 01:21:05,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 716 transitions, 12641 flow [2025-03-09 01:21:05,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 716 transitions, 12375 flow, removed 11 selfloop flow, removed 8 redundant places. [2025-03-09 01:21:05,706 INFO L231 Difference]: Finished difference. Result has 274 places, 625 transitions, 12267 flow [2025-03-09 01:21:05,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10293, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=481, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=12267, PETRI_PLACES=274, PETRI_TRANSITIONS=625} [2025-03-09 01:21:05,707 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 238 predicate places. [2025-03-09 01:21:05,707 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 625 transitions, 12267 flow [2025-03-09 01:21:05,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 12.772727272727273) internal successors, (281), 22 states have internal predecessors, (281), 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 01:21:05,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:05,707 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:05,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 01:21:05,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:05,908 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:21:05,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash 337561289, now seen corresponding path program 7 times [2025-03-09 01:21:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:05,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110420890] [2025-03-09 01:21:05,908 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:21:05,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:05,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:21:05,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:21:05,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:05,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:06,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:06,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110420890] [2025-03-09 01:21:06,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110420890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:06,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355781685] [2025-03-09 01:21:06,335 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:21:06,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:06,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:06,336 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:06,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 01:21:06,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:21:06,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:21:06,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:06,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:06,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 01:21:06,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:06,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 135 [2025-03-09 01:21:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:06,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:08,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:21:08,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 197 [2025-03-09 01:21:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:08,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355781685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:08,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:08,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-03-09 01:21:08,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198690508] [2025-03-09 01:21:08,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:08,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:21:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:08,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:21:08,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:21:09,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:21:09,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 625 transitions, 12267 flow. Second operand has 26 states, 26 states have (on average 12.5) internal successors, (325), 26 states have internal predecessors, (325), 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 01:21:09,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:09,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:21:09,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:13,755 INFO L124 PetriNetUnfolderBase]: 4646/8609 cut-off events. [2025-03-09 01:21:13,756 INFO L125 PetriNetUnfolderBase]: For 85903/85903 co-relation queries the response was YES. [2025-03-09 01:21:13,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50716 conditions, 8609 events. 4646/8609 cut-off events. For 85903/85903 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 62110 event pairs, 1295 based on Foata normal form. 11/8620 useless extension candidates. Maximal degree in co-relation 50616. Up to 3244 conditions per place. [2025-03-09 01:21:13,821 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 273 selfloop transitions, 617 changer transitions 35/926 dead transitions. [2025-03-09 01:21:13,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 926 transitions, 17404 flow [2025-03-09 01:21:13,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-09 01:21:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-09 01:21:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 637 transitions. [2025-03-09 01:21:13,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47822822822822825 [2025-03-09 01:21:13,823 INFO L175 Difference]: Start difference. First operand has 274 places, 625 transitions, 12267 flow. Second operand 36 states and 637 transitions. [2025-03-09 01:21:13,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 926 transitions, 17404 flow [2025-03-09 01:21:14,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 926 transitions, 17207 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-03-09 01:21:14,542 INFO L231 Difference]: Finished difference. Result has 310 places, 750 transitions, 16657 flow [2025-03-09 01:21:14,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12123, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=499, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=16657, PETRI_PLACES=310, PETRI_TRANSITIONS=750} [2025-03-09 01:21:14,543 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 274 predicate places. [2025-03-09 01:21:14,543 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 750 transitions, 16657 flow [2025-03-09 01:21:14,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 12.5) internal successors, (325), 26 states have internal predecessors, (325), 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 01:21:14,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:14,543 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:14,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 01:21:14,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:14,744 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:21:14,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:14,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1897490181, now seen corresponding path program 8 times [2025-03-09 01:21:14,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:14,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863714265] [2025-03-09 01:21:14,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:14,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:14,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 01:21:14,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:21:14,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:21:14,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:15,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863714265] [2025-03-09 01:21:15,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863714265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573143793] [2025-03-09 01:21:15,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:15,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:15,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:15,398 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:15,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 01:21:15,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 01:21:15,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:21:15,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:21:15,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:15,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 01:21:15,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:15,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 76 [2025-03-09 01:21:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:16,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:17,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:21:17,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 184 [2025-03-09 01:21:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:17,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573143793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:17,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:17,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 33 [2025-03-09 01:21:17,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654088038] [2025-03-09 01:21:17,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:17,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-09 01:21:17,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:17,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-09 01:21:17,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=884, Unknown=0, NotChecked=0, Total=1056 [2025-03-09 01:21:18,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:21:18,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 750 transitions, 16657 flow. Second operand has 33 states, 33 states have (on average 12.030303030303031) internal successors, (397), 33 states have internal predecessors, (397), 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 01:21:18,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:18,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:21:18,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:22,173 INFO L124 PetriNetUnfolderBase]: 4724/8746 cut-off events. [2025-03-09 01:21:22,173 INFO L125 PetriNetUnfolderBase]: For 113960/113960 co-relation queries the response was YES. [2025-03-09 01:21:22,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57132 conditions, 8746 events. 4724/8746 cut-off events. For 113960/113960 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 63343 event pairs, 1116 based on Foata normal form. 1/8747 useless extension candidates. Maximal degree in co-relation 57022. Up to 2527 conditions per place. [2025-03-09 01:21:22,239 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 522 selfloop transitions, 522 changer transitions 21/1066 dead transitions. [2025-03-09 01:21:22,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 1066 transitions, 23430 flow [2025-03-09 01:21:22,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 01:21:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-09 01:21:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 609 transitions. [2025-03-09 01:21:22,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4702702702702703 [2025-03-09 01:21:22,242 INFO L175 Difference]: Start difference. First operand has 310 places, 750 transitions, 16657 flow. Second operand 35 states and 609 transitions. [2025-03-09 01:21:22,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 1066 transitions, 23430 flow [2025-03-09 01:21:23,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 1066 transitions, 22468 flow, removed 238 selfloop flow, removed 11 redundant places. [2025-03-09 01:21:23,422 INFO L231 Difference]: Finished difference. Result has 345 places, 835 transitions, 19160 flow [2025-03-09 01:21:23,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15918, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=440, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=19160, PETRI_PLACES=345, PETRI_TRANSITIONS=835} [2025-03-09 01:21:23,425 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 309 predicate places. [2025-03-09 01:21:23,428 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 835 transitions, 19160 flow [2025-03-09 01:21:23,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 12.030303030303031) internal successors, (397), 33 states have internal predecessors, (397), 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 01:21:23,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:23,429 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:23,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-09 01:21:23,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:23,630 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:21:23,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:23,631 INFO L85 PathProgramCache]: Analyzing trace with hash -268698587, now seen corresponding path program 9 times [2025-03-09 01:21:23,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:23,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459701109] [2025-03-09 01:21:23,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:21:23,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:23,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-09 01:21:23,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 30 statements. [2025-03-09 01:21:23,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:21:23,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:24,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:24,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459701109] [2025-03-09 01:21:24,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459701109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318892289] [2025-03-09 01:21:24,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:21:24,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:24,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:24,216 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:24,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-09 01:21:24,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-09 01:21:24,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 30 statements. [2025-03-09 01:21:24,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:21:24,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:24,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 01:21:24,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:24,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 89 [2025-03-09 01:21:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:24,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:25,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:21:25,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 170 [2025-03-09 01:21:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:25,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318892289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:25,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:25,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2025-03-09 01:21:25,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442754317] [2025-03-09 01:21:25,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:25,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:21:25,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:25,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:21:25,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:21:26,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:21:26,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 835 transitions, 19160 flow. Second operand has 28 states, 28 states have (on average 12.392857142857142) internal successors, (347), 28 states have internal predecessors, (347), 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 01:21:26,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:26,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:21:26,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:29,506 INFO L124 PetriNetUnfolderBase]: 4740/8930 cut-off events. [2025-03-09 01:21:29,507 INFO L125 PetriNetUnfolderBase]: For 121964/121964 co-relation queries the response was YES. [2025-03-09 01:21:29,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63135 conditions, 8930 events. 4740/8930 cut-off events. For 121964/121964 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 66252 event pairs, 1677 based on Foata normal form. 3/8933 useless extension candidates. Maximal degree in co-relation 63016. Up to 4701 conditions per place. [2025-03-09 01:21:29,596 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 460 selfloop transitions, 528 changer transitions 17/1006 dead transitions. [2025-03-09 01:21:29,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 1006 transitions, 23398 flow [2025-03-09 01:21:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:21:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 01:21:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 378 transitions. [2025-03-09 01:21:29,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4643734643734644 [2025-03-09 01:21:29,598 INFO L175 Difference]: Start difference. First operand has 345 places, 835 transitions, 19160 flow. Second operand 22 states and 378 transitions. [2025-03-09 01:21:29,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 1006 transitions, 23398 flow [2025-03-09 01:21:30,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 1006 transitions, 22427 flow, removed 124 selfloop flow, removed 8 redundant places. [2025-03-09 01:21:30,887 INFO L231 Difference]: Finished difference. Result has 364 places, 894 transitions, 21231 flow [2025-03-09 01:21:30,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=18301, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=470, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=21231, PETRI_PLACES=364, PETRI_TRANSITIONS=894} [2025-03-09 01:21:30,888 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 328 predicate places. [2025-03-09 01:21:30,888 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 894 transitions, 21231 flow [2025-03-09 01:21:30,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.392857142857142) internal successors, (347), 28 states have internal predecessors, (347), 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 01:21:30,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:30,888 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:30,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:31,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:31,089 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:21:31,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:31,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1874204645, now seen corresponding path program 10 times [2025-03-09 01:21:31,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:31,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363055048] [2025-03-09 01:21:31,089 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:21:31,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:31,095 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-09 01:21:31,102 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:21:31,102 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:21:31,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:31,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:31,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363055048] [2025-03-09 01:21:31,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363055048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:31,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480120240] [2025-03-09 01:21:31,527 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:21:31,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:31,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:31,529 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:31,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-09 01:21:31,595 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-09 01:21:31,619 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:21:31,620 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:21:31,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:31,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 01:21:31,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:32,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 104 [2025-03-09 01:21:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:32,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:33,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:21:33,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 159 [2025-03-09 01:21:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:33,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480120240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:33,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:33,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2025-03-09 01:21:33,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665848774] [2025-03-09 01:21:33,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:33,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:21:33,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:33,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:21:33,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:21:33,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-09 01:21:33,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 894 transitions, 21231 flow. Second operand has 24 states, 24 states have (on average 12.666666666666666) internal successors, (304), 24 states have internal predecessors, (304), 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 01:21:33,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:33,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-09 01:21:33,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:38,155 INFO L124 PetriNetUnfolderBase]: 4803/9043 cut-off events. [2025-03-09 01:21:38,156 INFO L125 PetriNetUnfolderBase]: For 126851/126851 co-relation queries the response was YES. [2025-03-09 01:21:38,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64776 conditions, 9043 events. 4803/9043 cut-off events. For 126851/126851 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 67164 event pairs, 1032 based on Foata normal form. 6/9049 useless extension candidates. Maximal degree in co-relation 64651. Up to 2980 conditions per place. [2025-03-09 01:21:38,251 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 284 selfloop transitions, 767 changer transitions 25/1077 dead transitions. [2025-03-09 01:21:38,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 1077 transitions, 25435 flow [2025-03-09 01:21:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-09 01:21:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-09 01:21:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 566 transitions. [2025-03-09 01:21:38,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46355446355446356 [2025-03-09 01:21:38,253 INFO L175 Difference]: Start difference. First operand has 364 places, 894 transitions, 21231 flow. Second operand 33 states and 566 transitions. [2025-03-09 01:21:38,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 1077 transitions, 25435 flow [2025-03-09 01:21:39,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 1077 transitions, 25273 flow, removed 58 selfloop flow, removed 8 redundant places. [2025-03-09 01:21:39,616 INFO L231 Difference]: Finished difference. Result has 391 places, 953 transitions, 24337 flow [2025-03-09 01:21:39,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=21082, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=707, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=24337, PETRI_PLACES=391, PETRI_TRANSITIONS=953} [2025-03-09 01:21:39,617 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 355 predicate places. [2025-03-09 01:21:39,617 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 953 transitions, 24337 flow [2025-03-09 01:21:39,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 12.666666666666666) internal successors, (304), 24 states have internal predecessors, (304), 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 01:21:39,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:39,617 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:39,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-09 01:21:39,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-09 01:21:39,817 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-09 01:21:39,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:39,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1730721147, now seen corresponding path program 11 times [2025-03-09 01:21:39,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:39,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095119523] [2025-03-09 01:21:39,819 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:21:39,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:39,825 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-09 01:21:39,834 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:21:39,834 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 01:21:39,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:40,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:40,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095119523] [2025-03-09 01:21:40,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095119523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:40,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40443194] [2025-03-09 01:21:40,268 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:21:40,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:40,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:40,270 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:21:40,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-09 01:21:40,327 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-09 01:21:40,347 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:21:40,347 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 01:21:40,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:40,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 01:21:40,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:40,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 132 [2025-03-09 01:21:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 01:21:40,844 INFO L312 TraceCheckSpWp]: Computing backward predicates...