./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-sorted.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-more-sorted.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 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:27:18,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:27:18,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:27:18,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:27:18,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:27:18,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:27:18,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:27:18,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:27:18,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:27:18,959 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:27:18,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:27:18,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:27:18,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:27:18,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:27:18,959 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:27:18,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:27:18,959 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:27:18,959 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:27:18,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:27:18,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:27:18,959 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:27:18,959 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:27:18,960 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:27:18,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:27:18,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:27:18,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:27:18,961 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 -> 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 [2025-03-09 01:27:19,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:27:19,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:27:19,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:27:19,224 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:27:19,224 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:27:19,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-03-09 01:27:20,367 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9beb36b41/aa2ab36bada8473180ffae21f0ee900e/FLAGbdde229ce [2025-03-09 01:27:20,655 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:27:20,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-03-09 01:27:20,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9beb36b41/aa2ab36bada8473180ffae21f0ee900e/FLAGbdde229ce [2025-03-09 01:27:20,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9beb36b41/aa2ab36bada8473180ffae21f0ee900e [2025-03-09 01:27:20,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:27:20,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:27:20,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:27:20,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:27:20,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:27:20,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:27:20" (1/1) ... [2025-03-09 01:27:20,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e365b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:20, skipping insertion in model container [2025-03-09 01:27:20,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:27:20" (1/1) ... [2025-03-09 01:27:20,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:27:20,837 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:27:20,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:27:20,851 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:27:20,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:27:20,889 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:27:20,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:20 WrapperNode [2025-03-09 01:27:20,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:27:20,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:27:20,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:27:20,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:27:20,896 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:27:20" (1/1) ... [2025-03-09 01:27:20,902 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:27:20" (1/1) ... [2025-03-09 01:27:20,916 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2025-03-09 01:27:20,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:27:20,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:27:20,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:27:20,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:27:20,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:20" (1/1) ... [2025-03-09 01:27:20,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:20" (1/1) ... [2025-03-09 01:27:20,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:20" (1/1) ... [2025-03-09 01:27:20,933 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 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:27:20,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:20" (1/1) ... [2025-03-09 01:27:20,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:20" (1/1) ... [2025-03-09 01:27:20,939 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:20" (1/1) ... [2025-03-09 01:27:20,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:20" (1/1) ... [2025-03-09 01:27:20,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:20" (1/1) ... [2025-03-09 01:27:20,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:20" (1/1) ... [2025-03-09 01:27:20,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:27:20,943 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:27:20,943 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:27:20,944 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:27:20,944 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:20" (1/1) ... [2025-03-09 01:27:20,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:27:20,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:20,966 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:27:20,968 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:27:20,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:27:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:27:20,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:27:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:27:20,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:27:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:27:20,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:27:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:27:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:27:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:27:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:27:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:27:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:27:20,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:27:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:27:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:27:20,984 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:27:21,066 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:27:21,068 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:27:21,345 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:27:21,346 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:27:21,483 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:27:21,483 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:27:21,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:27:21 BoogieIcfgContainer [2025-03-09 01:27:21,483 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:27:21,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:27:21,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:27:21,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:27:21,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:27:20" (1/3) ... [2025-03-09 01:27:21,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6c961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:27:21, skipping insertion in model container [2025-03-09 01:27:21,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:20" (2/3) ... [2025-03-09 01:27:21,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6c961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:27:21, skipping insertion in model container [2025-03-09 01:27:21,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:27:21" (3/3) ... [2025-03-09 01:27:21,490 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2025-03-09 01:27:21,502 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:27:21,503 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sorted.wvr.c that has 4 procedures, 53 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-03-09 01:27:21,503 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:27:21,563 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:27:21,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions, 139 flow [2025-03-09 01:27:21,623 INFO L124 PetriNetUnfolderBase]: 7/56 cut-off events. [2025-03-09 01:27:21,626 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:27:21,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 56 events. 7/56 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-03-09 01:27:21,633 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 59 transitions, 139 flow [2025-03-09 01:27:21,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 55 transitions, 128 flow [2025-03-09 01:27:21,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:27:21,654 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;@7171789, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:27:21,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-09 01:27:21,657 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:27:21,657 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:27:21,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:27:21,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:21,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:27:21,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:21,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash 395052, now seen corresponding path program 1 times [2025-03-09 01:27:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:21,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635757571] [2025-03-09 01:27:21,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:21,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:27:21,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:27:21,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:21,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:21,830 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:27:21,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:21,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635757571] [2025-03-09 01:27:21,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635757571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:21,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:21,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:27:21,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707627892] [2025-03-09 01:27:21,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:21,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:27:21,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:21,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:27:21,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:27:21,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2025-03-09 01:27:21,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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:27:21,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:21,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2025-03-09 01:27:21,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:22,148 INFO L124 PetriNetUnfolderBase]: 801/1520 cut-off events. [2025-03-09 01:27:22,149 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-03-09 01:27:22,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1520 events. 801/1520 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 8924 event pairs, 478 based on Foata normal form. 1/1082 useless extension candidates. Maximal degree in co-relation 2454. Up to 1082 conditions per place. [2025-03-09 01:27:22,165 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-03-09 01:27:22,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 180 flow [2025-03-09 01:27:22,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:27:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:27:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-03-09 01:27:22,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.632768361581921 [2025-03-09 01:27:22,177 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 128 flow. Second operand 3 states and 112 transitions. [2025-03-09 01:27:22,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 180 flow [2025-03-09 01:27:22,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 168 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:27:22,186 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 114 flow [2025-03-09 01:27:22,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2025-03-09 01:27:22,191 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2025-03-09 01:27:22,191 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 114 flow [2025-03-09 01:27:22,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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:27:22,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:22,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:27:22,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:27:22,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:22,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:22,192 INFO L85 PathProgramCache]: Analyzing trace with hash 395053, now seen corresponding path program 1 times [2025-03-09 01:27:22,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:22,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699038677] [2025-03-09 01:27:22,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:22,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:22,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:27:22,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:27:22,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:22,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:22,457 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:27:22,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:22,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699038677] [2025-03-09 01:27:22,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699038677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:22,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:22,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:27:22,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703643325] [2025-03-09 01:27:22,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:22,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:27:22,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:22,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:27:22,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:27:22,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2025-03-09 01:27:22,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:27:22,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:22,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2025-03-09 01:27:22,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:22,674 INFO L124 PetriNetUnfolderBase]: 802/1523 cut-off events. [2025-03-09 01:27:22,674 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 01:27:22,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2642 conditions, 1523 events. 802/1523 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 8977 event pairs, 478 based on Foata normal form. 0/1084 useless extension candidates. Maximal degree in co-relation 2620. Up to 1087 conditions per place. [2025-03-09 01:27:22,683 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 29 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2025-03-09 01:27:22,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 55 transitions, 188 flow [2025-03-09 01:27:22,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:27:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:27:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-03-09 01:27:22,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6016949152542372 [2025-03-09 01:27:22,688 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 114 flow. Second operand 4 states and 142 transitions. [2025-03-09 01:27:22,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 55 transitions, 188 flow [2025-03-09 01:27:22,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:22,691 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 137 flow [2025-03-09 01:27:22,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2025-03-09 01:27:22,691 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2025-03-09 01:27:22,691 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 137 flow [2025-03-09 01:27:22,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:27:22,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:22,692 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:27:22,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:27:22,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:22,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:22,693 INFO L85 PathProgramCache]: Analyzing trace with hash 379658508, now seen corresponding path program 1 times [2025-03-09 01:27:22,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:22,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844639500] [2025-03-09 01:27:22,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:22,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:22,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:27:22,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:27:22,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:22,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:22,930 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:27:22,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:22,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844639500] [2025-03-09 01:27:22,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844639500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:22,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209254964] [2025-03-09 01:27:22,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:22,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:22,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:22,934 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:27:22,935 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:27:22,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:27:22,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:27:22,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:22,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:22,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:27:22,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:23,031 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 10 treesize of output 9 [2025-03-09 01:27:23,193 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:27:23,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:23,284 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:27:23,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209254964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:23,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:23,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:27:23,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578952871] [2025-03-09 01:27:23,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:23,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:23,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:23,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:23,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:23,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2025-03-09 01:27:23,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 137 flow. Second operand has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 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:27:23,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:23,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2025-03-09 01:27:23,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:23,752 INFO L124 PetriNetUnfolderBase]: 802/1522 cut-off events. [2025-03-09 01:27:23,752 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 01:27:23,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2649 conditions, 1522 events. 802/1522 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 8939 event pairs, 478 based on Foata normal form. 0/1083 useless extension candidates. Maximal degree in co-relation 2627. Up to 1083 conditions per place. [2025-03-09 01:27:23,761 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 25 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2025-03-09 01:27:23,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 197 flow [2025-03-09 01:27:23,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:27:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:27:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2025-03-09 01:27:23,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5508474576271186 [2025-03-09 01:27:23,763 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 137 flow. Second operand 6 states and 195 transitions. [2025-03-09 01:27:23,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 197 flow [2025-03-09 01:27:23,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:27:23,764 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 144 flow [2025-03-09 01:27:23,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2025-03-09 01:27:23,764 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2025-03-09 01:27:23,764 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 144 flow [2025-03-09 01:27:23,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 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:27:23,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:23,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:23,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:27:23,965 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:27:23,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:23,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:23,966 INFO L85 PathProgramCache]: Analyzing trace with hash -131012365, now seen corresponding path program 1 times [2025-03-09 01:27:23,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:23,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599889451] [2025-03-09 01:27:23,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:23,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:27:23,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:27:23,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:23,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:24,025 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:27:24,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:24,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599889451] [2025-03-09 01:27:24,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599889451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:24,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:24,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:27:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790374731] [2025-03-09 01:27:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:24,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:27:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:24,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:27:24,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:27:24,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2025-03-09 01:27:24,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 144 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:27:24,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:24,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2025-03-09 01:27:24,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:24,225 INFO L124 PetriNetUnfolderBase]: 1371/2153 cut-off events. [2025-03-09 01:27:24,225 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-09 01:27:24,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4074 conditions, 2153 events. 1371/2153 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10462 event pairs, 893 based on Foata normal form. 0/1809 useless extension candidates. Maximal degree in co-relation 4048. Up to 1859 conditions per place. [2025-03-09 01:27:24,236 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 32 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-03-09 01:27:24,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 202 flow [2025-03-09 01:27:24,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:27:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:27:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-09 01:27:24,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4661016949152542 [2025-03-09 01:27:24,239 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 144 flow. Second operand 4 states and 110 transitions. [2025-03-09 01:27:24,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 202 flow [2025-03-09 01:27:24,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 172 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-09 01:27:24,242 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 108 flow [2025-03-09 01:27:24,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2025-03-09 01:27:24,243 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -11 predicate places. [2025-03-09 01:27:24,243 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 108 flow [2025-03-09 01:27:24,243 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:27:24,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:24,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:24,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:27:24,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:24,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:24,243 INFO L85 PathProgramCache]: Analyzing trace with hash -131012364, now seen corresponding path program 1 times [2025-03-09 01:27:24,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:24,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290776800] [2025-03-09 01:27:24,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:24,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:24,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:27:24,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:27:24,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:24,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:24,291 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:27:24,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:24,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290776800] [2025-03-09 01:27:24,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290776800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:24,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:24,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:27:24,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155428217] [2025-03-09 01:27:24,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:24,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:27:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:24,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:27:24,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:27:24,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-09 01:27:24,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:27:24,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:24,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-09 01:27:24,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:24,419 INFO L124 PetriNetUnfolderBase]: 801/1397 cut-off events. [2025-03-09 01:27:24,419 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 01:27:24,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2513 conditions, 1397 events. 801/1397 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7303 event pairs, 478 based on Foata normal form. 1/1084 useless extension candidates. Maximal degree in co-relation 2496. Up to 1085 conditions per place. [2025-03-09 01:27:24,425 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 29 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2025-03-09 01:27:24,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 166 flow [2025-03-09 01:27:24,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:27:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:27:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-09 01:27:24,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2025-03-09 01:27:24,427 INFO L175 Difference]: Start difference. First operand has 47 places, 48 transitions, 108 flow. Second operand 3 states and 116 transitions. [2025-03-09 01:27:24,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 166 flow [2025-03-09 01:27:24,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 163 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:24,428 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 105 flow [2025-03-09 01:27:24,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-03-09 01:27:24,429 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -11 predicate places. [2025-03-09 01:27:24,429 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 105 flow [2025-03-09 01:27:24,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:27:24,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:24,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:24,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:27:24,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:24,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:24,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1243743405, now seen corresponding path program 1 times [2025-03-09 01:27:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938899494] [2025-03-09 01:27:24,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:24,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:24,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:27:24,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:27:24,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:24,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:24,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:24,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938899494] [2025-03-09 01:27:24,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938899494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:24,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363025827] [2025-03-09 01:27:24,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:24,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:24,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:24,509 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:27:24,510 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:27:24,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:27:24,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:27:24,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:24,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:24,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:27:24,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:24,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:24,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363025827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:24,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:24,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:27:24,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354104105] [2025-03-09 01:27:24,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:24,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:27:24,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:24,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:27:24,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:27:24,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-09 01:27:24,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 105 flow. Second operand has 12 states, 12 states have (on average 29.583333333333332) internal successors, (355), 12 states have internal predecessors, (355), 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:27:24,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:24,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-09 01:27:24,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:24,931 INFO L124 PetriNetUnfolderBase]: 1258/2172 cut-off events. [2025-03-09 01:27:24,931 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-09 01:27:24,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3961 conditions, 2172 events. 1258/2172 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12177 event pairs, 664 based on Foata normal form. 0/1736 useless extension candidates. Maximal degree in co-relation 3950. Up to 1084 conditions per place. [2025-03-09 01:27:24,938 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 63 selfloop transitions, 8 changer transitions 0/87 dead transitions. [2025-03-09 01:27:24,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 336 flow [2025-03-09 01:27:24,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:27:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:27:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 268 transitions. [2025-03-09 01:27:24,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.648910411622276 [2025-03-09 01:27:24,940 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 105 flow. Second operand 7 states and 268 transitions. [2025-03-09 01:27:24,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 336 flow [2025-03-09 01:27:24,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:24,941 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 150 flow [2025-03-09 01:27:24,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=150, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2025-03-09 01:27:24,942 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-03-09 01:27:24,942 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 150 flow [2025-03-09 01:27:24,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 29.583333333333332) internal successors, (355), 12 states have internal predecessors, (355), 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:27:24,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:24,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:24,948 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:27:25,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 01:27:25,147 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:25,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1545596731, now seen corresponding path program 1 times [2025-03-09 01:27:25,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:25,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221636488] [2025-03-09 01:27:25,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:25,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:27:25,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:27:25,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:25,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:25,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:25,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221636488] [2025-03-09 01:27:25,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221636488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:25,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543441693] [2025-03-09 01:27:25,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:25,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:25,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:25,226 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:27:25,228 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:27:25,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:27:25,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:27:25,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:25,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:25,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:27:25,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:25,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:25,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543441693] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:25,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:25,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 01:27:25,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698397314] [2025-03-09 01:27:25,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:25,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:27:25,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:25,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:27:25,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:27:25,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-09 01:27:25,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 150 flow. Second operand has 13 states, 13 states have (on average 29.846153846153847) internal successors, (388), 13 states have internal predecessors, (388), 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:27:25,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:25,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-09 01:27:25,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:25,704 INFO L124 PetriNetUnfolderBase]: 1023/1811 cut-off events. [2025-03-09 01:27:25,704 INFO L125 PetriNetUnfolderBase]: For 322/322 co-relation queries the response was YES. [2025-03-09 01:27:25,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 1811 events. 1023/1811 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10023 event pairs, 578 based on Foata normal form. 0/1442 useless extension candidates. Maximal degree in co-relation 2649. Up to 1081 conditions per place. [2025-03-09 01:27:25,712 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 56 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2025-03-09 01:27:25,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 350 flow [2025-03-09 01:27:25,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:27:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:27:25,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 261 transitions. [2025-03-09 01:27:25,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6319612590799032 [2025-03-09 01:27:25,715 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 150 flow. Second operand 7 states and 261 transitions. [2025-03-09 01:27:25,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 350 flow [2025-03-09 01:27:25,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:27:25,717 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 179 flow [2025-03-09 01:27:25,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=179, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2025-03-09 01:27:25,717 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2025-03-09 01:27:25,717 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 179 flow [2025-03-09 01:27:25,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 29.846153846153847) internal successors, (388), 13 states have internal predecessors, (388), 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:27:25,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:25,717 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:25,725 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:27:25,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:25,919 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:25,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1131417102, now seen corresponding path program 2 times [2025-03-09 01:27:25,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:25,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858750859] [2025-03-09 01:27:25,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:25,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 01:27:25,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 11 statements. [2025-03-09 01:27:25,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:27:25,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:27:26,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:26,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858750859] [2025-03-09 01:27:26,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858750859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:26,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:26,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:27:26,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440964862] [2025-03-09 01:27:26,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:26,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:27:26,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:26,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:27:26,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:27:26,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-09 01:27:26,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 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:27:26,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:26,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-09 01:27:26,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:26,429 INFO L124 PetriNetUnfolderBase]: 1747/2981 cut-off events. [2025-03-09 01:27:26,430 INFO L125 PetriNetUnfolderBase]: For 642/642 co-relation queries the response was YES. [2025-03-09 01:27:26,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6295 conditions, 2981 events. 1747/2981 cut-off events. For 642/642 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17234 event pairs, 691 based on Foata normal form. 62/2387 useless extension candidates. Maximal degree in co-relation 5197. Up to 1747 conditions per place. [2025-03-09 01:27:26,448 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 67 selfloop transitions, 9 changer transitions 0/90 dead transitions. [2025-03-09 01:27:26,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 431 flow [2025-03-09 01:27:26,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:27:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:27:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2025-03-09 01:27:26,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6299435028248588 [2025-03-09 01:27:26,450 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 179 flow. Second operand 6 states and 223 transitions. [2025-03-09 01:27:26,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 431 flow [2025-03-09 01:27:26,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 420 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:27:26,454 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 213 flow [2025-03-09 01:27:26,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2025-03-09 01:27:26,459 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2025-03-09 01:27:26,459 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 213 flow [2025-03-09 01:27:26,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 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:27:26,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:26,459 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:26,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:27:26,459 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:26,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:26,460 INFO L85 PathProgramCache]: Analyzing trace with hash -974201948, now seen corresponding path program 2 times [2025-03-09 01:27:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:26,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335203666] [2025-03-09 01:27:26,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:26,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:26,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:27:26,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-09 01:27:26,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:27:26,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:27:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:26,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335203666] [2025-03-09 01:27:26,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335203666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:26,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:26,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:27:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140300207] [2025-03-09 01:27:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:26,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:27:26,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:26,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:27:26,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:27:26,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-09 01:27:26,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 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:27:26,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:26,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-09 01:27:26,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:27,090 INFO L124 PetriNetUnfolderBase]: 2787/4654 cut-off events. [2025-03-09 01:27:27,090 INFO L125 PetriNetUnfolderBase]: For 2838/2910 co-relation queries the response was YES. [2025-03-09 01:27:27,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11024 conditions, 4654 events. 2787/4654 cut-off events. For 2838/2910 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 28566 event pairs, 1116 based on Foata normal form. 101/3861 useless extension candidates. Maximal degree in co-relation 9823. Up to 2697 conditions per place. [2025-03-09 01:27:27,112 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 74 selfloop transitions, 9 changer transitions 0/97 dead transitions. [2025-03-09 01:27:27,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 539 flow [2025-03-09 01:27:27,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:27:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:27:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2025-03-09 01:27:27,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6242937853107344 [2025-03-09 01:27:27,114 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 213 flow. Second operand 6 states and 221 transitions. [2025-03-09 01:27:27,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 539 flow [2025-03-09 01:27:27,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 508 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-09 01:27:27,119 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 243 flow [2025-03-09 01:27:27,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2025-03-09 01:27:27,120 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2025-03-09 01:27:27,121 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 243 flow [2025-03-09 01:27:27,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 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:27:27,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:27,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:27,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:27:27,121 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:27,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash -67567845, now seen corresponding path program 1 times [2025-03-09 01:27:27,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:27,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804200467] [2025-03-09 01:27:27,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:27,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:27:27,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:27:27,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:27,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:27,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:27,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804200467] [2025-03-09 01:27:27,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804200467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:27,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211049385] [2025-03-09 01:27:27,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:27,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:27,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:27,214 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:27:27,215 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:27:27,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:27:27,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:27:27,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:27,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:27,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:27:27,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:27,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:27,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211049385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:27,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:27,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:27:27,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401481942] [2025-03-09 01:27:27,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:27,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:27:27,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:27,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:27:27,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:27:27,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-09 01:27:27,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 243 flow. Second operand has 12 states, 12 states have (on average 30.166666666666668) internal successors, (362), 12 states have internal predecessors, (362), 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:27:27,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:27,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-09 01:27:27,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:27,741 INFO L124 PetriNetUnfolderBase]: 2173/3912 cut-off events. [2025-03-09 01:27:27,741 INFO L125 PetriNetUnfolderBase]: For 3554/3610 co-relation queries the response was YES. [2025-03-09 01:27:27,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9815 conditions, 3912 events. 2173/3912 cut-off events. For 3554/3610 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25719 event pairs, 1186 based on Foata normal form. 0/3249 useless extension candidates. Maximal degree in co-relation 8981. Up to 2674 conditions per place. [2025-03-09 01:27:27,759 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 55 selfloop transitions, 8 changer transitions 0/79 dead transitions. [2025-03-09 01:27:27,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 441 flow [2025-03-09 01:27:27,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:27:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:27:27,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 254 transitions. [2025-03-09 01:27:27,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6150121065375302 [2025-03-09 01:27:27,761 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 243 flow. Second operand 7 states and 254 transitions. [2025-03-09 01:27:27,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 441 flow [2025-03-09 01:27:27,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 79 transitions, 424 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 01:27:27,767 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 259 flow [2025-03-09 01:27:27,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2025-03-09 01:27:27,767 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2025-03-09 01:27:27,768 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 259 flow [2025-03-09 01:27:27,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.166666666666668) internal successors, (362), 12 states have internal predecessors, (362), 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:27:27,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:27,769 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:27,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:27:27,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:27,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:27,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash 857791958, now seen corresponding path program 1 times [2025-03-09 01:27:27,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:27,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831098781] [2025-03-09 01:27:27,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:27,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:27,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:27:27,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:27:27,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:27,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:28,076 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:27:28,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:28,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831098781] [2025-03-09 01:27:28,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831098781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:28,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244531731] [2025-03-09 01:27:28,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:28,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:28,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:28,079 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:28,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:27:28,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:27:28,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:27:28,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:28,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:28,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:27:28,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:27:28,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:27:28,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244531731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:28,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:28,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-09 01:27:28,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121387177] [2025-03-09 01:27:28,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:28,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:27:28,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:28,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:27:28,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:27:28,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-09 01:27:28,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 259 flow. Second operand has 17 states, 17 states have (on average 29.764705882352942) internal successors, (506), 17 states have internal predecessors, (506), 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:27:28,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:28,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-09 01:27:28,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:28,969 INFO L124 PetriNetUnfolderBase]: 3696/6554 cut-off events. [2025-03-09 01:27:28,970 INFO L125 PetriNetUnfolderBase]: For 4916/5038 co-relation queries the response was YES. [2025-03-09 01:27:28,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16441 conditions, 6554 events. 3696/6554 cut-off events. For 4916/5038 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 45752 event pairs, 1497 based on Foata normal form. 0/5537 useless extension candidates. Maximal degree in co-relation 8896. Up to 2672 conditions per place. [2025-03-09 01:27:29,007 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 104 selfloop transitions, 14 changer transitions 0/134 dead transitions. [2025-03-09 01:27:29,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 134 transitions, 784 flow [2025-03-09 01:27:29,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:27:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:27:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 346 transitions. [2025-03-09 01:27:29,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6516007532956686 [2025-03-09 01:27:29,009 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 259 flow. Second operand 9 states and 346 transitions. [2025-03-09 01:27:29,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 134 transitions, 784 flow [2025-03-09 01:27:29,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 134 transitions, 769 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:27:29,017 INFO L231 Difference]: Finished difference. Result has 83 places, 69 transitions, 346 flow [2025-03-09 01:27:29,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=346, PETRI_PLACES=83, PETRI_TRANSITIONS=69} [2025-03-09 01:27:29,018 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 25 predicate places. [2025-03-09 01:27:29,018 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 346 flow [2025-03-09 01:27:29,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 29.764705882352942) internal successors, (506), 17 states have internal predecessors, (506), 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:27:29,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:29,018 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:29,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:27:29,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 01:27:29,219 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:29,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:29,219 INFO L85 PathProgramCache]: Analyzing trace with hash -712995270, now seen corresponding path program 2 times [2025-03-09 01:27:29,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:29,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747349446] [2025-03-09 01:27:29,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:29,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:29,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 01:27:29,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:27:29,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:29,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:27:29,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:29,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747349446] [2025-03-09 01:27:29,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747349446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:29,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013932230] [2025-03-09 01:27:29,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:29,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:29,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:29,363 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:29,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:27:29,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 01:27:29,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:27:29,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:29,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:29,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:27:29,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:27:29,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:27:29,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013932230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:29,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:27:29,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2025-03-09 01:27:29,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909730175] [2025-03-09 01:27:29,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:29,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:27:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:29,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:27:29,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:27:29,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-09 01:27:29,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 69 transitions, 346 flow. Second operand has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:29,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:29,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-09 01:27:29,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:30,087 INFO L124 PetriNetUnfolderBase]: 3590/6220 cut-off events. [2025-03-09 01:27:30,087 INFO L125 PetriNetUnfolderBase]: For 8220/8278 co-relation queries the response was YES. [2025-03-09 01:27:30,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16998 conditions, 6220 events. 3590/6220 cut-off events. For 8220/8278 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 41906 event pairs, 966 based on Foata normal form. 242/5521 useless extension candidates. Maximal degree in co-relation 12668. Up to 2275 conditions per place. [2025-03-09 01:27:30,121 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 93 selfloop transitions, 10 changer transitions 0/117 dead transitions. [2025-03-09 01:27:30,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 848 flow [2025-03-09 01:27:30,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:27:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:27:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2025-03-09 01:27:30,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6016949152542372 [2025-03-09 01:27:30,122 INFO L175 Difference]: Start difference. First operand has 83 places, 69 transitions, 346 flow. Second operand 6 states and 213 transitions. [2025-03-09 01:27:30,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 848 flow [2025-03-09 01:27:30,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 829 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:30,136 INFO L231 Difference]: Finished difference. Result has 84 places, 67 transitions, 351 flow [2025-03-09 01:27:30,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=84, PETRI_TRANSITIONS=67} [2025-03-09 01:27:30,137 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2025-03-09 01:27:30,137 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 67 transitions, 351 flow [2025-03-09 01:27:30,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:30,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:30,137 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:30,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:27:30,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:30,343 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:30,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:30,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1354864209, now seen corresponding path program 1 times [2025-03-09 01:27:30,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:30,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097554963] [2025-03-09 01:27:30,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:30,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:30,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:27:30,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:27:30,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:30,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:30,465 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:27:30,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:30,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097554963] [2025-03-09 01:27:30,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097554963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:30,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417719270] [2025-03-09 01:27:30,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:30,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:30,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:30,467 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:30,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:27:30,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:27:30,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:27:30,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:30,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:30,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:27:30,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:27:30,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:27:30,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417719270] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:30,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:30,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-09 01:27:30,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475233726] [2025-03-09 01:27:30,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:30,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:27:30,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:30,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:27:30,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:27:30,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-09 01:27:30,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 67 transitions, 351 flow. Second operand has 18 states, 18 states have (on average 29.944444444444443) internal successors, (539), 18 states have internal predecessors, (539), 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:27:30,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:30,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-09 01:27:30,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:31,295 INFO L124 PetriNetUnfolderBase]: 3256/5494 cut-off events. [2025-03-09 01:27:31,296 INFO L125 PetriNetUnfolderBase]: For 7861/7973 co-relation queries the response was YES. [2025-03-09 01:27:31,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16184 conditions, 5494 events. 3256/5494 cut-off events. For 7861/7973 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 34822 event pairs, 1412 based on Foata normal form. 0/4753 useless extension candidates. Maximal degree in co-relation 12096. Up to 2672 conditions per place. [2025-03-09 01:27:31,316 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 96 selfloop transitions, 14 changer transitions 0/124 dead transitions. [2025-03-09 01:27:31,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 124 transitions, 857 flow [2025-03-09 01:27:31,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:27:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:27:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 344 transitions. [2025-03-09 01:27:31,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.647834274952919 [2025-03-09 01:27:31,318 INFO L175 Difference]: Start difference. First operand has 84 places, 67 transitions, 351 flow. Second operand 9 states and 344 transitions. [2025-03-09 01:27:31,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 124 transitions, 857 flow [2025-03-09 01:27:31,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 124 transitions, 809 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:27:31,330 INFO L231 Difference]: Finished difference. Result has 90 places, 71 transitions, 403 flow [2025-03-09 01:27:31,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=403, PETRI_PLACES=90, PETRI_TRANSITIONS=71} [2025-03-09 01:27:31,330 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 32 predicate places. [2025-03-09 01:27:31,330 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 71 transitions, 403 flow [2025-03-09 01:27:31,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 29.944444444444443) internal successors, (539), 18 states have internal predecessors, (539), 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:27:31,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:31,331 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:31,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:27:31,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:31,532 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:31,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:31,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1970589033, now seen corresponding path program 2 times [2025-03-09 01:27:31,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:31,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511157900] [2025-03-09 01:27:31,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:31,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:31,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 01:27:31,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:27:31,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:31,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 01:27:31,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:31,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511157900] [2025-03-09 01:27:31,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511157900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:31,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:31,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:27:31,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324400776] [2025-03-09 01:27:31,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:31,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:27:31,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:31,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:27:31,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:27:31,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-09 01:27:31,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 71 transitions, 403 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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:27:31,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:31,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-09 01:27:31,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:32,262 INFO L124 PetriNetUnfolderBase]: 6600/10183 cut-off events. [2025-03-09 01:27:32,263 INFO L125 PetriNetUnfolderBase]: For 15730/15848 co-relation queries the response was YES. [2025-03-09 01:27:32,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30561 conditions, 10183 events. 6600/10183 cut-off events. For 15730/15848 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 63525 event pairs, 2550 based on Foata normal form. 0/8693 useless extension candidates. Maximal degree in co-relation 22024. Up to 5352 conditions per place. [2025-03-09 01:27:32,313 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 123 selfloop transitions, 10 changer transitions 0/145 dead transitions. [2025-03-09 01:27:32,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 145 transitions, 1022 flow [2025-03-09 01:27:32,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:27:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:27:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2025-03-09 01:27:32,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7322033898305085 [2025-03-09 01:27:32,315 INFO L175 Difference]: Start difference. First operand has 90 places, 71 transitions, 403 flow. Second operand 5 states and 216 transitions. [2025-03-09 01:27:32,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 145 transitions, 1022 flow [2025-03-09 01:27:32,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 145 transitions, 994 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-09 01:27:32,350 INFO L231 Difference]: Finished difference. Result has 93 places, 77 transitions, 467 flow [2025-03-09 01:27:32,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=467, PETRI_PLACES=93, PETRI_TRANSITIONS=77} [2025-03-09 01:27:32,350 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 35 predicate places. [2025-03-09 01:27:32,350 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 77 transitions, 467 flow [2025-03-09 01:27:32,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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:27:32,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:32,351 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:32,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:27:32,351 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:32,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash -714698192, now seen corresponding path program 2 times [2025-03-09 01:27:32,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:32,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271333309] [2025-03-09 01:27:32,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:32,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:27:32,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:27:32,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:32,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:32,419 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 01:27:32,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:32,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271333309] [2025-03-09 01:27:32,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271333309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:32,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:32,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:27:32,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485657841] [2025-03-09 01:27:32,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:32,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:27:32,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:32,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:27:32,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:27:32,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-09 01:27:32,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 77 transitions, 467 flow. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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:27:32,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:32,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-09 01:27:32,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:33,187 INFO L124 PetriNetUnfolderBase]: 9271/14078 cut-off events. [2025-03-09 01:27:33,188 INFO L125 PetriNetUnfolderBase]: For 28621/29357 co-relation queries the response was YES. [2025-03-09 01:27:33,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44340 conditions, 14078 events. 9271/14078 cut-off events. For 28621/29357 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 88073 event pairs, 4106 based on Foata normal form. 400/12843 useless extension candidates. Maximal degree in co-relation 31499. Up to 7952 conditions per place. [2025-03-09 01:27:33,246 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 138 selfloop transitions, 10 changer transitions 0/161 dead transitions. [2025-03-09 01:27:33,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 161 transitions, 1251 flow [2025-03-09 01:27:33,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:27:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:27:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2025-03-09 01:27:33,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7186440677966102 [2025-03-09 01:27:33,247 INFO L175 Difference]: Start difference. First operand has 93 places, 77 transitions, 467 flow. Second operand 5 states and 212 transitions. [2025-03-09 01:27:33,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 161 transitions, 1251 flow [2025-03-09 01:27:33,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 161 transitions, 1243 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-09 01:27:33,288 INFO L231 Difference]: Finished difference. Result has 101 places, 83 transitions, 547 flow [2025-03-09 01:27:33,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=547, PETRI_PLACES=101, PETRI_TRANSITIONS=83} [2025-03-09 01:27:33,289 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 43 predicate places. [2025-03-09 01:27:33,289 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 83 transitions, 547 flow [2025-03-09 01:27:33,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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:27:33,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:33,289 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:33,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:27:33,289 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:33,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash -620406020, now seen corresponding path program 1 times [2025-03-09 01:27:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:33,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557433134] [2025-03-09 01:27:33,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:33,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:33,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:27:33,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:27:33,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:33,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:33,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:33,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557433134] [2025-03-09 01:27:33,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557433134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:33,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550653627] [2025-03-09 01:27:33,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:33,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:33,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:33,457 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:33,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:27:33,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:27:33,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:27:33,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:33,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:33,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:27:33,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:27:33,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:27:33,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550653627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:33,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:27:33,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2025-03-09 01:27:33,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881582909] [2025-03-09 01:27:33,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:33,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:27:33,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:33,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:27:33,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:27:33,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-09 01:27:33,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 83 transitions, 547 flow. Second operand has 7 states, 7 states have (on average 27.571428571428573) internal successors, (193), 7 states have internal predecessors, (193), 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:27:33,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:33,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-09 01:27:33,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:34,530 INFO L124 PetriNetUnfolderBase]: 7399/11867 cut-off events. [2025-03-09 01:27:34,530 INFO L125 PetriNetUnfolderBase]: For 24883/25519 co-relation queries the response was YES. [2025-03-09 01:27:34,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40109 conditions, 11867 events. 7399/11867 cut-off events. For 24883/25519 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 79629 event pairs, 1544 based on Foata normal form. 434/11585 useless extension candidates. Maximal degree in co-relation 28132. Up to 3411 conditions per place. [2025-03-09 01:27:34,662 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 158 selfloop transitions, 20 changer transitions 0/192 dead transitions. [2025-03-09 01:27:34,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 192 transitions, 1557 flow [2025-03-09 01:27:34,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:27:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:27:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 305 transitions. [2025-03-09 01:27:34,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6461864406779662 [2025-03-09 01:27:34,663 INFO L175 Difference]: Start difference. First operand has 101 places, 83 transitions, 547 flow. Second operand 8 states and 305 transitions. [2025-03-09 01:27:34,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 192 transitions, 1557 flow [2025-03-09 01:27:34,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 192 transitions, 1547 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-09 01:27:34,833 INFO L231 Difference]: Finished difference. Result has 107 places, 85 transitions, 595 flow [2025-03-09 01:27:34,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=595, PETRI_PLACES=107, PETRI_TRANSITIONS=85} [2025-03-09 01:27:34,833 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 49 predicate places. [2025-03-09 01:27:34,834 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 85 transitions, 595 flow [2025-03-09 01:27:34,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.571428571428573) internal successors, (193), 7 states have internal predecessors, (193), 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:27:34,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:34,834 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:34,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:27:35,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 01:27:35,035 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:35,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:35,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2052717102, now seen corresponding path program 1 times [2025-03-09 01:27:35,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:35,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093625612] [2025-03-09 01:27:35,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:35,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:35,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:27:35,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:27:35,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:35,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:35,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:35,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093625612] [2025-03-09 01:27:35,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093625612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:35,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249060638] [2025-03-09 01:27:35,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:35,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:35,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:35,245 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:35,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:27:35,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:27:35,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:27:35,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:35,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:35,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:27:35,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:35,308 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:27:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:35,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:35,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249060638] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:35,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:35,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-03-09 01:27:35,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575567073] [2025-03-09 01:27:35,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:35,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:27:35,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:35,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:27:35,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:27:36,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-09 01:27:36,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 85 transitions, 595 flow. Second operand has 26 states, 26 states have (on average 23.96153846153846) internal successors, (623), 26 states have internal predecessors, (623), 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:27:36,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:36,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-09 01:27:36,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:38,039 INFO L124 PetriNetUnfolderBase]: 14597/21779 cut-off events. [2025-03-09 01:27:38,040 INFO L125 PetriNetUnfolderBase]: For 51796/52516 co-relation queries the response was YES. [2025-03-09 01:27:38,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75077 conditions, 21779 events. 14597/21779 cut-off events. For 51796/52516 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 134310 event pairs, 5322 based on Foata normal form. 696/21501 useless extension candidates. Maximal degree in co-relation 59374. Up to 7700 conditions per place. [2025-03-09 01:27:38,222 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 177 selfloop transitions, 20 changer transitions 0/208 dead transitions. [2025-03-09 01:27:38,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 208 transitions, 1569 flow [2025-03-09 01:27:38,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 392 transitions. [2025-03-09 01:27:38,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6040061633281972 [2025-03-09 01:27:38,224 INFO L175 Difference]: Start difference. First operand has 107 places, 85 transitions, 595 flow. Second operand 11 states and 392 transitions. [2025-03-09 01:27:38,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 208 transitions, 1569 flow [2025-03-09 01:27:38,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 208 transitions, 1532 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-09 01:27:38,359 INFO L231 Difference]: Finished difference. Result has 116 places, 92 transitions, 682 flow [2025-03-09 01:27:38,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=682, PETRI_PLACES=116, PETRI_TRANSITIONS=92} [2025-03-09 01:27:38,359 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 58 predicate places. [2025-03-09 01:27:38,359 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 92 transitions, 682 flow [2025-03-09 01:27:38,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 23.96153846153846) internal successors, (623), 26 states have internal predecessors, (623), 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:27:38,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:38,359 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:38,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:27:38,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:27:38,560 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:38,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:38,561 INFO L85 PathProgramCache]: Analyzing trace with hash -594195051, now seen corresponding path program 1 times [2025-03-09 01:27:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:38,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838615901] [2025-03-09 01:27:38,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:38,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:38,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:27:38,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:27:38,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:38,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:38,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:38,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838615901] [2025-03-09 01:27:38,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838615901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:38,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844225825] [2025-03-09 01:27:38,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:38,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:38,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:38,755 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:38,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:27:38,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:27:38,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:27:38,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:38,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:38,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:27:38,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:27:38,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:27:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844225825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:38,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:27:38,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2025-03-09 01:27:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393196082] [2025-03-09 01:27:38,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:38,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:27:38,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:38,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:27:38,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:27:38,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-09 01:27:38,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 92 transitions, 682 flow. Second operand has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:38,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:38,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-09 01:27:38,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:40,084 INFO L124 PetriNetUnfolderBase]: 9917/15554 cut-off events. [2025-03-09 01:27:40,085 INFO L125 PetriNetUnfolderBase]: For 50259/50461 co-relation queries the response was YES. [2025-03-09 01:27:40,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56447 conditions, 15554 events. 9917/15554 cut-off events. For 50259/50461 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 102327 event pairs, 1714 based on Foata normal form. 228/15027 useless extension candidates. Maximal degree in co-relation 44025. Up to 4749 conditions per place. [2025-03-09 01:27:40,171 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 202 selfloop transitions, 20 changer transitions 0/235 dead transitions. [2025-03-09 01:27:40,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 235 transitions, 2227 flow [2025-03-09 01:27:40,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:27:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:27:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 301 transitions. [2025-03-09 01:27:40,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6377118644067796 [2025-03-09 01:27:40,173 INFO L175 Difference]: Start difference. First operand has 116 places, 92 transitions, 682 flow. Second operand 8 states and 301 transitions. [2025-03-09 01:27:40,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 235 transitions, 2227 flow [2025-03-09 01:27:40,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 235 transitions, 2117 flow, removed 27 selfloop flow, removed 7 redundant places. [2025-03-09 01:27:40,332 INFO L231 Difference]: Finished difference. Result has 115 places, 94 transitions, 690 flow [2025-03-09 01:27:40,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=690, PETRI_PLACES=115, PETRI_TRANSITIONS=94} [2025-03-09 01:27:40,333 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 57 predicate places. [2025-03-09 01:27:40,333 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 94 transitions, 690 flow [2025-03-09 01:27:40,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:40,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:40,333 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:40,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:27:40,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:27:40,534 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:40,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:40,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1240177051, now seen corresponding path program 1 times [2025-03-09 01:27:40,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:40,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6144595] [2025-03-09 01:27:40,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:40,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:40,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:27:40,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:27:40,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:40,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:27:40,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:40,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6144595] [2025-03-09 01:27:40,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6144595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:40,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380348414] [2025-03-09 01:27:40,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:40,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:40,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:40,698 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:40,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:27:40,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:27:40,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:27:40,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:40,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:40,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:27:40,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:40,769 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:27:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:40,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:41,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380348414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:41,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:41,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 21 [2025-03-09 01:27:41,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143883996] [2025-03-09 01:27:41,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:41,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:27:41,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:41,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:27:41,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:27:41,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-03-09 01:27:41,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 94 transitions, 690 flow. Second operand has 23 states, 23 states have (on average 25.347826086956523) internal successors, (583), 23 states have internal predecessors, (583), 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:27:41,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:41,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-03-09 01:27:41,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:44,410 INFO L124 PetriNetUnfolderBase]: 19593/29291 cut-off events. [2025-03-09 01:27:44,410 INFO L125 PetriNetUnfolderBase]: For 87742/87742 co-relation queries the response was YES. [2025-03-09 01:27:44,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106222 conditions, 29291 events. 19593/29291 cut-off events. For 87742/87742 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 186550 event pairs, 4222 based on Foata normal form. 556/28641 useless extension candidates. Maximal degree in co-relation 89797. Up to 6790 conditions per place. [2025-03-09 01:27:44,811 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 250 selfloop transitions, 26 changer transitions 0/286 dead transitions. [2025-03-09 01:27:44,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 286 transitions, 2394 flow [2025-03-09 01:27:44,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:27:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:27:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 500 transitions. [2025-03-09 01:27:44,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6053268765133172 [2025-03-09 01:27:44,813 INFO L175 Difference]: Start difference. First operand has 115 places, 94 transitions, 690 flow. Second operand 14 states and 500 transitions. [2025-03-09 01:27:44,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 286 transitions, 2394 flow [2025-03-09 01:27:45,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 286 transitions, 2347 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-09 01:27:45,133 INFO L231 Difference]: Finished difference. Result has 127 places, 103 transitions, 808 flow [2025-03-09 01:27:45,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=808, PETRI_PLACES=127, PETRI_TRANSITIONS=103} [2025-03-09 01:27:45,134 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 69 predicate places. [2025-03-09 01:27:45,134 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 103 transitions, 808 flow [2025-03-09 01:27:45,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 25.347826086956523) internal successors, (583), 23 states have internal predecessors, (583), 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:27:45,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:45,134 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] [2025-03-09 01:27:45,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 01:27:45,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:45,335 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:45,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:45,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2096764639, now seen corresponding path program 1 times [2025-03-09 01:27:45,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:45,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275563038] [2025-03-09 01:27:45,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:45,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:45,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:27:45,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:27:45,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:45,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:27:45,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:45,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275563038] [2025-03-09 01:27:45,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275563038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:45,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:45,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:27:45,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264922957] [2025-03-09 01:27:45,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:45,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:27:45,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:45,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:27:45,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:27:45,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-09 01:27:45,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 103 transitions, 808 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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:27:45,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:45,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-09 01:27:45,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:46,812 INFO L124 PetriNetUnfolderBase]: 13939/21817 cut-off events. [2025-03-09 01:27:46,812 INFO L125 PetriNetUnfolderBase]: For 88690/88786 co-relation queries the response was YES. [2025-03-09 01:27:46,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84257 conditions, 21817 events. 13939/21817 cut-off events. For 88690/88786 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 147204 event pairs, 2902 based on Foata normal form. 3/20650 useless extension candidates. Maximal degree in co-relation 69469. Up to 16656 conditions per place. [2025-03-09 01:27:46,951 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 104 selfloop transitions, 11 changer transitions 8/138 dead transitions. [2025-03-09 01:27:46,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 138 transitions, 1304 flow [2025-03-09 01:27:46,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:27:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:27:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-03-09 01:27:46,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7740112994350282 [2025-03-09 01:27:46,952 INFO L175 Difference]: Start difference. First operand has 127 places, 103 transitions, 808 flow. Second operand 3 states and 137 transitions. [2025-03-09 01:27:46,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 138 transitions, 1304 flow [2025-03-09 01:27:47,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 138 transitions, 1257 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-09 01:27:47,081 INFO L231 Difference]: Finished difference. Result has 123 places, 105 transitions, 832 flow [2025-03-09 01:27:47,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=123, PETRI_TRANSITIONS=105} [2025-03-09 01:27:47,082 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 65 predicate places. [2025-03-09 01:27:47,082 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 105 transitions, 832 flow [2025-03-09 01:27:47,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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:27:47,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:47,082 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:27:47,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:27:47,082 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:47,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:47,083 INFO L85 PathProgramCache]: Analyzing trace with hash 415897533, now seen corresponding path program 2 times [2025-03-09 01:27:47,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:47,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435972850] [2025-03-09 01:27:47,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:47,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:47,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:27:47,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:27:47,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:47,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:47,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:47,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435972850] [2025-03-09 01:27:47,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435972850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:47,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712429947] [2025-03-09 01:27:47,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:47,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:47,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:47,198 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:47,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:27:47,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:27:47,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:27:47,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:47,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:47,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:27:47,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:47,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:47,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-09 01:27:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:47,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712429947] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:47,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:47,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2025-03-09 01:27:47,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497359931] [2025-03-09 01:27:47,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:47,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:27:47,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:47,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:27:47,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:27:47,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-03-09 01:27:47,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 105 transitions, 832 flow. Second operand has 26 states, 26 states have (on average 27.076923076923077) internal successors, (704), 26 states have internal predecessors, (704), 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:27:47,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:47,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-03-09 01:27:47,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:51,230 INFO L124 PetriNetUnfolderBase]: 27399/41052 cut-off events. [2025-03-09 01:27:51,231 INFO L125 PetriNetUnfolderBase]: For 166145/166145 co-relation queries the response was YES. [2025-03-09 01:27:51,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161424 conditions, 41052 events. 27399/41052 cut-off events. For 166145/166145 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 283932 event pairs, 9618 based on Foata normal form. 388/39266 useless extension candidates. Maximal degree in co-relation 144674. Up to 15082 conditions per place. [2025-03-09 01:27:51,503 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 400 selfloop transitions, 40 changer transitions 0/453 dead transitions. [2025-03-09 01:27:51,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 453 transitions, 4411 flow [2025-03-09 01:27:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:27:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-09 01:27:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 603 transitions. [2025-03-09 01:27:51,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638771186440678 [2025-03-09 01:27:51,504 INFO L175 Difference]: Start difference. First operand has 123 places, 105 transitions, 832 flow. Second operand 16 states and 603 transitions. [2025-03-09 01:27:51,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 453 transitions, 4411 flow [2025-03-09 01:27:51,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 453 transitions, 4245 flow, removed 68 selfloop flow, removed 7 redundant places. [2025-03-09 01:27:51,924 INFO L231 Difference]: Finished difference. Result has 132 places, 123 transitions, 1137 flow [2025-03-09 01:27:51,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1137, PETRI_PLACES=132, PETRI_TRANSITIONS=123} [2025-03-09 01:27:51,924 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 74 predicate places. [2025-03-09 01:27:51,924 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 123 transitions, 1137 flow [2025-03-09 01:27:51,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 27.076923076923077) internal successors, (704), 26 states have internal predecessors, (704), 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:27:51,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:51,925 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:27:51,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:27:52,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-09 01:27:52,125 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:52,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:52,126 INFO L85 PathProgramCache]: Analyzing trace with hash -20566210, now seen corresponding path program 3 times [2025-03-09 01:27:52,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:52,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770221748] [2025-03-09 01:27:52,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:27:52,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:52,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 6 equivalence classes. [2025-03-09 01:27:52,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 26 statements. [2025-03-09 01:27:52,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:27:52,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-09 01:27:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770221748] [2025-03-09 01:27:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770221748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135404198] [2025-03-09 01:27:52,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:27:52,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:52,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:52,202 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:52,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:27:52,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 6 equivalence classes. [2025-03-09 01:27:52,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 26 statements. [2025-03-09 01:27:52,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:27:52,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:52,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:27:52,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:52,262 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:27:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-09 01:27:52,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-09 01:27:52,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135404198] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:52,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:52,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:27:52,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907104666] [2025-03-09 01:27:52,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:52,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:27:52,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:52,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:27:52,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:27:52,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-03-09 01:27:52,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 123 transitions, 1137 flow. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 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:27:52,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:52,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-03-09 01:27:52,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:56,949 INFO L124 PetriNetUnfolderBase]: 36679/55195 cut-off events. [2025-03-09 01:27:56,949 INFO L125 PetriNetUnfolderBase]: For 262078/262078 co-relation queries the response was YES. [2025-03-09 01:27:57,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218067 conditions, 55195 events. 36679/55195 cut-off events. For 262078/262078 co-relation queries the response was YES. Maximal size of possible extension queue 1372. Compared 395080 event pairs, 12299 based on Foata normal form. 268/53249 useless extension candidates. Maximal degree in co-relation 185934. Up to 26967 conditions per place. [2025-03-09 01:27:57,363 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 178 selfloop transitions, 29 changer transitions 0/216 dead transitions. [2025-03-09 01:27:57,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 216 transitions, 2255 flow [2025-03-09 01:27:57,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:27:57,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:27:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2025-03-09 01:27:57,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5819209039548022 [2025-03-09 01:27:57,364 INFO L175 Difference]: Start difference. First operand has 132 places, 123 transitions, 1137 flow. Second operand 6 states and 206 transitions. [2025-03-09 01:27:57,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 216 transitions, 2255 flow [2025-03-09 01:27:59,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 216 transitions, 2219 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-09 01:27:59,151 INFO L231 Difference]: Finished difference. Result has 132 places, 122 transitions, 1153 flow [2025-03-09 01:27:59,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1153, PETRI_PLACES=132, PETRI_TRANSITIONS=122} [2025-03-09 01:27:59,152 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 74 predicate places. [2025-03-09 01:27:59,152 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 122 transitions, 1153 flow [2025-03-09 01:27:59,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 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:27:59,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:59,152 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] [2025-03-09 01:27:59,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 01:27:59,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 01:27:59,353 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:59,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:59,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1573789176, now seen corresponding path program 1 times [2025-03-09 01:27:59,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:59,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604724652] [2025-03-09 01:27:59,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:59,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:59,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:27:59,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:27:59,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:59,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:59,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604724652] [2025-03-09 01:27:59,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604724652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348021583] [2025-03-09 01:27:59,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:59,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:59,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:59,451 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:59,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 01:27:59,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:27:59,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:27:59,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:59,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:59,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:27:59,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:59,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:59,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348021583] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:59,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:27:59,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2025-03-09 01:27:59,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923124839] [2025-03-09 01:27:59,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:59,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:27:59,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:59,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:27:59,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:27:59,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-09 01:27:59,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 122 transitions, 1153 flow. Second operand has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 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:27:59,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:59,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-09 01:27:59,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:02,505 INFO L124 PetriNetUnfolderBase]: 20989/36170 cut-off events. [2025-03-09 01:28:02,505 INFO L125 PetriNetUnfolderBase]: For 195614/195614 co-relation queries the response was YES. [2025-03-09 01:28:02,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136706 conditions, 36170 events. 20989/36170 cut-off events. For 195614/195614 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 303679 event pairs, 6861 based on Foata normal form. 0/33191 useless extension candidates. Maximal degree in co-relation 114525. Up to 14979 conditions per place. [2025-03-09 01:28:02,744 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 365 selfloop transitions, 37 changer transitions 0/416 dead transitions. [2025-03-09 01:28:02,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 416 transitions, 5246 flow [2025-03-09 01:28:02,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:28:02,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:28:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 381 transitions. [2025-03-09 01:28:02,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6457627118644068 [2025-03-09 01:28:02,745 INFO L175 Difference]: Start difference. First operand has 132 places, 122 transitions, 1153 flow. Second operand 10 states and 381 transitions. [2025-03-09 01:28:02,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 416 transitions, 5246 flow [2025-03-09 01:28:03,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 416 transitions, 4948 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:28:03,202 INFO L231 Difference]: Finished difference. Result has 138 places, 142 transitions, 1339 flow [2025-03-09 01:28:03,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1339, PETRI_PLACES=138, PETRI_TRANSITIONS=142} [2025-03-09 01:28:03,203 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 80 predicate places. [2025-03-09 01:28:03,203 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 142 transitions, 1339 flow [2025-03-09 01:28:03,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 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:03,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:03,203 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] [2025-03-09 01:28:03,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 01:28:03,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:03,403 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:28:03,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:03,404 INFO L85 PathProgramCache]: Analyzing trace with hash 846398634, now seen corresponding path program 2 times [2025-03-09 01:28:03,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:03,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107986701] [2025-03-09 01:28:03,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:03,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:28:03,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:28:03,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:03,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:28:03,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:03,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107986701] [2025-03-09 01:28:03,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107986701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:03,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290552503] [2025-03-09 01:28:03,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:03,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:03,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:03,449 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:03,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 01:28:03,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:28:03,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:28:03,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:03,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:03,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:28:03,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:28:03,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:28:03,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290552503] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:03,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:28:03,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 14 [2025-03-09 01:28:03,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211860176] [2025-03-09 01:28:03,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:03,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:28:03,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:03,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:28:03,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:28:03,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-09 01:28:03,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 142 transitions, 1339 flow. Second operand has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 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:03,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:03,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-09 01:28:03,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:07,854 INFO L124 PetriNetUnfolderBase]: 29515/48295 cut-off events. [2025-03-09 01:28:07,854 INFO L125 PetriNetUnfolderBase]: For 279461/279461 co-relation queries the response was YES. [2025-03-09 01:28:08,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197535 conditions, 48295 events. 29515/48295 cut-off events. For 279461/279461 co-relation queries the response was YES. Maximal size of possible extension queue 1461. Compared 393810 event pairs, 4974 based on Foata normal form. 92/47422 useless extension candidates. Maximal degree in co-relation 165002. Up to 11009 conditions per place. [2025-03-09 01:28:08,233 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 361 selfloop transitions, 92 changer transitions 0/467 dead transitions. [2025-03-09 01:28:08,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 467 transitions, 5664 flow [2025-03-09 01:28:08,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:28:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:28:08,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 374 transitions. [2025-03-09 01:28:08,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6338983050847458 [2025-03-09 01:28:08,235 INFO L175 Difference]: Start difference. First operand has 138 places, 142 transitions, 1339 flow. Second operand 10 states and 374 transitions. [2025-03-09 01:28:08,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 467 transitions, 5664 flow [2025-03-09 01:28:08,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 467 transitions, 5651 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 01:28:08,983 INFO L231 Difference]: Finished difference. Result has 150 places, 197 transitions, 2272 flow [2025-03-09 01:28:08,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1326, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2272, PETRI_PLACES=150, PETRI_TRANSITIONS=197} [2025-03-09 01:28:08,983 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 92 predicate places. [2025-03-09 01:28:08,983 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 197 transitions, 2272 flow [2025-03-09 01:28:08,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 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:08,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:08,984 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] [2025-03-09 01:28:08,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 01:28:09,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:09,186 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:28:09,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:09,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1304070797, now seen corresponding path program 1 times [2025-03-09 01:28:09,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:09,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127773891] [2025-03-09 01:28:09,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:09,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:09,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:28:09,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:28:09,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:09,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:28:09,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:09,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127773891] [2025-03-09 01:28:09,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127773891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:09,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:09,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:28:09,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915966163] [2025-03-09 01:28:09,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:09,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:28:09,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:09,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:28:09,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:28:09,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-09 01:28:09,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 197 transitions, 2272 flow. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 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:09,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:09,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-09 01:28:09,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:14,482 INFO L124 PetriNetUnfolderBase]: 32917/52451 cut-off events. [2025-03-09 01:28:14,482 INFO L125 PetriNetUnfolderBase]: For 424560/424560 co-relation queries the response was YES. [2025-03-09 01:28:14,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254271 conditions, 52451 events. 32917/52451 cut-off events. For 424560/424560 co-relation queries the response was YES. Maximal size of possible extension queue 1602. Compared 420580 event pairs, 13013 based on Foata normal form. 84/51365 useless extension candidates. Maximal degree in co-relation 218190. Up to 31652 conditions per place. [2025-03-09 01:28:15,001 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 391 selfloop transitions, 29 changer transitions 3/437 dead transitions. [2025-03-09 01:28:15,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 437 transitions, 5985 flow [2025-03-09 01:28:15,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:28:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:28:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 246 transitions. [2025-03-09 01:28:15,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6949152542372882 [2025-03-09 01:28:15,002 INFO L175 Difference]: Start difference. First operand has 150 places, 197 transitions, 2272 flow. Second operand 6 states and 246 transitions. [2025-03-09 01:28:15,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 437 transitions, 5985 flow [2025-03-09 01:28:18,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 437 transitions, 5968 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-09 01:28:18,123 INFO L231 Difference]: Finished difference. Result has 154 places, 205 transitions, 2464 flow [2025-03-09 01:28:18,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2263, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2464, PETRI_PLACES=154, PETRI_TRANSITIONS=205} [2025-03-09 01:28:18,123 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 96 predicate places. [2025-03-09 01:28:18,123 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 205 transitions, 2464 flow [2025-03-09 01:28:18,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 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:18,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:18,124 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] [2025-03-09 01:28:18,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 01:28:18,124 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:28:18,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash 150179683, now seen corresponding path program 2 times [2025-03-09 01:28:18,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:18,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129084670] [2025-03-09 01:28:18,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:18,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:18,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:28:18,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:28:18,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:18,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:28:18,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:18,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129084670] [2025-03-09 01:28:18,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129084670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:18,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689353350] [2025-03-09 01:28:18,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:18,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:18,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:18,164 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:18,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 01:28:18,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-09 01:28:18,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:28:18,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:18,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:18,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:28:18,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:28:18,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:28:18,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689353350] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:18,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:28:18,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2025-03-09 01:28:18,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621831483] [2025-03-09 01:28:18,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:18,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:28:18,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:18,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:28:18,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:28:18,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-09 01:28:18,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 205 transitions, 2464 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 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:18,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:18,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-09 01:28:18,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand