./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-send-receive.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/popl20-send-receive.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 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:28:49,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:28:49,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:28:49,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:28:49,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:28:49,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:28:49,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:28:49,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:28:49,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:28:49,685 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:28:49,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:28:49,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:28:49,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:28:49,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:28:49,687 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:28:49,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:28:49,687 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:28:49,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:28:49,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:28:49,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:28:49,687 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:28:49,687 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:28:49,687 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:28:49,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:28:49,687 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:28:49,687 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:28:49,687 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:28:49,688 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:28:49,688 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:28:49,688 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:28:49,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:28:49,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:28:49,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:28:49,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:28:49,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:28:49,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:28:49,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:28:49,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:28:49,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:28:49,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:28:49,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:28:49,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:28:49,688 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 -> 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 [2025-03-09 01:28:49,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:28:49,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:28:49,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:28:49,922 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:28:49,922 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:28:49,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2025-03-09 01:28:51,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b399e72d/ee3763788ce84c8dbe8186d151050eeb/FLAG0a1a674ec [2025-03-09 01:28:51,247 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:28:51,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2025-03-09 01:28:51,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b399e72d/ee3763788ce84c8dbe8186d151050eeb/FLAG0a1a674ec [2025-03-09 01:28:51,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b399e72d/ee3763788ce84c8dbe8186d151050eeb [2025-03-09 01:28:51,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:28:51,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:28:51,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:28:51,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:28:51,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:28:51,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:28:51" (1/1) ... [2025-03-09 01:28:51,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f5375a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:51, skipping insertion in model container [2025-03-09 01:28:51,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:28:51" (1/1) ... [2025-03-09 01:28:51,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:28:51,401 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:28:51,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:28:51,409 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:28:51,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:28:51,443 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:28:51,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:51 WrapperNode [2025-03-09 01:28:51,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:28:51,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:28:51,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:28:51,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:28:51,449 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:28:51" (1/1) ... [2025-03-09 01:28:51,454 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:28:51" (1/1) ... [2025-03-09 01:28:51,467 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 141 [2025-03-09 01:28:51,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:28:51,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:28:51,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:28:51,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:28:51,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:51" (1/1) ... [2025-03-09 01:28:51,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:51" (1/1) ... [2025-03-09 01:28:51,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:51" (1/1) ... [2025-03-09 01:28:51,482 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 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:28:51,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:51" (1/1) ... [2025-03-09 01:28:51,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:51" (1/1) ... [2025-03-09 01:28:51,488 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:51" (1/1) ... [2025-03-09 01:28:51,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:51" (1/1) ... [2025-03-09 01:28:51,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:51" (1/1) ... [2025-03-09 01:28:51,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:51" (1/1) ... [2025-03-09 01:28:51,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:28:51,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:28:51,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:28:51,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:28:51,495 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:51" (1/1) ... [2025-03-09 01:28:51,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:28:51,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:51,516 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:28:51,519 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:28:51,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:28:51,535 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:28:51,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:28:51,535 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:28:51,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:28:51,535 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:28:51,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:28:51,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:28:51,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:28:51,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:28:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:28:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:28:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:28:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:28:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:28:51,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:28:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:28:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:28:51,537 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:28:51,615 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:28:51,616 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:28:51,827 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:28:51,827 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:28:51,973 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:28:51,974 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:28:51,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:28:51 BoogieIcfgContainer [2025-03-09 01:28:51,974 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:28:51,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:28:51,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:28:51,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:28:51,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:28:51" (1/3) ... [2025-03-09 01:28:51,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721d911e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:28:51, skipping insertion in model container [2025-03-09 01:28:51,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:51" (2/3) ... [2025-03-09 01:28:51,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721d911e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:28:51, skipping insertion in model container [2025-03-09 01:28:51,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:28:51" (3/3) ... [2025-03-09 01:28:51,981 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2025-03-09 01:28:51,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:28:51,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive.wvr.c that has 4 procedures, 45 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-03-09 01:28:51,993 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:28:52,032 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:28:52,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 117 flow [2025-03-09 01:28:52,085 INFO L124 PetriNetUnfolderBase]: 4/45 cut-off events. [2025-03-09 01:28:52,086 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:28:52,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 4/45 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 96 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-03-09 01:28:52,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 48 transitions, 117 flow [2025-03-09 01:28:52,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 44 transitions, 106 flow [2025-03-09 01:28:52,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:28:52,111 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;@7663a0da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:28:52,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-09 01:28:52,113 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:28:52,114 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:28:52,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:28:52,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:52,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:28:52,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:28:52,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:52,118 INFO L85 PathProgramCache]: Analyzing trace with hash 387523, now seen corresponding path program 1 times [2025-03-09 01:28:52,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:52,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319795210] [2025-03-09 01:28:52,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:52,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:52,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:28:52,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:28:52,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:52,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:52,323 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:28:52,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:52,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319795210] [2025-03-09 01:28:52,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319795210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:52,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:52,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:28:52,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084282935] [2025-03-09 01:28:52,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:52,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:28:52,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:52,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:28:52,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:28:52,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-09 01:28:52,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:28:52,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:52,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-09 01:28:52,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:52,640 INFO L124 PetriNetUnfolderBase]: 1137/1761 cut-off events. [2025-03-09 01:28:52,640 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-03-09 01:28:52,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3600 conditions, 1761 events. 1137/1761 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9400 event pairs, 952 based on Foata normal form. 1/1245 useless extension candidates. Maximal degree in co-relation 3368. Up to 1664 conditions per place. [2025-03-09 01:28:52,655 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 30 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2025-03-09 01:28:52,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 164 flow [2025-03-09 01:28:52,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:28:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:28:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-09 01:28:52,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2025-03-09 01:28:52,668 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 106 flow. Second operand 3 states and 73 transitions. [2025-03-09 01:28:52,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 164 flow [2025-03-09 01:28:52,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 152 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:28:52,679 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 92 flow [2025-03-09 01:28:52,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-03-09 01:28:52,685 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2025-03-09 01:28:52,685 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 92 flow [2025-03-09 01:28:52,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:28:52,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:52,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:28:52,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:28:52,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:28:52,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:52,686 INFO L85 PathProgramCache]: Analyzing trace with hash 387524, now seen corresponding path program 1 times [2025-03-09 01:28:52,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:52,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260324574] [2025-03-09 01:28:52,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:52,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:52,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:28:52,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:28:52,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:52,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:52,912 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:28:52,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:52,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260324574] [2025-03-09 01:28:52,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260324574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:52,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:52,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:28:52,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787240566] [2025-03-09 01:28:52,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:52,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:52,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:52,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:52,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:52,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-09 01:28:52,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:28:52,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:52,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-09 01:28:52,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:53,111 INFO L124 PetriNetUnfolderBase]: 1138/1764 cut-off events. [2025-03-09 01:28:53,112 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-09 01:28:53,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3507 conditions, 1764 events. 1138/1764 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9440 event pairs, 952 based on Foata normal form. 0/1247 useless extension candidates. Maximal degree in co-relation 3485. Up to 1669 conditions per place. [2025-03-09 01:28:53,120 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 32 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2025-03-09 01:28:53,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 172 flow [2025-03-09 01:28:53,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-09 01:28:53,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4635416666666667 [2025-03-09 01:28:53,121 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 92 flow. Second operand 4 states and 89 transitions. [2025-03-09 01:28:53,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 172 flow [2025-03-09 01:28:53,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:53,123 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 115 flow [2025-03-09 01:28:53,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2025-03-09 01:28:53,123 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2025-03-09 01:28:53,123 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 115 flow [2025-03-09 01:28:53,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:28:53,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:53,124 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:28:53,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:28:53,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:28:53,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:53,124 INFO L85 PathProgramCache]: Analyzing trace with hash 372423298, now seen corresponding path program 1 times [2025-03-09 01:28:53,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:53,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110422340] [2025-03-09 01:28:53,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:53,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:53,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:28:53,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:28:53,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:53,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:53,365 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:28:53,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:53,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110422340] [2025-03-09 01:28:53,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110422340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:53,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778539950] [2025-03-09 01:28:53,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:53,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:53,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:53,368 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:28:53,369 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:28:53,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:28:53,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:28:53,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:53,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:53,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:28:53,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:53,477 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:28:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:53,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:53,686 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:28:53,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778539950] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:53,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:53,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:28:53,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624066618] [2025-03-09 01:28:53,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:53,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:28:53,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:53,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:28:53,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:28:53,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-09 01:28:53,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 115 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:53,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:53,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-09 01:28:53,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:53,998 INFO L124 PetriNetUnfolderBase]: 1138/1763 cut-off events. [2025-03-09 01:28:53,999 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-09 01:28:54,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3514 conditions, 1763 events. 1138/1763 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9415 event pairs, 952 based on Foata normal form. 0/1246 useless extension candidates. Maximal degree in co-relation 3492. Up to 1665 conditions per place. [2025-03-09 01:28:54,006 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 28 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2025-03-09 01:28:54,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 43 transitions, 181 flow [2025-03-09 01:28:54,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:28:54,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:28:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-03-09 01:28:54,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2025-03-09 01:28:54,008 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 115 flow. Second operand 6 states and 114 transitions. [2025-03-09 01:28:54,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 43 transitions, 181 flow [2025-03-09 01:28:54,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:28:54,009 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 122 flow [2025-03-09 01:28:54,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2025-03-09 01:28:54,009 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2025-03-09 01:28:54,009 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 122 flow [2025-03-09 01:28:54,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:54,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:54,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:54,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:28:54,210 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:28:54,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:28:54,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1488184725, now seen corresponding path program 1 times [2025-03-09 01:28:54,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:54,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425473484] [2025-03-09 01:28:54,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:54,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:54,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:28:54,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:28:54,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:54,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:54,262 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:28:54,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:54,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425473484] [2025-03-09 01:28:54,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425473484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:54,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:54,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:28:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216784813] [2025-03-09 01:28:54,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:54,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:28:54,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:54,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:28:54,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:28:54,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-09 01:28:54,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:28:54,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:54,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-09 01:28:54,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:54,441 INFO L124 PetriNetUnfolderBase]: 1377/2215 cut-off events. [2025-03-09 01:28:54,441 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-09 01:28:54,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4361 conditions, 2215 events. 1377/2215 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 11946 event pairs, 580 based on Foata normal form. 73/1679 useless extension candidates. Maximal degree in co-relation 4335. Up to 1376 conditions per place. [2025-03-09 01:28:54,453 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 50 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2025-03-09 01:28:54,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 268 flow [2025-03-09 01:28:54,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:28:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:28:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-03-09 01:28:54,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6597222222222222 [2025-03-09 01:28:54,454 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 122 flow. Second operand 3 states and 95 transitions. [2025-03-09 01:28:54,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 268 flow [2025-03-09 01:28:54,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 238 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-09 01:28:54,456 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 115 flow [2025-03-09 01:28:54,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2025-03-09 01:28:54,457 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-03-09 01:28:54,457 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 115 flow [2025-03-09 01:28:54,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:28:54,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:54,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:54,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:28:54,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:28:54,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:54,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1982287333, now seen corresponding path program 1 times [2025-03-09 01:28:54,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:54,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918480257] [2025-03-09 01:28:54,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:54,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:54,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:28:54,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:28:54,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:54,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:54,537 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:28:54,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:54,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918480257] [2025-03-09 01:28:54,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918480257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:54,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:54,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:28:54,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762795674] [2025-03-09 01:28:54,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:54,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:54,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:54,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:54,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:54,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-09 01:28:54,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:28:54,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:54,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-09 01:28:54,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:54,666 INFO L124 PetriNetUnfolderBase]: 957/1498 cut-off events. [2025-03-09 01:28:54,666 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2025-03-09 01:28:54,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3271 conditions, 1498 events. 957/1498 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7142 event pairs, 794 based on Foata normal form. 0/1282 useless extension candidates. Maximal degree in co-relation 1104. Up to 1418 conditions per place. [2025-03-09 01:28:54,672 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 31 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2025-03-09 01:28:54,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 175 flow [2025-03-09 01:28:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:54,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-03-09 01:28:54,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-03-09 01:28:54,673 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 115 flow. Second operand 4 states and 84 transitions. [2025-03-09 01:28:54,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 175 flow [2025-03-09 01:28:54,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:28:54,674 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 110 flow [2025-03-09 01:28:54,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2025-03-09 01:28:54,675 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2025-03-09 01:28:54,675 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 110 flow [2025-03-09 01:28:54,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:28:54,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:54,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:54,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:28:54,676 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:28:54,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:54,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1982287334, now seen corresponding path program 1 times [2025-03-09 01:28:54,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:54,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659776160] [2025-03-09 01:28:54,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:54,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:54,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:28:54,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:28:54,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:54,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:54,726 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:28:54,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:54,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659776160] [2025-03-09 01:28:54,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659776160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:54,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:54,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:28:54,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006037016] [2025-03-09 01:28:54,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:54,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:54,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:54,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:54,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:54,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-09 01:28:54,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:28:54,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:54,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-09 01:28:54,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:54,862 INFO L124 PetriNetUnfolderBase]: 1128/1801 cut-off events. [2025-03-09 01:28:54,863 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2025-03-09 01:28:54,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3829 conditions, 1801 events. 1128/1801 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8778 event pairs, 966 based on Foata normal form. 0/1590 useless extension candidates. Maximal degree in co-relation 3198. Up to 1421 conditions per place. [2025-03-09 01:28:54,870 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 47 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-03-09 01:28:54,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 248 flow [2025-03-09 01:28:54,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-03-09 01:28:54,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546875 [2025-03-09 01:28:54,871 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 110 flow. Second operand 4 states and 105 transitions. [2025-03-09 01:28:54,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 248 flow [2025-03-09 01:28:54,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:54,872 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 115 flow [2025-03-09 01:28:54,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2025-03-09 01:28:54,872 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2025-03-09 01:28:54,873 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 115 flow [2025-03-09 01:28:54,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:28:54,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:54,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:54,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:28:54,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:28:54,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:54,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1678756712, now seen corresponding path program 1 times [2025-03-09 01:28:54,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:54,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360666160] [2025-03-09 01:28:54,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:54,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:54,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:28:54,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:28:54,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:54,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:28:55,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:55,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360666160] [2025-03-09 01:28:55,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360666160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:55,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:55,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:28:55,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109011770] [2025-03-09 01:28:55,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:55,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:28:55,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:55,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:28:55,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:28:55,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-09 01:28:55,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:28:55,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:55,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-09 01:28:55,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:55,219 INFO L124 PetriNetUnfolderBase]: 776/1365 cut-off events. [2025-03-09 01:28:55,219 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-03-09 01:28:55,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2834 conditions, 1365 events. 776/1365 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6883 event pairs, 533 based on Foata normal form. 124/1399 useless extension candidates. Maximal degree in co-relation 2207. Up to 1001 conditions per place. [2025-03-09 01:28:55,224 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 33 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2025-03-09 01:28:55,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 49 transitions, 213 flow [2025-03-09 01:28:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-09 01:28:55,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-03-09 01:28:55,225 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 115 flow. Second operand 5 states and 110 transitions. [2025-03-09 01:28:55,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 49 transitions, 213 flow [2025-03-09 01:28:55,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:55,226 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 118 flow [2025-03-09 01:28:55,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2025-03-09 01:28:55,227 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-03-09 01:28:55,227 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 118 flow [2025-03-09 01:28:55,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:28:55,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:55,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:55,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:28:55,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:28:55,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:55,228 INFO L85 PathProgramCache]: Analyzing trace with hash 988772833, now seen corresponding path program 1 times [2025-03-09 01:28:55,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:55,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521882070] [2025-03-09 01:28:55,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:55,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:55,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:28:55,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:28:55,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:55,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:55,299 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:28:55,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:55,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521882070] [2025-03-09 01:28:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521882070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:55,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:55,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:28:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647944256] [2025-03-09 01:28:55,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:55,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:55,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:55,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:55,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:55,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-09 01:28:55,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:55,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:55,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-09 01:28:55,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:55,408 INFO L124 PetriNetUnfolderBase]: 621/1052 cut-off events. [2025-03-09 01:28:55,408 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2025-03-09 01:28:55,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2406 conditions, 1052 events. 621/1052 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4548 event pairs, 75 based on Foata normal form. 56/1092 useless extension candidates. Maximal degree in co-relation 1895. Up to 636 conditions per place. [2025-03-09 01:28:55,413 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 55 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2025-03-09 01:28:55,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 336 flow [2025-03-09 01:28:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-03-09 01:28:55,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5572916666666666 [2025-03-09 01:28:55,414 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 118 flow. Second operand 4 states and 107 transitions. [2025-03-09 01:28:55,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 336 flow [2025-03-09 01:28:55,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 300 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:28:55,417 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 123 flow [2025-03-09 01:28:55,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-03-09 01:28:55,417 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2025-03-09 01:28:55,417 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 123 flow [2025-03-09 01:28:55,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:55,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:55,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:55,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:28:55,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:28:55,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:55,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1776818739, now seen corresponding path program 2 times [2025-03-09 01:28:55,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:55,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175864134] [2025-03-09 01:28:55,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:55,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:55,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:28:55,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:28:55,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:28:55,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:55,506 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:28:55,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:55,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175864134] [2025-03-09 01:28:55,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175864134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:55,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:55,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:28:55,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288004251] [2025-03-09 01:28:55,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:55,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:55,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:55,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:55,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:55,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-09 01:28:55,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:55,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:55,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-09 01:28:55,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:55,593 INFO L124 PetriNetUnfolderBase]: 566/937 cut-off events. [2025-03-09 01:28:55,593 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2025-03-09 01:28:55,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2325 conditions, 937 events. 566/937 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3983 event pairs, 112 based on Foata normal form. 28/940 useless extension candidates. Maximal degree in co-relation 1792. Up to 622 conditions per place. [2025-03-09 01:28:55,597 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 44 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-03-09 01:28:55,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 280 flow [2025-03-09 01:28:55,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-09 01:28:55,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2025-03-09 01:28:55,598 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 123 flow. Second operand 4 states and 98 transitions. [2025-03-09 01:28:55,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 280 flow [2025-03-09 01:28:55,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:28:55,599 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 153 flow [2025-03-09 01:28:55,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-03-09 01:28:55,600 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2025-03-09 01:28:55,600 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 153 flow [2025-03-09 01:28:55,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:55,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:55,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:55,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:28:55,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:28:55,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:55,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1609085659, now seen corresponding path program 3 times [2025-03-09 01:28:55,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:55,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532391856] [2025-03-09 01:28:55,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:28:55,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:55,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:28:55,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:28:55,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:28:55,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:55,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:55,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532391856] [2025-03-09 01:28:55,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532391856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:55,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:55,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:28:55,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829545508] [2025-03-09 01:28:55,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:55,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:28:55,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:55,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:28:55,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:28:55,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-09 01:28:55,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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:28:55,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:55,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-09 01:28:55,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:55,881 INFO L124 PetriNetUnfolderBase]: 674/1153 cut-off events. [2025-03-09 01:28:55,881 INFO L125 PetriNetUnfolderBase]: For 670/670 co-relation queries the response was YES. [2025-03-09 01:28:55,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2948 conditions, 1153 events. 674/1153 cut-off events. For 670/670 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5286 event pairs, 148 based on Foata normal form. 52/1190 useless extension candidates. Maximal degree in co-relation 2274. Up to 612 conditions per place. [2025-03-09 01:28:55,889 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 65 selfloop transitions, 7 changer transitions 0/80 dead transitions. [2025-03-09 01:28:55,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 80 transitions, 413 flow [2025-03-09 01:28:55,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-09 01:28:55,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-09 01:28:55,890 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 153 flow. Second operand 5 states and 130 transitions. [2025-03-09 01:28:55,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 80 transitions, 413 flow [2025-03-09 01:28:55,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 408 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:28:55,892 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 171 flow [2025-03-09 01:28:55,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2025-03-09 01:28:55,892 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2025-03-09 01:28:55,892 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 171 flow [2025-03-09 01:28:55,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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:28:55,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:55,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:55,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:28:55,892 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:28:55,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash 986869303, now seen corresponding path program 4 times [2025-03-09 01:28:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104481410] [2025-03-09 01:28:55,893 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:28:55,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:55,899 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:28:55,904 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:28:55,904 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:28:55,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:55,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:55,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104481410] [2025-03-09 01:28:55,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104481410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:55,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:55,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:28:55,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905476313] [2025-03-09 01:28:55,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:55,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:55,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:55,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:55,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:55,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-09 01:28:55,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:55,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:55,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-09 01:28:55,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:56,126 INFO L124 PetriNetUnfolderBase]: 934/1633 cut-off events. [2025-03-09 01:28:56,126 INFO L125 PetriNetUnfolderBase]: For 1440/1452 co-relation queries the response was YES. [2025-03-09 01:28:56,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4242 conditions, 1633 events. 934/1633 cut-off events. For 1440/1452 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 8422 event pairs, 276 based on Foata normal form. 70/1634 useless extension candidates. Maximal degree in co-relation 3482. Up to 794 conditions per place. [2025-03-09 01:28:56,136 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 58 selfloop transitions, 7 changer transitions 0/73 dead transitions. [2025-03-09 01:28:56,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 402 flow [2025-03-09 01:28:56,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-03-09 01:28:56,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5125 [2025-03-09 01:28:56,137 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 171 flow. Second operand 5 states and 123 transitions. [2025-03-09 01:28:56,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 402 flow [2025-03-09 01:28:56,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 388 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:28:56,141 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 183 flow [2025-03-09 01:28:56,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2025-03-09 01:28:56,141 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2025-03-09 01:28:56,141 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 183 flow [2025-03-09 01:28:56,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:56,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:56,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:56,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:28:56,141 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:28:56,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:56,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1917580925, now seen corresponding path program 5 times [2025-03-09 01:28:56,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:56,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347684353] [2025-03-09 01:28:56,142 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:28:56,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:56,146 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:28:56,151 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:28:56,151 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:56,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:56,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:56,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347684353] [2025-03-09 01:28:56,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347684353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:56,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:56,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:28:56,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267990674] [2025-03-09 01:28:56,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:56,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:28:56,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:56,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:28:56,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:28:56,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-09 01:28:56,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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:28:56,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:56,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-09 01:28:56,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:56,482 INFO L124 PetriNetUnfolderBase]: 1151/2032 cut-off events. [2025-03-09 01:28:56,482 INFO L125 PetriNetUnfolderBase]: For 1604/1604 co-relation queries the response was YES. [2025-03-09 01:28:56,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5302 conditions, 2032 events. 1151/2032 cut-off events. For 1604/1604 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10534 event pairs, 134 based on Foata normal form. 104/2093 useless extension candidates. Maximal degree in co-relation 4711. Up to 538 conditions per place. [2025-03-09 01:28:56,502 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 64 selfloop transitions, 5 changer transitions 18/95 dead transitions. [2025-03-09 01:28:56,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 95 transitions, 549 flow [2025-03-09 01:28:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:28:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:28:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2025-03-09 01:28:56,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5381944444444444 [2025-03-09 01:28:56,505 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 183 flow. Second operand 6 states and 155 transitions. [2025-03-09 01:28:56,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 95 transitions, 549 flow [2025-03-09 01:28:56,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 95 transitions, 531 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:28:56,507 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 161 flow [2025-03-09 01:28:56,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2025-03-09 01:28:56,507 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2025-03-09 01:28:56,508 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 161 flow [2025-03-09 01:28:56,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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:28:56,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:56,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:56,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:28:56,508 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:28:56,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:56,508 INFO L85 PathProgramCache]: Analyzing trace with hash -606800620, now seen corresponding path program 1 times [2025-03-09 01:28:56,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:56,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084841005] [2025-03-09 01:28:56,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:56,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:56,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:28:56,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:28:56,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:56,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:57,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:57,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084841005] [2025-03-09 01:28:57,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084841005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:57,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86110008] [2025-03-09 01:28:57,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:57,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:57,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:57,109 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:28:57,111 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:28:57,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:28:57,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:28:57,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:57,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:57,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 01:28:57,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:57,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2025-03-09 01:28:57,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:28:57,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:58,115 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 61 treesize of output 55 [2025-03-09 01:28:58,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:28:58,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 78 treesize of output 68 [2025-03-09 01:28:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:28:58,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86110008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:58,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:58,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2025-03-09 01:28:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654733293] [2025-03-09 01:28:58,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:58,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-09 01:28:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:58,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 01:28:58,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2025-03-09 01:28:58,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-03-09 01:28:58,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 161 flow. Second operand has 30 states, 30 states have (on average 13.366666666666667) internal successors, (401), 30 states have internal predecessors, (401), 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:28:58,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:58,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-03-09 01:28:58,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:00,555 INFO L124 PetriNetUnfolderBase]: 5597/8710 cut-off events. [2025-03-09 01:29:00,555 INFO L125 PetriNetUnfolderBase]: For 11112/11112 co-relation queries the response was YES. [2025-03-09 01:29:00,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25535 conditions, 8710 events. 5597/8710 cut-off events. For 11112/11112 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 51240 event pairs, 559 based on Foata normal form. 136/8426 useless extension candidates. Maximal degree in co-relation 14567. Up to 2017 conditions per place. [2025-03-09 01:29:00,580 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 256 selfloop transitions, 79 changer transitions 53/393 dead transitions. [2025-03-09 01:29:00,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 393 transitions, 2414 flow [2025-03-09 01:29:00,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-09 01:29:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-09 01:29:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 818 transitions. [2025-03-09 01:29:00,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41565040650406504 [2025-03-09 01:29:00,583 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 161 flow. Second operand 41 states and 818 transitions. [2025-03-09 01:29:00,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 393 transitions, 2414 flow [2025-03-09 01:29:00,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 393 transitions, 2173 flow, removed 35 selfloop flow, removed 11 redundant places. [2025-03-09 01:29:00,592 INFO L231 Difference]: Finished difference. Result has 107 places, 127 transitions, 827 flow [2025-03-09 01:29:00,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=827, PETRI_PLACES=107, PETRI_TRANSITIONS=127} [2025-03-09 01:29:00,593 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 57 predicate places. [2025-03-09 01:29:00,593 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 127 transitions, 827 flow [2025-03-09 01:29:00,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 13.366666666666667) internal successors, (401), 30 states have internal predecessors, (401), 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:29:00,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:00,594 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:00,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:29:00,794 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,SelfDestructingSolverStorable12 [2025-03-09 01:29:00,795 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:29:00,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:00,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1826522758, now seen corresponding path program 1 times [2025-03-09 01:29:00,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:00,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119259890] [2025-03-09 01:29:00,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:00,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:29:00,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:29:00,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:00,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:29:00,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:00,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119259890] [2025-03-09 01:29:00,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119259890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:00,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:00,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:29:00,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079869294] [2025-03-09 01:29:00,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:00,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:29:00,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:00,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:29:00,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:29:00,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2025-03-09 01:29:00,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 127 transitions, 827 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:29:00,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:00,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2025-03-09 01:29:00,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:01,146 INFO L124 PetriNetUnfolderBase]: 2265/3706 cut-off events. [2025-03-09 01:29:01,147 INFO L125 PetriNetUnfolderBase]: For 11192/11192 co-relation queries the response was YES. [2025-03-09 01:29:01,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13530 conditions, 3706 events. 2265/3706 cut-off events. For 11192/11192 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 19429 event pairs, 959 based on Foata normal form. 24/3729 useless extension candidates. Maximal degree in co-relation 12193. Up to 2987 conditions per place. [2025-03-09 01:29:01,162 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 134 selfloop transitions, 4 changer transitions 0/144 dead transitions. [2025-03-09 01:29:01,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 144 transitions, 1233 flow [2025-03-09 01:29:01,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:29:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:29:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-03-09 01:29:01,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-09 01:29:01,163 INFO L175 Difference]: Start difference. First operand has 107 places, 127 transitions, 827 flow. Second operand 3 states and 78 transitions. [2025-03-09 01:29:01,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 144 transitions, 1233 flow [2025-03-09 01:29:01,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 144 transitions, 1064 flow, removed 57 selfloop flow, removed 7 redundant places. [2025-03-09 01:29:01,191 INFO L231 Difference]: Finished difference. Result has 103 places, 123 transitions, 677 flow [2025-03-09 01:29:01,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=677, PETRI_PLACES=103, PETRI_TRANSITIONS=123} [2025-03-09 01:29:01,192 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 53 predicate places. [2025-03-09 01:29:01,192 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 123 transitions, 677 flow [2025-03-09 01:29:01,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:29:01,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:01,192 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:01,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:29:01,192 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:29:01,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash -34637395, now seen corresponding path program 2 times [2025-03-09 01:29:01,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:01,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269838878] [2025-03-09 01:29:01,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:29:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:01,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 01:29:01,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:29:01,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:29:01,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:29:01,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:01,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269838878] [2025-03-09 01:29:01,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269838878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:01,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:01,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:29:01,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650792546] [2025-03-09 01:29:01,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:01,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:29:01,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:01,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:29:01,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:29:01,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-09 01:29:01,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 123 transitions, 677 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:29:01,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:01,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-09 01:29:01,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:01,699 INFO L124 PetriNetUnfolderBase]: 2835/5054 cut-off events. [2025-03-09 01:29:01,699 INFO L125 PetriNetUnfolderBase]: For 17290/17322 co-relation queries the response was YES. [2025-03-09 01:29:01,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17995 conditions, 5054 events. 2835/5054 cut-off events. For 17290/17322 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 30605 event pairs, 856 based on Foata normal form. 178/5195 useless extension candidates. Maximal degree in co-relation 7631. Up to 2219 conditions per place. [2025-03-09 01:29:01,722 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 136 selfloop transitions, 39 changer transitions 0/195 dead transitions. [2025-03-09 01:29:01,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 195 transitions, 1460 flow [2025-03-09 01:29:01,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:29:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:29:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-09 01:29:01,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-09 01:29:01,723 INFO L175 Difference]: Start difference. First operand has 103 places, 123 transitions, 677 flow. Second operand 4 states and 116 transitions. [2025-03-09 01:29:01,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 195 transitions, 1460 flow [2025-03-09 01:29:01,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 195 transitions, 1454 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:29:01,744 INFO L231 Difference]: Finished difference. Result has 107 places, 156 transitions, 1107 flow [2025-03-09 01:29:01,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1107, PETRI_PLACES=107, PETRI_TRANSITIONS=156} [2025-03-09 01:29:01,744 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 57 predicate places. [2025-03-09 01:29:01,744 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 156 transitions, 1107 flow [2025-03-09 01:29:01,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:29:01,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:01,745 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:01,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:29:01,745 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:29:01,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:01,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1138883068, now seen corresponding path program 3 times [2025-03-09 01:29:01,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:01,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055022735] [2025-03-09 01:29:01,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:29:01,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:01,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 6 equivalence classes. [2025-03-09 01:29:01,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 38 statements. [2025-03-09 01:29:01,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:29:01,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 01:29:01,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:01,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055022735] [2025-03-09 01:29:01,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055022735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:01,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:01,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:29:01,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578569029] [2025-03-09 01:29:01,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:01,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:29:01,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:01,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:29:01,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:29:01,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-09 01:29:01,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 156 transitions, 1107 flow. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 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:29:01,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:01,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-09 01:29:01,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:02,562 INFO L124 PetriNetUnfolderBase]: 4357/7705 cut-off events. [2025-03-09 01:29:02,562 INFO L125 PetriNetUnfolderBase]: For 37003/37103 co-relation queries the response was YES. [2025-03-09 01:29:02,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30323 conditions, 7705 events. 4357/7705 cut-off events. For 37003/37103 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 50037 event pairs, 400 based on Foata normal form. 268/7921 useless extension candidates. Maximal degree in co-relation 12186. Up to 1852 conditions per place. [2025-03-09 01:29:02,595 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 223 selfloop transitions, 36 changer transitions 50/329 dead transitions. [2025-03-09 01:29:02,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 329 transitions, 3196 flow [2025-03-09 01:29:02,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:29:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:29:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2025-03-09 01:29:02,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49537037037037035 [2025-03-09 01:29:02,597 INFO L175 Difference]: Start difference. First operand has 107 places, 156 transitions, 1107 flow. Second operand 9 states and 214 transitions. [2025-03-09 01:29:02,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 329 transitions, 3196 flow [2025-03-09 01:29:02,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 329 transitions, 3100 flow, removed 48 selfloop flow, removed 0 redundant places. [2025-03-09 01:29:02,630 INFO L231 Difference]: Finished difference. Result has 117 places, 169 transitions, 1346 flow [2025-03-09 01:29:02,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1346, PETRI_PLACES=117, PETRI_TRANSITIONS=169} [2025-03-09 01:29:02,631 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 67 predicate places. [2025-03-09 01:29:02,631 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 169 transitions, 1346 flow [2025-03-09 01:29:02,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 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:29:02,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:02,631 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:02,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:29:02,631 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:29:02,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:02,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1158410065, now seen corresponding path program 4 times [2025-03-09 01:29:02,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:02,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33550020] [2025-03-09 01:29:02,632 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:29:02,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:02,638 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-09 01:29:02,662 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:29:02,663 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:29:02,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:29:02,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:02,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33550020] [2025-03-09 01:29:02,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33550020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:02,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:02,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:29:02,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559704241] [2025-03-09 01:29:02,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:02,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:29:02,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:02,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:29:02,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:29:02,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-03-09 01:29:02,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 169 transitions, 1346 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:29:02,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:02,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-03-09 01:29:02,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:03,584 INFO L124 PetriNetUnfolderBase]: 5059/8266 cut-off events. [2025-03-09 01:29:03,584 INFO L125 PetriNetUnfolderBase]: For 33954/33954 co-relation queries the response was YES. [2025-03-09 01:29:03,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32996 conditions, 8266 events. 5059/8266 cut-off events. For 33954/33954 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 47545 event pairs, 1123 based on Foata normal form. 488/8753 useless extension candidates. Maximal degree in co-relation 30323. Up to 4063 conditions per place. [2025-03-09 01:29:03,629 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 161 selfloop transitions, 6 changer transitions 1/173 dead transitions. [2025-03-09 01:29:03,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 173 transitions, 1797 flow [2025-03-09 01:29:03,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:29:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:29:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-03-09 01:29:03,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2025-03-09 01:29:03,630 INFO L175 Difference]: Start difference. First operand has 117 places, 169 transitions, 1346 flow. Second operand 4 states and 95 transitions. [2025-03-09 01:29:03,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 173 transitions, 1797 flow [2025-03-09 01:29:03,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 173 transitions, 1694 flow, removed 26 selfloop flow, removed 11 redundant places. [2025-03-09 01:29:03,693 INFO L231 Difference]: Finished difference. Result has 102 places, 130 transitions, 1038 flow [2025-03-09 01:29:03,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1038, PETRI_PLACES=102, PETRI_TRANSITIONS=130} [2025-03-09 01:29:03,693 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 52 predicate places. [2025-03-09 01:29:03,693 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 130 transitions, 1038 flow [2025-03-09 01:29:03,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:29:03,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:03,694 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:03,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:29:03,694 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:29:03,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:03,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1819100179, now seen corresponding path program 1 times [2025-03-09 01:29:03,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:03,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292146696] [2025-03-09 01:29:03,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:03,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:03,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:29:03,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:29:03,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:03,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:04,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:04,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292146696] [2025-03-09 01:29:04,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292146696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:04,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097949823] [2025-03-09 01:29:04,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:29:04,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:04,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:04,445 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:29:04,446 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:29:04,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:29:04,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:29:04,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:04,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:04,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-09 01:29:04,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:04,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:05,263 INFO L349 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2025-03-09 01:29:05,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 50 [2025-03-09 01:29:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:05,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097949823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:05,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:05,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-03-09 01:29:05,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167300155] [2025-03-09 01:29:05,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:05,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-09 01:29:05,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:05,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-09 01:29:05,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 01:29:05,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48 [2025-03-09 01:29:05,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 130 transitions, 1038 flow. Second operand has 37 states, 37 states have (on average 13.81081081081081) internal successors, (511), 37 states have internal predecessors, (511), 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:29:05,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:05,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48 [2025-03-09 01:29:05,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:10,174 INFO L124 PetriNetUnfolderBase]: 11833/19168 cut-off events. [2025-03-09 01:29:10,174 INFO L125 PetriNetUnfolderBase]: For 63973/63973 co-relation queries the response was YES. [2025-03-09 01:29:10,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72969 conditions, 19168 events. 11833/19168 cut-off events. For 63973/63973 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 123416 event pairs, 903 based on Foata normal form. 580/19747 useless extension candidates. Maximal degree in co-relation 68815. Up to 3153 conditions per place. [2025-03-09 01:29:10,277 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 521 selfloop transitions, 230 changer transitions 114/870 dead transitions. [2025-03-09 01:29:10,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 870 transitions, 7159 flow [2025-03-09 01:29:10,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-03-09 01:29:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2025-03-09 01:29:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 1606 transitions. [2025-03-09 01:29:10,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39362745098039215 [2025-03-09 01:29:10,283 INFO L175 Difference]: Start difference. First operand has 102 places, 130 transitions, 1038 flow. Second operand 85 states and 1606 transitions. [2025-03-09 01:29:10,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 870 transitions, 7159 flow [2025-03-09 01:29:10,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 870 transitions, 7076 flow, removed 37 selfloop flow, removed 2 redundant places. [2025-03-09 01:29:10,357 INFO L231 Difference]: Finished difference. Result has 207 places, 295 transitions, 3207 flow [2025-03-09 01:29:10,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=3207, PETRI_PLACES=207, PETRI_TRANSITIONS=295} [2025-03-09 01:29:10,358 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 157 predicate places. [2025-03-09 01:29:10,358 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 295 transitions, 3207 flow [2025-03-09 01:29:10,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 13.81081081081081) internal successors, (511), 37 states have internal predecessors, (511), 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:29:10,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:10,358 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:10,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:29:10,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:29:10,559 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:29:10,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:10,559 INFO L85 PathProgramCache]: Analyzing trace with hash -515462039, now seen corresponding path program 2 times [2025-03-09 01:29:10,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:10,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096100748] [2025-03-09 01:29:10,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:29:10,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:10,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 01:29:10,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:29:10,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:29:10,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:11,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:11,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096100748] [2025-03-09 01:29:11,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096100748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:11,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218214988] [2025-03-09 01:29:11,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:29:11,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:11,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:11,106 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:29:11,108 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:29:11,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 01:29:11,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:29:11,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:29:11,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:11,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-09 01:29:11,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:11,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2025-03-09 01:29:11,823 INFO L349 Elim1Store]: treesize reduction 42, result has 14.3 percent of original size [2025-03-09 01:29:11,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 20 [2025-03-09 01:29:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:11,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:13,307 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 174 treesize of output 160 [2025-03-09 01:29:13,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:29:13,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 280 treesize of output 334 [2025-03-09 01:30:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:30:06,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218214988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:06,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:06,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2025-03-09 01:30:06,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016714341] [2025-03-09 01:30:06,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:06,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-09 01:30:06,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:06,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-09 01:30:06,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1205, Unknown=0, NotChecked=0, Total=1482 [2025-03-09 01:30:07,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-09 01:30:07,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 295 transitions, 3207 flow. Second operand has 39 states, 39 states have (on average 15.35897435897436) internal successors, (599), 39 states have internal predecessors, (599), 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:30:07,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:07,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-09 01:30:07,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand