./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-max-array-hom.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-max-array-hom.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 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:26:34,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:26:34,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:26:35,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:26:35,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:26:35,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:26:35,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:26:35,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:26:35,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:26:35,018 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:26:35,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:26:35,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:26:35,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:26:35,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:26:35,020 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:26:35,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:26:35,020 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:26:35,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:26:35,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:26:35,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:26:35,021 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:26:35,021 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:26:35,021 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:26:35,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:26:35,021 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:26:35,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:26:35,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:26:35,022 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:26:35,022 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:26:35,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:26:35,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:26:35,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:26:35,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:26:35,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:26:35,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:26:35,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:26:35,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:26:35,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:26:35,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:26:35,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:26:35,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:26:35,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:26:35,023 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 -> 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 [2025-03-09 01:26:35,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:26:35,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:26:35,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:26:35,241 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:26:35,242 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:26:35,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2025-03-09 01:26:36,398 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e4bf89c/d62f200d418e42f4b5d2d800d3bf2950/FLAGac4b5518d [2025-03-09 01:26:36,653 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:26:36,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2025-03-09 01:26:36,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e4bf89c/d62f200d418e42f4b5d2d800d3bf2950/FLAGac4b5518d [2025-03-09 01:26:36,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e4bf89c/d62f200d418e42f4b5d2d800d3bf2950 [2025-03-09 01:26:36,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:26:36,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:26:36,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:26:36,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:26:36,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:26:36,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:26:36" (1/1) ... [2025-03-09 01:26:36,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ff9451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:36, skipping insertion in model container [2025-03-09 01:26:36,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:26:36" (1/1) ... [2025-03-09 01:26:36,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:26:36,821 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:26:36,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:26:36,835 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:26:36,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:26:36,870 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:26:36,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:36 WrapperNode [2025-03-09 01:26:36,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:26:36,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:26:36,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:26:36,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:26:36,877 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:26:36" (1/1) ... [2025-03-09 01:26:36,882 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:26:36" (1/1) ... [2025-03-09 01:26:36,896 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-03-09 01:26:36,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:26:36,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:26:36,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:26:36,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:26:36,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:36" (1/1) ... [2025-03-09 01:26:36,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:36" (1/1) ... [2025-03-09 01:26:36,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:36" (1/1) ... [2025-03-09 01:26:36,922 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:26:36,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:36" (1/1) ... [2025-03-09 01:26:36,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:36" (1/1) ... [2025-03-09 01:26:36,927 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:36" (1/1) ... [2025-03-09 01:26:36,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:36" (1/1) ... [2025-03-09 01:26:36,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:36" (1/1) ... [2025-03-09 01:26:36,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:36" (1/1) ... [2025-03-09 01:26:36,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:26:36,931 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:26:36,931 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:26:36,931 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:26:36,931 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:36" (1/1) ... [2025-03-09 01:26:36,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:26:36,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:36,954 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:26:36,958 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:26:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:26:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:26:36,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:26:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:26:36,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:26:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:26:36,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:26:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:26:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:26:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:26:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:26:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:26:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:26:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:26:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:26:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:26:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:26:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:26:36,975 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:26:37,047 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:26:37,049 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:26:37,276 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:26:37,277 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:26:37,464 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:26:37,464 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:26:37,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:26:37 BoogieIcfgContainer [2025-03-09 01:26:37,465 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:26:37,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:26:37,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:26:37,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:26:37,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:26:36" (1/3) ... [2025-03-09 01:26:37,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eece80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:26:37, skipping insertion in model container [2025-03-09 01:26:37,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:36" (2/3) ... [2025-03-09 01:26:37,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eece80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:26:37, skipping insertion in model container [2025-03-09 01:26:37,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:26:37" (3/3) ... [2025-03-09 01:26:37,475 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2025-03-09 01:26:37,488 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:26:37,489 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-max-array-hom.wvr.c that has 4 procedures, 47 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-03-09 01:26:37,490 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:26:37,555 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:26:37,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 121 flow [2025-03-09 01:26:37,621 INFO L124 PetriNetUnfolderBase]: 4/47 cut-off events. [2025-03-09 01:26:37,623 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:26:37,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 4/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-03-09 01:26:37,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 121 flow [2025-03-09 01:26:37,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 46 transitions, 110 flow [2025-03-09 01:26:37,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:26:37,648 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;@141e03ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:26:37,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-09 01:26:37,650 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:26:37,651 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:26:37,651 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:26:37,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:37,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:26:37,651 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:26:37,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:37,655 INFO L85 PathProgramCache]: Analyzing trace with hash 405260, now seen corresponding path program 1 times [2025-03-09 01:26:37,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:37,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627510997] [2025-03-09 01:26:37,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:37,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:37,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:26:37,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:26:37,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:37,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:37,859 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:26:37,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:37,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627510997] [2025-03-09 01:26:37,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627510997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:37,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:37,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:26:37,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629274053] [2025-03-09 01:26:37,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:37,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:26:37,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:37,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:26:37,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:26:37,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:37,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:37,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:37,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:37,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:38,150 INFO L124 PetriNetUnfolderBase]: 1316/1960 cut-off events. [2025-03-09 01:26:38,150 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-09 01:26:38,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3973 conditions, 1960 events. 1316/1960 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10117 event pairs, 1060 based on Foata normal form. 1/1443 useless extension candidates. Maximal degree in co-relation 3667. Up to 1877 conditions per place. [2025-03-09 01:26:38,172 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 30 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-09 01:26:38,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 156 flow [2025-03-09 01:26:38,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:26:38,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:26:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-03-09 01:26:38,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2025-03-09 01:26:38,187 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 110 flow. Second operand 3 states and 67 transitions. [2025-03-09 01:26:38,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 156 flow [2025-03-09 01:26:38,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 144 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:26:38,198 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 84 flow [2025-03-09 01:26:38,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-03-09 01:26:38,203 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -13 predicate places. [2025-03-09 01:26:38,204 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 84 flow [2025-03-09 01:26:38,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:38,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:38,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:26:38,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:26:38,204 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:26:38,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash 405261, now seen corresponding path program 1 times [2025-03-09 01:26:38,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:38,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759958044] [2025-03-09 01:26:38,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:38,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:26:38,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:26:38,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:38,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:38,520 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:26:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759958044] [2025-03-09 01:26:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759958044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:38,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559092143] [2025-03-09 01:26:38,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:38,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:38,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:38,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:38,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:38,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:38,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:38,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:38,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:38,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:38,757 INFO L124 PetriNetUnfolderBase]: 1317/1963 cut-off events. [2025-03-09 01:26:38,757 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-09 01:26:38,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3895 conditions, 1963 events. 1317/1963 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10157 event pairs, 1060 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 3873. Up to 1882 conditions per place. [2025-03-09 01:26:38,768 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 32 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-03-09 01:26:38,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 164 flow [2025-03-09 01:26:38,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-03-09 01:26:38,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.365 [2025-03-09 01:26:38,771 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 84 flow. Second operand 4 states and 73 transitions. [2025-03-09 01:26:38,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 164 flow [2025-03-09 01:26:38,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:38,774 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 107 flow [2025-03-09 01:26:38,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2025-03-09 01:26:38,775 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2025-03-09 01:26:38,775 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 107 flow [2025-03-09 01:26:38,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:38,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:38,775 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:26:38,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:26:38,776 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:26:38,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:38,777 INFO L85 PathProgramCache]: Analyzing trace with hash 389468033, now seen corresponding path program 1 times [2025-03-09 01:26:38,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:38,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405871877] [2025-03-09 01:26:38,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:38,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:38,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:26:38,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:26:38,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:38,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:39,017 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:26:39,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:39,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405871877] [2025-03-09 01:26:39,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405871877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:39,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95225309] [2025-03-09 01:26:39,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:39,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:39,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:39,020 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:26:39,022 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:26:39,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:26:39,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:26:39,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:39,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:39,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:26:39,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:39,116 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:26:39,228 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:26:39,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:39,292 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:26:39,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95225309] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:39,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:39,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:26:39,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676664693] [2025-03-09 01:26:39,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:39,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:26:39,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:39,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:26:39,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:26:39,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:39,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 107 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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:26:39,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:39,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:39,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:39,623 INFO L124 PetriNetUnfolderBase]: 1318/1965 cut-off events. [2025-03-09 01:26:39,623 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-09 01:26:39,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3911 conditions, 1965 events. 1318/1965 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10167 event pairs, 1060 based on Foata normal form. 0/1446 useless extension candidates. Maximal degree in co-relation 3880. Up to 1879 conditions per place. [2025-03-09 01:26:39,633 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 28 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2025-03-09 01:26:39,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 191 flow [2025-03-09 01:26:39,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:26:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:26:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2025-03-09 01:26:39,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28 [2025-03-09 01:26:39,635 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 107 flow. Second operand 8 states and 112 transitions. [2025-03-09 01:26:39,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 191 flow [2025-03-09 01:26:39,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:26:39,637 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 132 flow [2025-03-09 01:26:39,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-03-09 01:26:39,637 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-03-09 01:26:39,638 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 132 flow [2025-03-09 01:26:39,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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:26:39,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:39,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:26:39,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:26:39,839 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:26:39,839 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:26:39,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:39,839 INFO L85 PathProgramCache]: Analyzing trace with hash -808665208, now seen corresponding path program 1 times [2025-03-09 01:26:39,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:39,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109754842] [2025-03-09 01:26:39,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:39,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:39,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:26:39,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:26:39,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:39,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:39,902 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:26:39,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:39,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109754842] [2025-03-09 01:26:39,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109754842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:39,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:39,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:39,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967629370] [2025-03-09 01:26:39,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:39,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:39,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:39,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:39,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:39,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:39,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:26:39,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:39,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:39,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:40,029 INFO L124 PetriNetUnfolderBase]: 794/1200 cut-off events. [2025-03-09 01:26:40,030 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-09 01:26:40,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2400 conditions, 1200 events. 794/1200 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5512 event pairs, 608 based on Foata normal form. 0/1009 useless extension candidates. Maximal degree in co-relation 2362. Up to 1136 conditions per place. [2025-03-09 01:26:40,035 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 31 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-03-09 01:26:40,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 196 flow [2025-03-09 01:26:40,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-03-09 01:26:40,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34 [2025-03-09 01:26:40,037 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 132 flow. Second operand 4 states and 68 transitions. [2025-03-09 01:26:40,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 196 flow [2025-03-09 01:26:40,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 154 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-09 01:26:40,038 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 92 flow [2025-03-09 01:26:40,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-03-09 01:26:40,039 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -12 predicate places. [2025-03-09 01:26:40,039 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 92 flow [2025-03-09 01:26:40,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:26:40,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:40,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:26:40,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:26:40,039 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:26:40,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash -808665207, now seen corresponding path program 1 times [2025-03-09 01:26:40,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:40,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224773500] [2025-03-09 01:26:40,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:40,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:40,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:26:40,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:26:40,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:40,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:40,107 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:26:40,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:40,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224773500] [2025-03-09 01:26:40,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224773500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:40,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:40,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:40,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033553163] [2025-03-09 01:26:40,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:40,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:26:40,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:40,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:26:40,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:26:40,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-09 01:26:40,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:40,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:40,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-09 01:26:40,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:40,210 INFO L124 PetriNetUnfolderBase]: 793/1199 cut-off events. [2025-03-09 01:26:40,210 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-09 01:26:40,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2378 conditions, 1199 events. 793/1199 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5502 event pairs, 608 based on Foata normal form. 1/1011 useless extension candidates. Maximal degree in co-relation 2354. Up to 1141 conditions per place. [2025-03-09 01:26:40,216 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 32 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-03-09 01:26:40,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2025-03-09 01:26:40,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:26:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:26:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-09 01:26:40,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41333333333333333 [2025-03-09 01:26:40,217 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 92 flow. Second operand 3 states and 62 transitions. [2025-03-09 01:26:40,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2025-03-09 01:26:40,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:40,219 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 88 flow [2025-03-09 01:26:40,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-03-09 01:26:40,220 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -12 predicate places. [2025-03-09 01:26:40,220 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 88 flow [2025-03-09 01:26:40,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:40,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:40,221 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:40,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:26:40,221 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:26:40,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:40,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1938610837, now seen corresponding path program 1 times [2025-03-09 01:26:40,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:40,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530990428] [2025-03-09 01:26:40,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:40,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:40,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:26:40,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:26:40,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:40,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:40,375 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:26:40,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:40,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530990428] [2025-03-09 01:26:40,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530990428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:40,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884208072] [2025-03-09 01:26:40,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:40,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:40,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:40,377 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:26:40,378 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:26:40,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:26:40,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:26:40,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:40,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:40,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:26:40,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:40,444 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:26:40,512 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:26:40,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:40,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884208072] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:40,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:26:40,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 10 [2025-03-09 01:26:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534287279] [2025-03-09 01:26:40,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:40,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:26:40,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:40,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:26:40,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:26:40,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-09 01:26:40,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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:26:40,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:40,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-09 01:26:40,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:40,775 INFO L124 PetriNetUnfolderBase]: 1002/1521 cut-off events. [2025-03-09 01:26:40,775 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-09 01:26:40,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2978 conditions, 1521 events. 1002/1521 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7334 event pairs, 483 based on Foata normal form. 0/1309 useless extension candidates. Maximal degree in co-relation 2967. Up to 926 conditions per place. [2025-03-09 01:26:40,782 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 43 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2025-03-09 01:26:40,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 226 flow [2025-03-09 01:26:40,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:26:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:26:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-03-09 01:26:40,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2025-03-09 01:26:40,785 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 88 flow. Second operand 6 states and 109 transitions. [2025-03-09 01:26:40,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 226 flow [2025-03-09 01:26:40,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:40,787 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 120 flow [2025-03-09 01:26:40,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-03-09 01:26:40,788 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2025-03-09 01:26:40,789 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 120 flow [2025-03-09 01:26:40,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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:26:40,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:40,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:40,795 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:26:40,991 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:26:40,991 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:26:40,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:40,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1045004102, now seen corresponding path program 1 times [2025-03-09 01:26:40,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:40,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611871611] [2025-03-09 01:26:40,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:40,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:40,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:26:41,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:26:41,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:41,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:41,078 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:26:41,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:41,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611871611] [2025-03-09 01:26:41,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611871611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:41,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101434785] [2025-03-09 01:26:41,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:41,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:41,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:41,080 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:26:41,082 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:26:41,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:26:41,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:26:41,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:41,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:41,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:26:41,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:41,188 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:26:41,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:41,238 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:26:41,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101434785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:41,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:41,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 01:26:41,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804490468] [2025-03-09 01:26:41,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:41,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:26:41,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:41,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:26:41,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:26:41,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:41,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 120 flow. Second operand has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 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:26:41,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:41,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:41,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:41,607 INFO L124 PetriNetUnfolderBase]: 1728/2583 cut-off events. [2025-03-09 01:26:41,607 INFO L125 PetriNetUnfolderBase]: For 1676/1676 co-relation queries the response was YES. [2025-03-09 01:26:41,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6361 conditions, 2583 events. 1728/2583 cut-off events. For 1676/1676 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12391 event pairs, 1148 based on Foata normal form. 0/2309 useless extension candidates. Maximal degree in co-relation 4292. Up to 1681 conditions per place. [2025-03-09 01:26:41,616 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 69 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2025-03-09 01:26:41,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 406 flow [2025-03-09 01:26:41,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:26:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:26:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-03-09 01:26:41,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2025-03-09 01:26:41,618 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 120 flow. Second operand 7 states and 135 transitions. [2025-03-09 01:26:41,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 406 flow [2025-03-09 01:26:41,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 400 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:26:41,619 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 145 flow [2025-03-09 01:26:41,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2025-03-09 01:26:41,620 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2025-03-09 01:26:41,620 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 145 flow [2025-03-09 01:26:41,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 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:26:41,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:41,621 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:41,627 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:26:41,821 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:26:41,822 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:26:41,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:41,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1269291935, now seen corresponding path program 1 times [2025-03-09 01:26:41,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:41,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892654658] [2025-03-09 01:26:41,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:41,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:41,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:26:41,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:26:41,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:41,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:41,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:41,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892654658] [2025-03-09 01:26:41,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892654658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:41,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952491944] [2025-03-09 01:26:41,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:41,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:41,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:41,897 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:26:41,898 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:26:41,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:26:41,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:26:41,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:41,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:41,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:26:41,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:42,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:42,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952491944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:42,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:42,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 01:26:42,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824179515] [2025-03-09 01:26:42,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:42,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:26:42,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:42,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:26:42,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:26:42,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:42,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 145 flow. Second operand has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 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:26:42,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:42,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:42,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:42,399 INFO L124 PetriNetUnfolderBase]: 1788/2666 cut-off events. [2025-03-09 01:26:42,399 INFO L125 PetriNetUnfolderBase]: For 1604/1691 co-relation queries the response was YES. [2025-03-09 01:26:42,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6835 conditions, 2666 events. 1788/2666 cut-off events. For 1604/1691 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12890 event pairs, 1114 based on Foata normal form. 38/2471 useless extension candidates. Maximal degree in co-relation 4668. Up to 1826 conditions per place. [2025-03-09 01:26:42,410 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 74 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2025-03-09 01:26:42,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 445 flow [2025-03-09 01:26:42,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:26:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:26:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2025-03-09 01:26:42,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3875 [2025-03-09 01:26:42,413 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 145 flow. Second operand 8 states and 155 transitions. [2025-03-09 01:26:42,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 445 flow [2025-03-09 01:26:42,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 434 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:26:42,417 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 195 flow [2025-03-09 01:26:42,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=195, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2025-03-09 01:26:42,417 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2025-03-09 01:26:42,417 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 195 flow [2025-03-09 01:26:42,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 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:26:42,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:42,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:42,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:26:42,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:42,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:26:42,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:42,619 INFO L85 PathProgramCache]: Analyzing trace with hash 741636397, now seen corresponding path program 1 times [2025-03-09 01:26:42,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:42,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676651909] [2025-03-09 01:26:42,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:42,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:42,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:26:42,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:26:42,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:42,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:42,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:42,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676651909] [2025-03-09 01:26:42,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676651909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:42,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:42,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:26:42,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553438512] [2025-03-09 01:26:42,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:42,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:26:42,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:42,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:26:42,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:26:42,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-09 01:26:42,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:26:42,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:42,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-09 01:26:42,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:43,063 INFO L124 PetriNetUnfolderBase]: 1759/2715 cut-off events. [2025-03-09 01:26:43,063 INFO L125 PetriNetUnfolderBase]: For 3910/4000 co-relation queries the response was YES. [2025-03-09 01:26:43,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7613 conditions, 2715 events. 1759/2715 cut-off events. For 3910/4000 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13804 event pairs, 874 based on Foata normal form. 0/2504 useless extension candidates. Maximal degree in co-relation 4948. Up to 1692 conditions per place. [2025-03-09 01:26:43,080 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 58 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2025-03-09 01:26:43,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 445 flow [2025-03-09 01:26:43,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:26:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:26:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-03-09 01:26:43,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-03-09 01:26:43,081 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 195 flow. Second operand 5 states and 95 transitions. [2025-03-09 01:26:43,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 445 flow [2025-03-09 01:26:43,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 430 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 01:26:43,087 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 216 flow [2025-03-09 01:26:43,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2025-03-09 01:26:43,088 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2025-03-09 01:26:43,088 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 216 flow [2025-03-09 01:26:43,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:26:43,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:43,088 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:43,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:26:43,089 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:26:43,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:43,089 INFO L85 PathProgramCache]: Analyzing trace with hash 43660742, now seen corresponding path program 2 times [2025-03-09 01:26:43,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:43,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265623550] [2025-03-09 01:26:43,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:43,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:43,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:26:43,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:26:43,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:43,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:43,228 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:26:43,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:43,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265623550] [2025-03-09 01:26:43,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265623550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:43,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942000594] [2025-03-09 01:26:43,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:43,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:43,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:43,231 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:26:43,232 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:26:43,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:26:43,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:26:43,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:43,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:43,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:26:43,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:43,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:43,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-09 01:26:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:43,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942000594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:43,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:43,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-09 01:26:43,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333174508] [2025-03-09 01:26:43,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:43,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:26:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:43,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:26:43,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:26:43,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:43,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 216 flow. Second operand has 16 states, 16 states have (on average 11.125) internal successors, (178), 16 states have internal predecessors, (178), 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:26:43,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:43,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:43,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:44,286 INFO L124 PetriNetUnfolderBase]: 2578/3674 cut-off events. [2025-03-09 01:26:44,286 INFO L125 PetriNetUnfolderBase]: For 6611/6719 co-relation queries the response was YES. [2025-03-09 01:26:44,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12004 conditions, 3674 events. 2578/3674 cut-off events. For 6611/6719 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16899 event pairs, 556 based on Foata normal form. 0/3493 useless extension candidates. Maximal degree in co-relation 9027. Up to 999 conditions per place. [2025-03-09 01:26:44,300 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 123 selfloop transitions, 13 changer transitions 0/139 dead transitions. [2025-03-09 01:26:44,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 139 transitions, 920 flow [2025-03-09 01:26:44,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:26:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:26:44,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2025-03-09 01:26:44,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2025-03-09 01:26:44,304 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 216 flow. Second operand 11 states and 215 transitions. [2025-03-09 01:26:44,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 139 transitions, 920 flow [2025-03-09 01:26:44,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 139 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:44,312 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 252 flow [2025-03-09 01:26:44,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=252, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2025-03-09 01:26:44,312 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2025-03-09 01:26:44,312 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 252 flow [2025-03-09 01:26:44,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.125) internal successors, (178), 16 states have internal predecessors, (178), 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:26:44,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:44,312 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:44,319 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:26:44,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-09 01:26:44,513 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:26:44,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:44,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1880420139, now seen corresponding path program 2 times [2025-03-09 01:26:44,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:44,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611645821] [2025-03-09 01:26:44,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:44,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:44,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:26:44,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:26:44,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:44,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:26:44,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611645821] [2025-03-09 01:26:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611645821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446250044] [2025-03-09 01:26:44,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:44,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:44,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:44,706 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:26:44,708 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:26:44,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:26:44,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:26:44,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:44,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:44,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:26:44,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:44,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:44,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-09 01:26:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:44,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446250044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:44,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:44,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-09 01:26:44,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304565327] [2025-03-09 01:26:44,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:44,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:26:44,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:45,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:26:45,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:26:45,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:45,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 252 flow. Second operand has 20 states, 20 states have (on average 10.9) internal successors, (218), 20 states have internal predecessors, (218), 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:26:45,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:45,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:45,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:46,158 INFO L124 PetriNetUnfolderBase]: 3434/4821 cut-off events. [2025-03-09 01:26:46,159 INFO L125 PetriNetUnfolderBase]: For 7547/7834 co-relation queries the response was YES. [2025-03-09 01:26:46,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16699 conditions, 4821 events. 3434/4821 cut-off events. For 7547/7834 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 22823 event pairs, 475 based on Foata normal form. 172/4987 useless extension candidates. Maximal degree in co-relation 13098. Up to 954 conditions per place. [2025-03-09 01:26:46,182 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 166 selfloop transitions, 18 changer transitions 0/188 dead transitions. [2025-03-09 01:26:46,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 188 transitions, 1230 flow [2025-03-09 01:26:46,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:26:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:26:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 284 transitions. [2025-03-09 01:26:46,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4057142857142857 [2025-03-09 01:26:46,184 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 252 flow. Second operand 14 states and 284 transitions. [2025-03-09 01:26:46,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 188 transitions, 1230 flow [2025-03-09 01:26:46,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 188 transitions, 1174 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-03-09 01:26:46,194 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 303 flow [2025-03-09 01:26:46,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=303, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2025-03-09 01:26:46,194 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2025-03-09 01:26:46,195 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 303 flow [2025-03-09 01:26:46,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.9) internal successors, (218), 20 states have internal predecessors, (218), 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:26:46,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:46,195 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:46,203 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:26:46,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:46,399 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:26:46,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:46,399 INFO L85 PathProgramCache]: Analyzing trace with hash 778642587, now seen corresponding path program 1 times [2025-03-09 01:26:46,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:46,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318535629] [2025-03-09 01:26:46,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:46,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:46,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:26:46,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:26:46,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:46,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:46,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:46,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318535629] [2025-03-09 01:26:46,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318535629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:46,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568041201] [2025-03-09 01:26:46,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:46,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:46,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:46,490 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:26:46,491 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:26:46,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:26:46,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:26:46,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:46,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:46,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:26:46,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:46,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:46,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568041201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:46,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:46,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 01:26:46,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395237361] [2025-03-09 01:26:46,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:46,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:26:46,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:46,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:26:46,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:26:46,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:46,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 54 transitions, 303 flow. Second operand has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 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:26:46,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:46,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:46,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:47,150 INFO L124 PetriNetUnfolderBase]: 3196/4549 cut-off events. [2025-03-09 01:26:47,150 INFO L125 PetriNetUnfolderBase]: For 12554/12814 co-relation queries the response was YES. [2025-03-09 01:26:47,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16549 conditions, 4549 events. 3196/4549 cut-off events. For 12554/12814 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 20742 event pairs, 2017 based on Foata normal form. 34/4553 useless extension candidates. Maximal degree in co-relation 13631. Up to 3650 conditions per place. [2025-03-09 01:26:47,171 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 75 selfloop transitions, 10 changer transitions 0/91 dead transitions. [2025-03-09 01:26:47,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 91 transitions, 667 flow [2025-03-09 01:26:47,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:26:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:26:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2025-03-09 01:26:47,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.365 [2025-03-09 01:26:47,173 INFO L175 Difference]: Start difference. First operand has 73 places, 54 transitions, 303 flow. Second operand 8 states and 146 transitions. [2025-03-09 01:26:47,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 91 transitions, 667 flow [2025-03-09 01:26:47,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 582 flow, removed 9 selfloop flow, removed 10 redundant places. [2025-03-09 01:26:47,182 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 313 flow [2025-03-09 01:26:47,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=313, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2025-03-09 01:26:47,182 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2025-03-09 01:26:47,183 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 313 flow [2025-03-09 01:26:47,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 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:26:47,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:47,183 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:47,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:26:47,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:47,385 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:26:47,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash -183978225, now seen corresponding path program 2 times [2025-03-09 01:26:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:47,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30993393] [2025-03-09 01:26:47,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:47,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:47,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-09 01:26:47,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:26:47,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:47,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:26:47,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:47,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30993393] [2025-03-09 01:26:47,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30993393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:47,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511948798] [2025-03-09 01:26:47,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:47,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:47,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:47,519 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:26:47,520 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:26:47,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-09 01:26:47,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:26:47,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:47,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:47,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:26:47,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:26:47,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:47,938 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 35 treesize of output 31 [2025-03-09 01:26:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:26:47,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511948798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:47,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:47,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-03-09 01:26:47,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709690404] [2025-03-09 01:26:47,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:47,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:26:47,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:47,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:26:47,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:26:48,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:48,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 313 flow. Second operand has 19 states, 19 states have (on average 11.368421052631579) internal successors, (216), 19 states have internal predecessors, (216), 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:26:48,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:48,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:48,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:48,519 INFO L124 PetriNetUnfolderBase]: 3196/4498 cut-off events. [2025-03-09 01:26:48,519 INFO L125 PetriNetUnfolderBase]: For 8097/8325 co-relation queries the response was YES. [2025-03-09 01:26:48,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16007 conditions, 4498 events. 3196/4498 cut-off events. For 8097/8325 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 20463 event pairs, 673 based on Foata normal form. 103/4593 useless extension candidates. Maximal degree in co-relation 13140. Up to 1506 conditions per place. [2025-03-09 01:26:48,539 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 106 selfloop transitions, 13 changer transitions 0/125 dead transitions. [2025-03-09 01:26:48,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 125 transitions, 919 flow [2025-03-09 01:26:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:26:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:26:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2025-03-09 01:26:48,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3657142857142857 [2025-03-09 01:26:48,541 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 313 flow. Second operand 7 states and 128 transitions. [2025-03-09 01:26:48,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 125 transitions, 919 flow [2025-03-09 01:26:48,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 906 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 01:26:48,548 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 342 flow [2025-03-09 01:26:48,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2025-03-09 01:26:48,549 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2025-03-09 01:26:48,549 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 342 flow [2025-03-09 01:26:48,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.368421052631579) internal successors, (216), 19 states have internal predecessors, (216), 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:26:48,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:48,549 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:26:48,555 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:26:48,749 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,SelfDestructingSolverStorable12 [2025-03-09 01:26:48,749 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:26:48,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:48,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2043700778, now seen corresponding path program 1 times [2025-03-09 01:26:48,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:48,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74605026] [2025-03-09 01:26:48,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:48,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:48,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:26:48,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:26:48,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:48,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:26:48,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:48,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74605026] [2025-03-09 01:26:48,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74605026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:48,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:48,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:48,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712103053] [2025-03-09 01:26:48,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:48,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:26:48,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:48,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:26:48,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:26:48,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-09 01:26:48,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:26:48,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:48,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-09 01:26:48,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:49,055 INFO L124 PetriNetUnfolderBase]: 2704/4080 cut-off events. [2025-03-09 01:26:49,055 INFO L125 PetriNetUnfolderBase]: For 10574/10755 co-relation queries the response was YES. [2025-03-09 01:26:49,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15575 conditions, 4080 events. 2704/4080 cut-off events. For 10574/10755 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 19842 event pairs, 632 based on Foata normal form. 2/4068 useless extension candidates. Maximal degree in co-relation 12432. Up to 3332 conditions per place. [2025-03-09 01:26:49,077 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 69 selfloop transitions, 4 changer transitions 1/82 dead transitions. [2025-03-09 01:26:49,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 82 transitions, 615 flow [2025-03-09 01:26:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:26:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:26:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-03-09 01:26:49,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2025-03-09 01:26:49,078 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 342 flow. Second operand 3 states and 74 transitions. [2025-03-09 01:26:49,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 82 transitions, 615 flow [2025-03-09 01:26:49,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 82 transitions, 581 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-09 01:26:49,089 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 346 flow [2025-03-09 01:26:49,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2025-03-09 01:26:49,091 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2025-03-09 01:26:49,091 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 346 flow [2025-03-09 01:26:49,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:26:49,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:49,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:49,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:26:49,092 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:26:49,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:49,092 INFO L85 PathProgramCache]: Analyzing trace with hash 52912290, now seen corresponding path program 1 times [2025-03-09 01:26:49,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:49,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586672677] [2025-03-09 01:26:49,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:49,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:49,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:26:49,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:26:49,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:49,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:49,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586672677] [2025-03-09 01:26:49,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586672677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:49,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534968984] [2025-03-09 01:26:49,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:49,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:49,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:49,172 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:26:49,178 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:26:49,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:26:49,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:26:49,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:49,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:49,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:26:49,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:49,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:49,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534968984] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:49,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:26:49,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-03-09 01:26:49,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112085149] [2025-03-09 01:26:49,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:49,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:26:49,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:49,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:26:49,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:26:49,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:49,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:26:49,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:49,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:49,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:49,517 INFO L124 PetriNetUnfolderBase]: 3264/4718 cut-off events. [2025-03-09 01:26:49,517 INFO L125 PetriNetUnfolderBase]: For 11401/11610 co-relation queries the response was YES. [2025-03-09 01:26:49,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17782 conditions, 4718 events. 3264/4718 cut-off events. For 11401/11610 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 22544 event pairs, 929 based on Foata normal form. 142/4768 useless extension candidates. Maximal degree in co-relation 14717. Up to 2677 conditions per place. [2025-03-09 01:26:49,536 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 72 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2025-03-09 01:26:49,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 87 transitions, 657 flow [2025-03-09 01:26:49,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:26:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:26:49,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-03-09 01:26:49,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.352 [2025-03-09 01:26:49,538 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 346 flow. Second operand 5 states and 88 transitions. [2025-03-09 01:26:49,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 87 transitions, 657 flow [2025-03-09 01:26:49,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 87 transitions, 633 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:49,550 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 356 flow [2025-03-09 01:26:49,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2025-03-09 01:26:49,550 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2025-03-09 01:26:49,550 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 356 flow [2025-03-09 01:26:49,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:26:49,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:49,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:49,557 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:26:49,751 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,SelfDestructingSolverStorable14 [2025-03-09 01:26:49,751 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:26:49,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash 458515338, now seen corresponding path program 1 times [2025-03-09 01:26:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:49,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283636720] [2025-03-09 01:26:49,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:49,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:26:49,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:26:49,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:49,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 01:26:49,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:49,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283636720] [2025-03-09 01:26:49,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283636720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:49,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:49,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:26:49,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593713545] [2025-03-09 01:26:49,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:49,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:49,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:49,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:49,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:49,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:49,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:26:49,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:49,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:49,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:50,019 INFO L124 PetriNetUnfolderBase]: 2927/4251 cut-off events. [2025-03-09 01:26:50,019 INFO L125 PetriNetUnfolderBase]: For 12177/12401 co-relation queries the response was YES. [2025-03-09 01:26:50,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16036 conditions, 4251 events. 2927/4251 cut-off events. For 12177/12401 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 20310 event pairs, 912 based on Foata normal form. 141/4287 useless extension candidates. Maximal degree in co-relation 13417. Up to 2246 conditions per place. [2025-03-09 01:26:50,037 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 68 selfloop transitions, 8 changer transitions 0/83 dead transitions. [2025-03-09 01:26:50,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 83 transitions, 642 flow [2025-03-09 01:26:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-09 01:26:50,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-03-09 01:26:50,038 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 356 flow. Second operand 4 states and 76 transitions. [2025-03-09 01:26:50,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 83 transitions, 642 flow [2025-03-09 01:26:50,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 83 transitions, 619 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-09 01:26:50,046 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 339 flow [2025-03-09 01:26:50,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=339, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2025-03-09 01:26:50,046 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2025-03-09 01:26:50,046 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 339 flow [2025-03-09 01:26:50,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:26:50,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:50,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:50,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:26:50,047 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:26:50,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash -372921764, now seen corresponding path program 1 times [2025-03-09 01:26:50,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:50,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604140818] [2025-03-09 01:26:50,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:50,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:50,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:26:50,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:26:50,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:50,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:26:50,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:50,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604140818] [2025-03-09 01:26:50,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604140818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:50,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666812648] [2025-03-09 01:26:50,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:50,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:50,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:50,592 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:26:50,593 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:26:50,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:26:50,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:26:50,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:50,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:50,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 01:26:50,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:50,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 01:26:51,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 61 [2025-03-09 01:26:51,043 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 61 treesize of output 57 [2025-03-09 01:26:51,045 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 57 treesize of output 53 [2025-03-09 01:26:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:51,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:51,566 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 177 treesize of output 173 [2025-03-09 01:26:51,569 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 173 treesize of output 169 [2025-03-09 01:26:52,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2025-03-09 01:26:52,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:26:52,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 122 [2025-03-09 01:26:52,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 205 [2025-03-09 01:26:52,747 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-03-09 01:26:52,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 311 treesize of output 1 [2025-03-09 01:26:52,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 187 [2025-03-09 01:26:52,761 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-03-09 01:26:52,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 235 treesize of output 1 [2025-03-09 01:26:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:52,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666812648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:52,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:52,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-03-09 01:26:52,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634641923] [2025-03-09 01:26:52,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:52,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 01:26:52,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:52,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 01:26:52,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:26:53,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-09 01:26:53,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 339 flow. Second operand has 25 states, 25 states have (on average 11.12) internal successors, (278), 25 states have internal predecessors, (278), 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:26:53,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:53,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-09 01:26:53,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:55,704 INFO L124 PetriNetUnfolderBase]: 4862/7118 cut-off events. [2025-03-09 01:26:55,704 INFO L125 PetriNetUnfolderBase]: For 17645/17923 co-relation queries the response was YES. [2025-03-09 01:26:55,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27131 conditions, 7118 events. 4862/7118 cut-off events. For 17645/17923 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 36497 event pairs, 562 based on Foata normal form. 5/7122 useless extension candidates. Maximal degree in co-relation 21130. Up to 4870 conditions per place. [2025-03-09 01:26:55,727 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 155 selfloop transitions, 49 changer transitions 83/290 dead transitions. [2025-03-09 01:26:55,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 290 transitions, 2034 flow [2025-03-09 01:26:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-09 01:26:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-09 01:26:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 502 transitions. [2025-03-09 01:26:55,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33466666666666667 [2025-03-09 01:26:55,729 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 339 flow. Second operand 30 states and 502 transitions. [2025-03-09 01:26:55,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 290 transitions, 2034 flow [2025-03-09 01:26:55,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 290 transitions, 1984 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:26:55,748 INFO L231 Difference]: Finished difference. Result has 118 places, 98 transitions, 753 flow [2025-03-09 01:26:55,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=753, PETRI_PLACES=118, PETRI_TRANSITIONS=98} [2025-03-09 01:26:55,749 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 66 predicate places. [2025-03-09 01:26:55,749 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 98 transitions, 753 flow [2025-03-09 01:26:55,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.12) internal successors, (278), 25 states have internal predecessors, (278), 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:26:55,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:55,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:55,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:26:55,949 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,SelfDestructingSolverStorable16 [2025-03-09 01:26:55,949 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:26:55,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:55,950 INFO L85 PathProgramCache]: Analyzing trace with hash 973833020, now seen corresponding path program 2 times [2025-03-09 01:26:55,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:55,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398675230] [2025-03-09 01:26:55,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:55,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:55,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:26:55,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:26:55,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:55,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:26:56,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:56,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398675230] [2025-03-09 01:26:56,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398675230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:56,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204549306] [2025-03-09 01:26:56,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:56,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:56,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:56,248 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:26:56,249 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:26:56,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:26:56,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:26:56,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:56,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:56,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 01:26:56,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:56,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 01:26:56,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 51 [2025-03-09 01:26:56,643 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 51 treesize of output 47 [2025-03-09 01:26:56,644 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 47 treesize of output 43 [2025-03-09 01:26:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:56,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:56,886 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 177 treesize of output 173 [2025-03-09 01:26:56,888 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 173 treesize of output 169 [2025-03-09 01:26:58,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 264 [2025-03-09 01:26:58,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:26:58,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 387 treesize of output 389 [2025-03-09 01:27:14,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 228 [2025-03-09 01:27:14,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:27:14,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 281 treesize of output 311 [2025-03-09 01:27:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:40,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204549306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:40,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:40,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-03-09 01:27:40,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380454924] [2025-03-09 01:27:40,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:40,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 01:27:40,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:40,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 01:27:40,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:27:40,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:27:40,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 98 transitions, 753 flow. Second operand has 25 states, 25 states have (on average 11.88) internal successors, (297), 25 states have internal predecessors, (297), 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,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:40,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:27:40,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:42,572 INFO L124 PetriNetUnfolderBase]: 3966/6146 cut-off events. [2025-03-09 01:27:42,572 INFO L125 PetriNetUnfolderBase]: For 24971/25221 co-relation queries the response was YES. [2025-03-09 01:27:42,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26806 conditions, 6146 events. 3966/6146 cut-off events. For 24971/25221 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 34818 event pairs, 670 based on Foata normal form. 8/5986 useless extension candidates. Maximal degree in co-relation 26746. Up to 4770 conditions per place. [2025-03-09 01:27:42,608 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 144 selfloop transitions, 81 changer transitions 35/271 dead transitions. [2025-03-09 01:27:42,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 271 transitions, 2505 flow [2025-03-09 01:27:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-09 01:27:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-09 01:27:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 439 transitions. [2025-03-09 01:27:42,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3027586206896552 [2025-03-09 01:27:42,610 INFO L175 Difference]: Start difference. First operand has 118 places, 98 transitions, 753 flow. Second operand 29 states and 439 transitions. [2025-03-09 01:27:42,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 271 transitions, 2505 flow [2025-03-09 01:27:42,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 271 transitions, 2313 flow, removed 76 selfloop flow, removed 11 redundant places. [2025-03-09 01:27:42,649 INFO L231 Difference]: Finished difference. Result has 143 places, 163 transitions, 1537 flow [2025-03-09 01:27:42,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1537, PETRI_PLACES=143, PETRI_TRANSITIONS=163} [2025-03-09 01:27:42,649 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 91 predicate places. [2025-03-09 01:27:42,649 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 163 transitions, 1537 flow [2025-03-09 01:27:42,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.88) internal successors, (297), 25 states have internal predecessors, (297), 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:42,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:42,650 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:42,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 01:27:42,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:27:42,850 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:42,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:42,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1276342224, now seen corresponding path program 3 times [2025-03-09 01:27:42,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:42,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801814653] [2025-03-09 01:27:42,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:27:42,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:42,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-09 01:27:42,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-03-09 01:27:42,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:27:42,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:43,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:43,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801814653] [2025-03-09 01:27:43,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801814653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:43,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:43,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:43,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102402097] [2025-03-09 01:27:43,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:43,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:43,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:43,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:43,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:43,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:27:43,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 163 transitions, 1537 flow. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 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:43,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:43,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:27:43,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:43,845 INFO L124 PetriNetUnfolderBase]: 3876/6083 cut-off events. [2025-03-09 01:27:43,845 INFO L125 PetriNetUnfolderBase]: For 31312/31610 co-relation queries the response was YES. [2025-03-09 01:27:43,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28845 conditions, 6083 events. 3876/6083 cut-off events. For 31312/31610 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 34997 event pairs, 705 based on Foata normal form. 32/5949 useless extension candidates. Maximal degree in co-relation 27996. Up to 5137 conditions per place. [2025-03-09 01:27:43,879 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 163 selfloop transitions, 69 changer transitions 14/257 dead transitions. [2025-03-09 01:27:43,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 257 transitions, 2818 flow [2025-03-09 01:27:43,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2025-03-09 01:27:43,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3418181818181818 [2025-03-09 01:27:43,881 INFO L175 Difference]: Start difference. First operand has 143 places, 163 transitions, 1537 flow. Second operand 11 states and 188 transitions. [2025-03-09 01:27:43,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 257 transitions, 2818 flow [2025-03-09 01:27:43,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 257 transitions, 2664 flow, removed 67 selfloop flow, removed 7 redundant places. [2025-03-09 01:27:43,927 INFO L231 Difference]: Finished difference. Result has 150 places, 199 transitions, 2044 flow [2025-03-09 01:27:43,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2044, PETRI_PLACES=150, PETRI_TRANSITIONS=199} [2025-03-09 01:27:43,927 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 98 predicate places. [2025-03-09 01:27:43,927 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 199 transitions, 2044 flow [2025-03-09 01:27:43,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 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:43,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:43,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:43,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:27:43,928 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:43,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:43,928 INFO L85 PathProgramCache]: Analyzing trace with hash 128569862, now seen corresponding path program 4 times [2025-03-09 01:27:43,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:43,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085139965] [2025-03-09 01:27:43,929 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:27:43,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:43,936 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:27:43,947 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:27:43,948 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:27:43,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:44,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:44,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085139965] [2025-03-09 01:27:44,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085139965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:44,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249350072] [2025-03-09 01:27:44,259 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:27:44,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:44,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:44,261 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:44,262 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:44,302 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:27:44,319 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:27:44,320 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:27:44,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:44,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 01:27:44,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:44,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 01:27:44,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 51 [2025-03-09 01:27:44,575 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 51 treesize of output 47 [2025-03-09 01:27:44,576 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 47 treesize of output 43 [2025-03-09 01:27:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:44,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:44,783 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 173 treesize of output 169 [2025-03-09 01:27:44,788 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 169 treesize of output 165 [2025-03-09 01:27:46,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2025-03-09 01:27:46,408 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 116 treesize of output 106 [2025-03-09 01:27:46,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2025-03-09 01:27:46,475 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 76 treesize of output 68 [2025-03-09 01:27:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:46,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249350072] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:46,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:46,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 27 [2025-03-09 01:27:46,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986368859] [2025-03-09 01:27:46,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:46,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:27:46,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:46,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:27:46,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:27:46,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:27:46,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 199 transitions, 2044 flow. Second operand has 28 states, 28 states have (on average 11.357142857142858) internal successors, (318), 28 states have internal predecessors, (318), 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:46,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:46,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:27:46,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:48,623 INFO L124 PetriNetUnfolderBase]: 5031/7876 cut-off events. [2025-03-09 01:27:48,623 INFO L125 PetriNetUnfolderBase]: For 44788/45128 co-relation queries the response was YES. [2025-03-09 01:27:48,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38181 conditions, 7876 events. 5031/7876 cut-off events. For 44788/45128 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 47426 event pairs, 917 based on Foata normal form. 24/7726 useless extension candidates. Maximal degree in co-relation 37301. Up to 5695 conditions per place. [2025-03-09 01:27:48,685 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 219 selfloop transitions, 164 changer transitions 19/413 dead transitions. [2025-03-09 01:27:48,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 413 transitions, 4709 flow [2025-03-09 01:27:48,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-09 01:27:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-09 01:27:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 393 transitions. [2025-03-09 01:27:48,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3144 [2025-03-09 01:27:48,686 INFO L175 Difference]: Start difference. First operand has 150 places, 199 transitions, 2044 flow. Second operand 25 states and 393 transitions. [2025-03-09 01:27:48,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 413 transitions, 4709 flow [2025-03-09 01:27:48,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 413 transitions, 4582 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-03-09 01:27:48,786 INFO L231 Difference]: Finished difference. Result has 183 places, 300 transitions, 3716 flow [2025-03-09 01:27:48,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3716, PETRI_PLACES=183, PETRI_TRANSITIONS=300} [2025-03-09 01:27:48,786 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 131 predicate places. [2025-03-09 01:27:48,786 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 300 transitions, 3716 flow [2025-03-09 01:27:48,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.357142857142858) internal successors, (318), 28 states have internal predecessors, (318), 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:48,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:48,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:48,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 01:27:48,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:48,987 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:48,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:48,988 INFO L85 PathProgramCache]: Analyzing trace with hash -423229862, now seen corresponding path program 5 times [2025-03-09 01:27:48,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:48,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630814354] [2025-03-09 01:27:48,988 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:27:48,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:48,992 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-09 01:27:49,002 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:27:49,005 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:27:49,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:49,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:49,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630814354] [2025-03-09 01:27:49,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630814354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:49,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178741926] [2025-03-09 01:27:49,395 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:27:49,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:49,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:49,397 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:49,399 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:49,435 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-09 01:27:49,452 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:27:49,452 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:27:49,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:49,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 01:27:49,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:49,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 01:27:49,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 51 [2025-03-09 01:27:49,719 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 51 treesize of output 47 [2025-03-09 01:27:49,721 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 47 treesize of output 43 [2025-03-09 01:27:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:49,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:49,961 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 169 treesize of output 165 [2025-03-09 01:27:49,963 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 165 treesize of output 161 [2025-03-09 01:27:51,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 264 [2025-03-09 01:27:51,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:27:51,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 387 treesize of output 389