./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-max-array.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.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 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:26:38,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:26:38,761 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:38,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:26:38,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:26:38,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:26:38,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:26:38,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:26:38,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:26:38,787 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:26:38,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:26:38,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:26:38,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:26:38,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:26:38,787 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:26:38,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:26:38,787 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:26:38,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:26:38,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:26:38,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:26:38,788 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:26:38,788 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:26:38,788 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:26:38,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:26:38,788 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:26:38,788 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:26:38,788 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:26:38,788 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:26:38,789 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:26:38,789 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:26:38,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:26:38,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:26:38,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:26:38,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:26:38,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:26:38,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:26:38,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:26:38,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:26:38,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:26:38,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:26:38,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:26:38,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:26:38,790 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 -> 573af40880ce1d61666f10a2729c7d6ecdb02e81781df2543efcfdd5788ab6d6 [2025-03-09 01:26:39,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:26:39,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:26:39,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:26:39,039 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:26:39,039 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:26:39,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2025-03-09 01:26:40,161 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cabffc2cb/5223b30f6d144c8788e4938d7ca1dd58/FLAG3f14384ca [2025-03-09 01:26:40,386 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:26:40,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array.wvr.c [2025-03-09 01:26:40,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cabffc2cb/5223b30f6d144c8788e4938d7ca1dd58/FLAG3f14384ca [2025-03-09 01:26:40,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cabffc2cb/5223b30f6d144c8788e4938d7ca1dd58 [2025-03-09 01:26:40,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:26:40,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:26:40,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:26:40,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:26:40,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:26:40,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:26:40" (1/1) ... [2025-03-09 01:26:40,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58094e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:40, skipping insertion in model container [2025-03-09 01:26:40,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:26:40" (1/1) ... [2025-03-09 01:26:40,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:26:40,865 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:40,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:26:40,877 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:26:40,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:26:40,912 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:26:40,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:40 WrapperNode [2025-03-09 01:26:40,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:26:40,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:26:40,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:26:40,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:26:40,919 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:40" (1/1) ... [2025-03-09 01:26:40,924 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:40" (1/1) ... [2025-03-09 01:26:40,941 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2025-03-09 01:26:40,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:26:40,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:26:40,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:26:40,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:26:40,952 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:40" (1/1) ... [2025-03-09 01:26:40,953 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:40" (1/1) ... [2025-03-09 01:26:40,959 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:40" (1/1) ... [2025-03-09 01:26:40,975 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:40,975 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:40" (1/1) ... [2025-03-09 01:26:40,976 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:40" (1/1) ... [2025-03-09 01:26:40,984 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:40" (1/1) ... [2025-03-09 01:26:40,985 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:40" (1/1) ... [2025-03-09 01:26:40,985 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:40" (1/1) ... [2025-03-09 01:26:40,986 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:40" (1/1) ... [2025-03-09 01:26:40,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:26:40,994 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:26:40,994 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:26:40,994 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:26:40,995 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:40" (1/1) ... [2025-03-09 01:26:41,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:26:41,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:41,027 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:41,030 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:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:26:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:26:41,049 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:26:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:26:41,049 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:26:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:26:41,049 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:26:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:26:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:26:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:26:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:26:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:26:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:26:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:26:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:26:41,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:26:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:26:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:26:41,051 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:41,122 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:26:41,124 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:26:41,348 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:26:41,348 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:26:41,499 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:26:41,500 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:26:41,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:26:41 BoogieIcfgContainer [2025-03-09 01:26:41,500 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:26:41,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:26:41,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:26:41,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:26:41,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:26:40" (1/3) ... [2025-03-09 01:26:41,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79eafad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:26:41, skipping insertion in model container [2025-03-09 01:26:41,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:26:40" (2/3) ... [2025-03-09 01:26:41,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79eafad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:26:41, skipping insertion in model container [2025-03-09 01:26:41,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:26:41" (3/3) ... [2025-03-09 01:26:41,507 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2025-03-09 01:26:41,518 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:26:41,519 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-max-array.wvr.c that has 4 procedures, 47 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-03-09 01:26:41,520 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:26:41,585 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:26:41,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 121 flow [2025-03-09 01:26:41,658 INFO L124 PetriNetUnfolderBase]: 4/47 cut-off events. [2025-03-09 01:26:41,659 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:26:41,663 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:41,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 121 flow [2025-03-09 01:26:41,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 46 transitions, 110 flow [2025-03-09 01:26:41,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:26:41,694 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;@aea8b66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:26:41,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-09 01:26:41,696 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:26:41,696 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:26:41,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:26:41,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:41,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:26:41,697 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:41,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:41,702 INFO L85 PathProgramCache]: Analyzing trace with hash 403274, now seen corresponding path program 1 times [2025-03-09 01:26:41,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:41,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122482870] [2025-03-09 01:26:41,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:41,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:41,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:26:41,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:26:41,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:41,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:41,881 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:41,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:41,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122482870] [2025-03-09 01:26:41,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122482870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:41,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:41,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:26:41,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755148870] [2025-03-09 01:26:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:41,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:26:41,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:41,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:26:41,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:26:41,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:41,922 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:41,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:41,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:41,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:42,214 INFO L124 PetriNetUnfolderBase]: 1316/1960 cut-off events. [2025-03-09 01:26:42,214 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-09 01:26:42,219 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:42,231 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 30 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-09 01:26:42,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 156 flow [2025-03-09 01:26:42,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:26:42,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:26:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-03-09 01:26:42,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2025-03-09 01:26:42,248 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:42,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 156 flow [2025-03-09 01:26:42,252 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:42,253 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 84 flow [2025-03-09 01:26:42,255 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:42,258 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -13 predicate places. [2025-03-09 01:26:42,259 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 84 flow [2025-03-09 01:26:42,260 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:42,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:42,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:26:42,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:26:42,260 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:42,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:42,261 INFO L85 PathProgramCache]: Analyzing trace with hash 403275, now seen corresponding path program 1 times [2025-03-09 01:26:42,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:42,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986629258] [2025-03-09 01:26:42,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:42,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:26:42,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:26:42,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:42,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:42,472 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:42,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:42,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986629258] [2025-03-09 01:26:42,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986629258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:42,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:42,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:42,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192449300] [2025-03-09 01:26:42,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:42,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:42,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:42,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:42,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:42,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:42,478 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:42,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:42,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:42,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:42,662 INFO L124 PetriNetUnfolderBase]: 1317/1963 cut-off events. [2025-03-09 01:26:42,662 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-09 01:26:42,664 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:42,670 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 32 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-03-09 01:26:42,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 164 flow [2025-03-09 01:26:42,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:42,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-03-09 01:26:42,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.365 [2025-03-09 01:26:42,671 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:42,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 164 flow [2025-03-09 01:26:42,672 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:42,673 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 107 flow [2025-03-09 01:26:42,673 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:42,673 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2025-03-09 01:26:42,674 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 107 flow [2025-03-09 01:26:42,674 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:42,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:42,674 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:26:42,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:26:42,674 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:42,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:42,674 INFO L85 PathProgramCache]: Analyzing trace with hash 387559423, now seen corresponding path program 1 times [2025-03-09 01:26:42,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:42,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463399553] [2025-03-09 01:26:42,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:42,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:42,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:26:42,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:26:42,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:42,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:42,884 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:42,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:42,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463399553] [2025-03-09 01:26:42,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463399553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:42,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617979476] [2025-03-09 01:26:42,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:42,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:42,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:42,887 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:42,889 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:42,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:26:42,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:26:42,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:42,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:42,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:26:42,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:42,976 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:43,063 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:43,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:43,124 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:43,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617979476] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:43,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:43,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:26:43,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247472999] [2025-03-09 01:26:43,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:43,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:26:43,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:43,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:26:43,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:26:43,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:43,148 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:43,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:43,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:43,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:43,445 INFO L124 PetriNetUnfolderBase]: 1318/1965 cut-off events. [2025-03-09 01:26:43,446 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-09 01:26:43,448 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:43,456 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 28 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2025-03-09 01:26:43,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 191 flow [2025-03-09 01:26:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:26:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:26:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2025-03-09 01:26:43,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28 [2025-03-09 01:26:43,458 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:43,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 191 flow [2025-03-09 01:26:43,459 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:43,459 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 132 flow [2025-03-09 01:26:43,460 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:43,460 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-03-09 01:26:43,460 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 132 flow [2025-03-09 01:26:43,460 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:43,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:43,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:26:43,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:26:43,666 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:43,666 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:43,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:43,669 INFO L85 PathProgramCache]: Analyzing trace with hash -867832120, now seen corresponding path program 1 times [2025-03-09 01:26:43,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:43,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229816610] [2025-03-09 01:26:43,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:43,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:43,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:26:43,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:26:43,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:43,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:43,722 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:43,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:43,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229816610] [2025-03-09 01:26:43,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229816610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:43,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:43,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:43,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461882881] [2025-03-09 01:26:43,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:43,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:43,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:43,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:43,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:43,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:43,733 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:43,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:43,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:43,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:43,857 INFO L124 PetriNetUnfolderBase]: 794/1200 cut-off events. [2025-03-09 01:26:43,857 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-09 01:26:43,860 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:43,865 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 31 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-03-09 01:26:43,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 196 flow [2025-03-09 01:26:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-03-09 01:26:43,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34 [2025-03-09 01:26:43,866 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:43,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 196 flow [2025-03-09 01:26:43,867 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:43,867 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 92 flow [2025-03-09 01:26:43,867 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:43,868 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -12 predicate places. [2025-03-09 01:26:43,868 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 92 flow [2025-03-09 01:26:43,868 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:43,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:43,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:26:43,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:26:43,868 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:43,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash -867832119, now seen corresponding path program 1 times [2025-03-09 01:26:43,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:43,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228181801] [2025-03-09 01:26:43,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:43,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:43,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:26:43,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:26:43,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:43,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:43,914 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:43,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228181801] [2025-03-09 01:26:43,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228181801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:43,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:43,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:43,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354915178] [2025-03-09 01:26:43,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:43,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:26:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:43,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:26:43,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:26:43,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-09 01:26:43,925 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:43,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:43,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-09 01:26:43,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:44,034 INFO L124 PetriNetUnfolderBase]: 793/1199 cut-off events. [2025-03-09 01:26:44,035 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-09 01:26:44,036 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:44,040 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 32 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-03-09 01:26:44,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2025-03-09 01:26:44,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:26:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:26:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-09 01:26:44,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41333333333333333 [2025-03-09 01:26:44,041 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:44,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2025-03-09 01:26:44,042 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:44,042 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 88 flow [2025-03-09 01:26:44,043 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:44,043 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -12 predicate places. [2025-03-09 01:26:44,043 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 88 flow [2025-03-09 01:26:44,043 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:44,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:44,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:44,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:26:44,044 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:44,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:44,044 INFO L85 PathProgramCache]: Analyzing trace with hash 913783189, now seen corresponding path program 1 times [2025-03-09 01:26:44,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:44,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708351240] [2025-03-09 01:26:44,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:44,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:44,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:26:44,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:26:44,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:44,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:44,199 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:44,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:44,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708351240] [2025-03-09 01:26:44,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708351240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:44,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069918324] [2025-03-09 01:26:44,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:44,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:44,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:44,204 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:44,205 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:44,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:26:44,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:26:44,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:44,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:44,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:26:44,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:44,314 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:44,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:44,351 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:44,365 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:44,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069918324] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:44,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:44,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 01:26:44,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283390374] [2025-03-09 01:26:44,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:44,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:26:44,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:44,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:26:44,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:26:44,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-09 01:26:44,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 88 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 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,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:44,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-09 01:26:44,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:44,652 INFO L124 PetriNetUnfolderBase]: 1149/1730 cut-off events. [2025-03-09 01:26:44,652 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-09 01:26:44,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3402 conditions, 1730 events. 1149/1730 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8453 event pairs, 483 based on Foata normal form. 0/1496 useless extension candidates. Maximal degree in co-relation 3391. Up to 988 conditions per place. [2025-03-09 01:26:44,659 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 58 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2025-03-09 01:26:44,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 292 flow [2025-03-09 01:26:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:26:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:26:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-03-09 01:26:44,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2025-03-09 01:26:44,662 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 88 flow. Second operand 7 states and 135 transitions. [2025-03-09 01:26:44,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 292 flow [2025-03-09 01:26:44,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:44,664 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 124 flow [2025-03-09 01:26:44,664 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=7, PETRI_FLOW=124, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-03-09 01:26:44,666 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2025-03-09 01:26:44,666 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 124 flow [2025-03-09 01:26:44,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 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,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:44,667 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:44,673 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:44,867 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:44,867 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:44,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:44,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1938104186, now seen corresponding path program 1 times [2025-03-09 01:26:44,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:44,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344523113] [2025-03-09 01:26:44,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:44,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:44,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:26:44,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:26:44,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:44,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:44,938 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:44,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:44,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344523113] [2025-03-09 01:26:44,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344523113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:44,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531699475] [2025-03-09 01:26:44,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:44,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:44,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:44,942 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:44,943 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:44,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:26:44,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:26:44,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:44,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:44,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:26:44,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:45,037 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:45,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:45,083 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:45,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531699475] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:45,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:45,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 01:26:45,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100151272] [2025-03-09 01:26:45,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:45,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:26:45,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:45,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:26:45,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:26:45,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:45,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 124 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:45,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:45,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:45,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:45,419 INFO L124 PetriNetUnfolderBase]: 1981/2960 cut-off events. [2025-03-09 01:26:45,419 INFO L125 PetriNetUnfolderBase]: For 1766/1766 co-relation queries the response was YES. [2025-03-09 01:26:45,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7226 conditions, 2960 events. 1981/2960 cut-off events. For 1766/1766 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 14688 event pairs, 1312 based on Foata normal form. 0/2644 useless extension candidates. Maximal degree in co-relation 4884. Up to 1931 conditions per place. [2025-03-09 01:26:45,431 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 72 selfloop transitions, 8 changer transitions 0/83 dead transitions. [2025-03-09 01:26:45,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 83 transitions, 424 flow [2025-03-09 01:26:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:26:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:26:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-03-09 01:26:45,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2025-03-09 01:26:45,433 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 124 flow. Second operand 7 states and 135 transitions. [2025-03-09 01:26:45,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 83 transitions, 424 flow [2025-03-09 01:26:45,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 83 transitions, 418 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:26:45,436 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 149 flow [2025-03-09 01:26:45,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2025-03-09 01:26:45,437 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2025-03-09 01:26:45,437 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 149 flow [2025-03-09 01:26:45,437 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:45,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:45,437 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:45,443 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:45,637 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:45,638 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:45,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:45,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1012751775, now seen corresponding path program 1 times [2025-03-09 01:26:45,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:45,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370589419] [2025-03-09 01:26:45,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:45,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:45,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:26:45,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:26:45,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:45,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:45,711 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:45,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:45,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370589419] [2025-03-09 01:26:45,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370589419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:45,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302835978] [2025-03-09 01:26:45,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:45,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:45,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:45,713 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:45,714 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:45,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:26:45,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:26:45,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:45,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:45,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:26:45,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:45,817 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:45,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:45,860 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:45,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302835978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:45,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:45,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 01:26:45,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367480911] [2025-03-09 01:26:45,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:45,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:26:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:45,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:26:45,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:26:45,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:45,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 149 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:45,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:45,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:45,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:46,148 INFO L124 PetriNetUnfolderBase]: 1935/2877 cut-off events. [2025-03-09 01:26:46,148 INFO L125 PetriNetUnfolderBase]: For 1671/1767 co-relation queries the response was YES. [2025-03-09 01:26:46,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7349 conditions, 2877 events. 1935/2877 cut-off events. For 1671/1767 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14036 event pairs, 1243 based on Foata normal form. 38/2659 useless extension candidates. Maximal degree in co-relation 5182. Up to 2035 conditions per place. [2025-03-09 01:26:46,163 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 75 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2025-03-09 01:26:46,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 88 transitions, 451 flow [2025-03-09 01:26:46,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:26:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:26:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2025-03-09 01:26:46,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3875 [2025-03-09 01:26:46,166 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 149 flow. Second operand 8 states and 155 transitions. [2025-03-09 01:26:46,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 88 transitions, 451 flow [2025-03-09 01:26:46,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 440 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:26:46,171 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 199 flow [2025-03-09 01:26:46,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=199, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-03-09 01:26:46,172 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-03-09 01:26:46,172 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 199 flow [2025-03-09 01:26:46,173 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:46,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:46,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:46,178 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:46,374 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:46,374 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:46,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:46,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1529452627, now seen corresponding path program 1 times [2025-03-09 01:26:46,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:46,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413313389] [2025-03-09 01:26:46,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:46,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:46,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:26:46,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:26:46,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:46,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:46,529 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:46,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:46,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413313389] [2025-03-09 01:26:46,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413313389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:46,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834339392] [2025-03-09 01:26:46,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:46,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:46,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:46,532 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:46,533 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:46,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:26:46,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:26:46,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:46,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:46,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:26:46,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:46,675 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:46,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:26:46,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834339392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:46,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:26:46,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2025-03-09 01:26:46,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873550178] [2025-03-09 01:26:46,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:46,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:26:46,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:46,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:26:46,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:26:46,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-09 01:26:46,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 199 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:46,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:46,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-09 01:26:46,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:46,924 INFO L124 PetriNetUnfolderBase]: 2208/3366 cut-off events. [2025-03-09 01:26:46,924 INFO L125 PetriNetUnfolderBase]: For 4370/4489 co-relation queries the response was YES. [2025-03-09 01:26:46,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9341 conditions, 3366 events. 2208/3366 cut-off events. For 4370/4489 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17557 event pairs, 1202 based on Foata normal form. 0/3116 useless extension candidates. Maximal degree in co-relation 6326. Up to 2353 conditions per place. [2025-03-09 01:26:46,938 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 62 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2025-03-09 01:26:46,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 461 flow [2025-03-09 01:26:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:26:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:26:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-03-09 01:26:46,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.384 [2025-03-09 01:26:46,939 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 199 flow. Second operand 5 states and 96 transitions. [2025-03-09 01:26:46,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 461 flow [2025-03-09 01:26:46,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 446 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 01:26:46,944 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 211 flow [2025-03-09 01:26:46,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2025-03-09 01:26:46,944 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2025-03-09 01:26:46,944 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 211 flow [2025-03-09 01:26:46,944 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:46,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:46,945 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:46,950 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:47,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:47,149 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:47,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:47,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2067539014, now seen corresponding path program 2 times [2025-03-09 01:26:47,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:47,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821914330] [2025-03-09 01:26:47,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:47,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:47,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:26:47,159 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:47,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:47,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:47,256 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:47,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:47,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821914330] [2025-03-09 01:26:47,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821914330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:47,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769437067] [2025-03-09 01:26:47,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:47,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:47,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:47,259 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:47,260 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:47,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:26:47,304 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:47,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:47,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:47,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:26:47,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:47,313 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:47,386 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:47,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:47,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769437067] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:47,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:26:47,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 15 [2025-03-09 01:26:47,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696065412] [2025-03-09 01:26:47,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:47,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:26:47,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:47,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:26:47,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:26:47,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-09 01:26:47,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 211 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:47,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-09 01:26:47,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:47,770 INFO L124 PetriNetUnfolderBase]: 2645/3980 cut-off events. [2025-03-09 01:26:47,771 INFO L125 PetriNetUnfolderBase]: For 5293/5428 co-relation queries the response was YES. [2025-03-09 01:26:47,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11962 conditions, 3980 events. 2645/3980 cut-off events. For 5293/5428 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 20432 event pairs, 1216 based on Foata normal form. 0/3852 useless extension candidates. Maximal degree in co-relation 8744. Up to 2363 conditions per place. [2025-03-09 01:26:47,791 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 60 selfloop transitions, 10 changer transitions 0/74 dead transitions. [2025-03-09 01:26:47,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 480 flow [2025-03-09 01:26:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:26:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:26:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-03-09 01:26:47,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36 [2025-03-09 01:26:47,793 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 211 flow. Second operand 6 states and 108 transitions. [2025-03-09 01:26:47,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 480 flow [2025-03-09 01:26:47,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 468 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:26:47,798 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 248 flow [2025-03-09 01:26:47,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2025-03-09 01:26:47,799 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places. [2025-03-09 01:26:47,799 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 248 flow [2025-03-09 01:26:47,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:47,800 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:47,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:26:48,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:48,004 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:48,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:48,005 INFO L85 PathProgramCache]: Analyzing trace with hash 730264147, now seen corresponding path program 2 times [2025-03-09 01:26:48,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:48,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560564256] [2025-03-09 01:26:48,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:48,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:48,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:26:48,021 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:48,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:48,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:48,182 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:48,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560564256] [2025-03-09 01:26:48,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560564256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141668552] [2025-03-09 01:26:48,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:48,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:48,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:48,185 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:48,186 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:48,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:26:48,234 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:48,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:48,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:48,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:26:48,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:48,242 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:48,341 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:48,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:48,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141668552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:48,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:48,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-09 01:26:48,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558121449] [2025-03-09 01:26:48,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:48,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:26:48,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:48,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:26:48,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:26:48,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-09 01:26:48,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 248 flow. Second operand has 20 states, 20 states have (on average 9.9) internal successors, (198), 20 states have internal predecessors, (198), 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,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:48,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-09 01:26:48,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:49,580 INFO L124 PetriNetUnfolderBase]: 3908/5480 cut-off events. [2025-03-09 01:26:49,581 INFO L125 PetriNetUnfolderBase]: For 9813/10141 co-relation queries the response was YES. [2025-03-09 01:26:49,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18519 conditions, 5480 events. 3908/5480 cut-off events. For 9813/10141 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 26220 event pairs, 547 based on Foata normal form. 196/5674 useless extension candidates. Maximal degree in co-relation 14493. Up to 1086 conditions per place. [2025-03-09 01:26:49,600 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 171 selfloop transitions, 18 changer transitions 0/192 dead transitions. [2025-03-09 01:26:49,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 192 transitions, 1200 flow [2025-03-09 01:26:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:26:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:26:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 275 transitions. [2025-03-09 01:26:49,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-09 01:26:49,602 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 248 flow. Second operand 14 states and 275 transitions. [2025-03-09 01:26:49,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 192 transitions, 1200 flow [2025-03-09 01:26:49,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 192 transitions, 1194 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:26:49,610 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 304 flow [2025-03-09 01:26:49,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=304, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2025-03-09 01:26:49,610 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2025-03-09 01:26:49,610 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 304 flow [2025-03-09 01:26:49,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.9) internal successors, (198), 20 states have internal predecessors, (198), 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,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:49,611 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:49,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:26:49,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:49,811 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:26:49,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:49,812 INFO L85 PathProgramCache]: Analyzing trace with hash -70726601, now seen corresponding path program 1 times [2025-03-09 01:26:49,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:49,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416729443] [2025-03-09 01:26:49,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:49,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:49,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:26:49,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:26:49,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:49,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:49,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:49,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416729443] [2025-03-09 01:26:49,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416729443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:49,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770465522] [2025-03-09 01:26:49,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:49,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:49,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:49,911 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:49,913 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:49,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:26:49,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:26:49,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:49,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:49,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:26:49,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:50,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:50,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770465522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:50,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:50,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-09 01:26:50,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244260924] [2025-03-09 01:26:50,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:50,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:26:50,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:50,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:26:50,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:26:50,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:50,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 54 transitions, 304 flow. Second operand has 18 states, 18 states have (on average 11.166666666666666) internal successors, (201), 18 states have internal predecessors, (201), 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,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:50,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:50,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:50,795 INFO L124 PetriNetUnfolderBase]: 6036/8720 cut-off events. [2025-03-09 01:26:50,795 INFO L125 PetriNetUnfolderBase]: For 22468/22784 co-relation queries the response was YES. [2025-03-09 01:26:50,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31085 conditions, 8720 events. 6036/8720 cut-off events. For 22468/22784 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 45596 event pairs, 3014 based on Foata normal form. 135/8849 useless extension candidates. Maximal degree in co-relation 15717. Up to 4273 conditions per place. [2025-03-09 01:26:50,838 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 114 selfloop transitions, 14 changer transitions 0/133 dead transitions. [2025-03-09 01:26:50,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 133 transitions, 995 flow [2025-03-09 01:26:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:26:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:26:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2025-03-09 01:26:50,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2025-03-09 01:26:50,840 INFO L175 Difference]: Start difference. First operand has 73 places, 54 transitions, 304 flow. Second operand 9 states and 170 transitions. [2025-03-09 01:26:50,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 133 transitions, 995 flow [2025-03-09 01:26:50,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 133 transitions, 868 flow, removed 26 selfloop flow, removed 11 redundant places. [2025-03-09 01:26:50,855 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 355 flow [2025-03-09 01:26:50,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=355, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2025-03-09 01:26:50,856 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2025-03-09 01:26:50,856 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 355 flow [2025-03-09 01:26:50,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.166666666666666) internal successors, (201), 18 states have internal predecessors, (201), 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,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:50,856 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:50,862 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:51,057 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,SelfDestructingSolverStorable11 [2025-03-09 01:26:51,057 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:51,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:51,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1385340505, now seen corresponding path program 1 times [2025-03-09 01:26:51,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:51,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488131277] [2025-03-09 01:26:51,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:51,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:51,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:26:51,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:26:51,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:51,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:51,122 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:51,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:51,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488131277] [2025-03-09 01:26:51,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488131277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:51,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663238056] [2025-03-09 01:26:51,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:51,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:51,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:51,124 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:51,126 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:51,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:26:51,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:26:51,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:51,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:51,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:26:51,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:51,283 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:51,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:51,330 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:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663238056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:51,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:51,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 01:26:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952852779] [2025-03-09 01:26:51,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:51,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:26:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:51,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:26:51,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:26:51,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:51,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 355 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:51,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:51,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:51,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:52,001 INFO L124 PetriNetUnfolderBase]: 5856/8361 cut-off events. [2025-03-09 01:26:52,002 INFO L125 PetriNetUnfolderBase]: For 27035/27581 co-relation queries the response was YES. [2025-03-09 01:26:52,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30375 conditions, 8361 events. 5856/8361 cut-off events. For 27035/27581 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 42118 event pairs, 3960 based on Foata normal form. 34/8370 useless extension candidates. Maximal degree in co-relation 16616. Up to 7287 conditions per place. [2025-03-09 01:26:52,051 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 81 selfloop transitions, 12 changer transitions 0/98 dead transitions. [2025-03-09 01:26:52,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 98 transitions, 723 flow [2025-03-09 01:26:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:26:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:26:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2025-03-09 01:26:52,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3675 [2025-03-09 01:26:52,053 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 355 flow. Second operand 8 states and 147 transitions. [2025-03-09 01:26:52,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 98 transitions, 723 flow [2025-03-09 01:26:52,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 98 transitions, 712 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:52,076 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 403 flow [2025-03-09 01:26:52,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=403, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2025-03-09 01:26:52,077 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2025-03-09 01:26:52,077 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 403 flow [2025-03-09 01:26:52,077 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:52,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:52,078 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:52,084 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:52,282 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,SelfDestructingSolverStorable12 [2025-03-09 01:26:52,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:26:52,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:52,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1262831347, now seen corresponding path program 2 times [2025-03-09 01:26:52,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:52,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921526140] [2025-03-09 01:26:52,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:52,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:52,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-09 01:26:52,295 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:52,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:52,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:52,454 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:52,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:52,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921526140] [2025-03-09 01:26:52,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921526140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:52,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709083350] [2025-03-09 01:26:52,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:52,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:52,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:52,457 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:52,458 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:52,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-09 01:26:52,512 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:52,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:52,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:52,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:26:52,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:52,520 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:52,662 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:52,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:52,881 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:52,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709083350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:52,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:52,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-09 01:26:52,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827452336] [2025-03-09 01:26:52,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:52,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:26:52,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:52,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:26:52,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:26:53,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:53,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 403 flow. Second operand has 20 states, 20 states have (on average 11.4) internal successors, (228), 20 states have internal predecessors, (228), 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,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:53,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:53,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:53,599 INFO L124 PetriNetUnfolderBase]: 5331/7502 cut-off events. [2025-03-09 01:26:53,599 INFO L125 PetriNetUnfolderBase]: For 24988/25724 co-relation queries the response was YES. [2025-03-09 01:26:53,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28277 conditions, 7502 events. 5331/7502 cut-off events. For 24988/25724 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 37246 event pairs, 1104 based on Foata normal form. 189/7684 useless extension candidates. Maximal degree in co-relation 15982. Up to 2457 conditions per place. [2025-03-09 01:26:53,627 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 128 selfloop transitions, 14 changer transitions 0/147 dead transitions. [2025-03-09 01:26:53,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 147 transitions, 1247 flow [2025-03-09 01:26:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:26:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:26:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2025-03-09 01:26:53,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37714285714285717 [2025-03-09 01:26:53,628 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 403 flow. Second operand 7 states and 132 transitions. [2025-03-09 01:26:53,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 147 transitions, 1247 flow [2025-03-09 01:26:53,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 147 transitions, 1230 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 01:26:53,642 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 422 flow [2025-03-09 01:26:53,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=422, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2025-03-09 01:26:53,643 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 33 predicate places. [2025-03-09 01:26:53,643 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 422 flow [2025-03-09 01:26:53,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.4) internal successors, (228), 20 states have internal predecessors, (228), 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,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:53,643 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:53,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:26:53,843 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,SelfDestructingSolverStorable13 [2025-03-09 01:26:53,844 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:26:53,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:53,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1576068843, now seen corresponding path program 2 times [2025-03-09 01:26:53,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:53,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690705496] [2025-03-09 01:26:53,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:53,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:53,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-09 01:26:53,855 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:53,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:53,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:26:53,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:53,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690705496] [2025-03-09 01:26:53,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690705496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:53,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891474985] [2025-03-09 01:26:53,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:53,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:53,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:53,960 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:53,963 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:54,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-09 01:26:54,013 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:54,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:54,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:54,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:26:54,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:26:54,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:54,197 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:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:26:54,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891474985] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:54,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:54,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2025-03-09 01:26:54,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427712856] [2025-03-09 01:26:54,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:54,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:26:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:54,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:26:54,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:26:54,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:54,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 65 transitions, 422 flow. Second operand has 22 states, 22 states have (on average 11.181818181818182) internal successors, (246), 22 states have internal predecessors, (246), 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:54,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:54,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:54,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:55,449 INFO L124 PetriNetUnfolderBase]: 6302/8824 cut-off events. [2025-03-09 01:26:55,449 INFO L125 PetriNetUnfolderBase]: For 24786/25152 co-relation queries the response was YES. [2025-03-09 01:26:55,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35053 conditions, 8824 events. 6302/8824 cut-off events. For 24786/25152 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 44229 event pairs, 1077 based on Foata normal form. 236/9044 useless extension candidates. Maximal degree in co-relation 22012. Up to 1341 conditions per place. [2025-03-09 01:26:55,537 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 210 selfloop transitions, 21 changer transitions 0/237 dead transitions. [2025-03-09 01:26:55,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 237 transitions, 1811 flow [2025-03-09 01:26:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:26:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-09 01:26:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 317 transitions. [2025-03-09 01:26:55,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39625 [2025-03-09 01:26:55,539 INFO L175 Difference]: Start difference. First operand has 85 places, 65 transitions, 422 flow. Second operand 16 states and 317 transitions. [2025-03-09 01:26:55,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 237 transitions, 1811 flow [2025-03-09 01:26:55,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 237 transitions, 1679 flow, removed 17 selfloop flow, removed 5 redundant places. [2025-03-09 01:26:55,557 INFO L231 Difference]: Finished difference. Result has 95 places, 68 transitions, 464 flow [2025-03-09 01:26:55,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=464, PETRI_PLACES=95, PETRI_TRANSITIONS=68} [2025-03-09 01:26:55,557 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 43 predicate places. [2025-03-09 01:26:55,557 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 68 transitions, 464 flow [2025-03-09 01:26:55,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.181818181818182) internal successors, (246), 22 states have internal predecessors, (246), 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,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:55,557 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:55,563 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:26:55,758 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,SelfDestructingSolverStorable14 [2025-03-09 01:26:55,758 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:55,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:55,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1107437270, now seen corresponding path program 1 times [2025-03-09 01:26:55,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:55,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314568055] [2025-03-09 01:26:55,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:55,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:55,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:26:55,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:26:55,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:55,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:55,784 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:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314568055] [2025-03-09 01:26:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314568055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:55,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:55,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:55,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351346462] [2025-03-09 01:26:55,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:55,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:26:55,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:55,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:26:55,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:26:55,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-09 01:26:55,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 68 transitions, 464 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:55,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:55,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-09 01:26:55,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:56,260 INFO L124 PetriNetUnfolderBase]: 5257/7837 cut-off events. [2025-03-09 01:26:56,260 INFO L125 PetriNetUnfolderBase]: For 29817/30238 co-relation queries the response was YES. [2025-03-09 01:26:56,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31466 conditions, 7837 events. 5257/7837 cut-off events. For 29817/30238 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 41545 event pairs, 1235 based on Foata normal form. 3/7817 useless extension candidates. Maximal degree in co-relation 24829. Up to 6583 conditions per place. [2025-03-09 01:26:56,292 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 80 selfloop transitions, 4 changer transitions 1/93 dead transitions. [2025-03-09 01:26:56,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 93 transitions, 797 flow [2025-03-09 01:26:56,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:26:56,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:26:56,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-03-09 01:26:56,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2025-03-09 01:26:56,293 INFO L175 Difference]: Start difference. First operand has 95 places, 68 transitions, 464 flow. Second operand 3 states and 74 transitions. [2025-03-09 01:26:56,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 93 transitions, 797 flow [2025-03-09 01:26:56,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 93 transitions, 682 flow, removed 15 selfloop flow, removed 14 redundant places. [2025-03-09 01:26:56,319 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 413 flow [2025-03-09 01:26:56,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=413, PETRI_PLACES=84, PETRI_TRANSITIONS=71} [2025-03-09 01:26:56,320 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 32 predicate places. [2025-03-09 01:26:56,320 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 413 flow [2025-03-09 01:26:56,320 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:56,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:56,320 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:56,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:26:56,320 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:56,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:56,320 INFO L85 PathProgramCache]: Analyzing trace with hash 912386130, now seen corresponding path program 1 times [2025-03-09 01:26:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:56,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508099006] [2025-03-09 01:26:56,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:56,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:26:56,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:26:56,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:56,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:56,350 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:56,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:56,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508099006] [2025-03-09 01:26:56,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508099006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:56,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:56,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:26:56,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576832151] [2025-03-09 01:26:56,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:56,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:56,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:56,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:56,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:56,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:56,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 413 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:56,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:56,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:56,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:56,966 INFO L124 PetriNetUnfolderBase]: 6279/8971 cut-off events. [2025-03-09 01:26:56,967 INFO L125 PetriNetUnfolderBase]: For 23640/24430 co-relation queries the response was YES. [2025-03-09 01:26:56,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33981 conditions, 8971 events. 6279/8971 cut-off events. For 23640/24430 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 46365 event pairs, 1806 based on Foata normal form. 295/9036 useless extension candidates. Maximal degree in co-relation 22359. Up to 4836 conditions per place. [2025-03-09 01:26:57,015 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 87 selfloop transitions, 9 changer transitions 0/102 dead transitions. [2025-03-09 01:26:57,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 102 transitions, 807 flow [2025-03-09 01:26:57,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-09 01:26:57,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-03-09 01:26:57,016 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 413 flow. Second operand 4 states and 76 transitions. [2025-03-09 01:26:57,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 102 transitions, 807 flow [2025-03-09 01:26:57,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 102 transitions, 799 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:26:57,030 INFO L231 Difference]: Finished difference. Result has 86 places, 69 transitions, 413 flow [2025-03-09 01:26:57,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=413, PETRI_PLACES=86, PETRI_TRANSITIONS=69} [2025-03-09 01:26:57,031 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 34 predicate places. [2025-03-09 01:26:57,031 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 69 transitions, 413 flow [2025-03-09 01:26:57,031 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:57,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:57,031 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:57,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:26:57,031 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:57,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:57,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2000562502, now seen corresponding path program 1 times [2025-03-09 01:26:57,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:57,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115679853] [2025-03-09 01:26:57,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:57,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:57,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:26:57,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:26:57,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:57,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:57,095 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:57,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:57,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115679853] [2025-03-09 01:26:57,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115679853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:57,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59106417] [2025-03-09 01:26:57,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:57,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:57,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:57,097 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:26:57,099 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:26:57,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:26:57,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:26:57,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:57,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:57,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:26:57,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:57,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:57,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59106417] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:57,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:26:57,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-09 01:26:57,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424329705] [2025-03-09 01:26:57,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:57,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:26:57,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:57,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:26:57,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:26:57,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:26:57,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 69 transitions, 413 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:57,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:57,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:26:57,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:57,820 INFO L124 PetriNetUnfolderBase]: 6046/8818 cut-off events. [2025-03-09 01:26:57,820 INFO L125 PetriNetUnfolderBase]: For 24879/25573 co-relation queries the response was YES. [2025-03-09 01:26:57,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34493 conditions, 8818 events. 6046/8818 cut-off events. For 24879/25573 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 46706 event pairs, 1729 based on Foata normal form. 236/8860 useless extension candidates. Maximal degree in co-relation 23037. Up to 5015 conditions per place. [2025-03-09 01:26:57,920 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 83 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2025-03-09 01:26:57,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 98 transitions, 787 flow [2025-03-09 01:26:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:26:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:26:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-03-09 01:26:57,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.352 [2025-03-09 01:26:57,921 INFO L175 Difference]: Start difference. First operand has 86 places, 69 transitions, 413 flow. Second operand 5 states and 88 transitions. [2025-03-09 01:26:57,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 98 transitions, 787 flow [2025-03-09 01:26:57,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 98 transitions, 759 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:26:57,937 INFO L231 Difference]: Finished difference. Result has 88 places, 68 transitions, 421 flow [2025-03-09 01:26:57,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=421, PETRI_PLACES=88, PETRI_TRANSITIONS=68} [2025-03-09 01:26:57,937 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 36 predicate places. [2025-03-09 01:26:57,937 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 68 transitions, 421 flow [2025-03-09 01:26:57,937 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:57,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:57,938 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:57,943 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:26:58,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:26:58,138 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:26:58,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:58,140 INFO L85 PathProgramCache]: Analyzing trace with hash 919044938, now seen corresponding path program 1 times [2025-03-09 01:26:58,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:58,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092513060] [2025-03-09 01:26:58,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:58,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:58,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:26:58,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:26:58,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:58,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:58,429 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:58,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:58,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092513060] [2025-03-09 01:26:58,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092513060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:58,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850534390] [2025-03-09 01:26:58,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:58,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:58,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:58,431 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:26:58,432 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:26:58,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:26:58,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:26:58,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:58,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:58,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 01:26:58,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:58,513 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:58,679 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:58,685 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:58,691 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:58,737 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:58,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:58,837 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 135 treesize of output 131 [2025-03-09 01:26:58,839 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 131 treesize of output 127 [2025-03-09 01:26:59,488 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 72 treesize of output 64 [2025-03-09 01:26:59,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:26:59,504 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 86 treesize of output 82 [2025-03-09 01:26:59,657 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 53 treesize of output 47 [2025-03-09 01:26:59,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:26:59,665 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2025-03-09 01:26:59,695 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 66 treesize of output 58 [2025-03-09 01:26:59,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:26:59,703 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 72 [2025-03-09 01:26:59,740 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:59,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850534390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:59,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:59,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-03-09 01:26:59,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297558448] [2025-03-09 01:26:59,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:59,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:26:59,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:59,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:26:59,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:26:59,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-09 01:26:59,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 68 transitions, 421 flow. Second operand has 23 states, 23 states have (on average 12.826086956521738) internal successors, (295), 23 states have internal predecessors, (295), 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:59,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:59,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-09 01:26:59,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:01,595 INFO L124 PetriNetUnfolderBase]: 4766/7300 cut-off events. [2025-03-09 01:27:01,595 INFO L125 PetriNetUnfolderBase]: For 24410/25032 co-relation queries the response was YES. [2025-03-09 01:27:01,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28642 conditions, 7300 events. 4766/7300 cut-off events. For 24410/25032 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 40612 event pairs, 1316 based on Foata normal form. 1/7300 useless extension candidates. Maximal degree in co-relation 18741. Up to 5765 conditions per place. [2025-03-09 01:27:01,632 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 121 selfloop transitions, 30 changer transitions 38/198 dead transitions. [2025-03-09 01:27:01,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 198 transitions, 1510 flow [2025-03-09 01:27:01,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:27:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 01:27:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 384 transitions. [2025-03-09 01:27:01,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3490909090909091 [2025-03-09 01:27:01,634 INFO L175 Difference]: Start difference. First operand has 88 places, 68 transitions, 421 flow. Second operand 22 states and 384 transitions. [2025-03-09 01:27:01,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 198 transitions, 1510 flow [2025-03-09 01:27:01,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 198 transitions, 1483 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-09 01:27:01,660 INFO L231 Difference]: Finished difference. Result has 113 places, 85 transitions, 616 flow [2025-03-09 01:27:01,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=616, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2025-03-09 01:27:01,660 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 61 predicate places. [2025-03-09 01:27:01,660 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 85 transitions, 616 flow [2025-03-09 01:27:01,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.826086956521738) internal successors, (295), 23 states have internal predecessors, (295), 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:01,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:01,660 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:01,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 01:27:01,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:01,861 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:01,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:01,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1997179098, now seen corresponding path program 2 times [2025-03-09 01:27:01,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:01,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739050352] [2025-03-09 01:27:01,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:01,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:01,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:27:01,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:27:01,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:01,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:02,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:02,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739050352] [2025-03-09 01:27:02,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739050352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:02,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604599522] [2025-03-09 01:27:02,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:02,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:02,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:02,132 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:02,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 01:27:02,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:27:02,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:27:02,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:02,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:02,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 01:27:02,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:02,208 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:02,399 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:27:02,401 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:27:02,402 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:27:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:02,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:02,573 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 135 treesize of output 131 [2025-03-09 01:27:02,574 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 131 treesize of output 127 [2025-03-09 01:27:03,063 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 72 treesize of output 64 [2025-03-09 01:27:03,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:27:03,070 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 86 treesize of output 82 [2025-03-09 01:27:03,208 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 53 treesize of output 47 [2025-03-09 01:27:03,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:27:03,212 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2025-03-09 01:27:03,234 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 66 treesize of output 58 [2025-03-09 01:27:03,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:27:03,238 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 72 [2025-03-09 01:27:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604599522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:03,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:03,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-03-09 01:27:03,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250649422] [2025-03-09 01:27:03,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:03,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:27:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:03,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:27:03,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:27:03,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:27:03,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 85 transitions, 616 flow. Second operand has 24 states, 24 states have (on average 11.75) internal successors, (282), 24 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:03,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:03,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:27:03,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:05,102 INFO L124 PetriNetUnfolderBase]: 5978/8855 cut-off events. [2025-03-09 01:27:05,102 INFO L125 PetriNetUnfolderBase]: For 30172/30479 co-relation queries the response was YES. [2025-03-09 01:27:05,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36530 conditions, 8855 events. 5978/8855 cut-off events. For 30172/30479 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 48092 event pairs, 1917 based on Foata normal form. 3/8726 useless extension candidates. Maximal degree in co-relation 36492. Up to 7574 conditions per place. [2025-03-09 01:27:05,152 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 122 selfloop transitions, 58 changer transitions 51/238 dead transitions. [2025-03-09 01:27:05,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 238 transitions, 1914 flow [2025-03-09 01:27:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 01:27:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-09 01:27:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 418 transitions. [2025-03-09 01:27:05,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32153846153846155 [2025-03-09 01:27:05,153 INFO L175 Difference]: Start difference. First operand has 113 places, 85 transitions, 616 flow. Second operand 26 states and 418 transitions. [2025-03-09 01:27:05,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 238 transitions, 1914 flow [2025-03-09 01:27:05,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 238 transitions, 1815 flow, removed 29 selfloop flow, removed 9 redundant places. [2025-03-09 01:27:05,200 INFO L231 Difference]: Finished difference. Result has 134 places, 122 transitions, 1021 flow [2025-03-09 01:27:05,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1021, PETRI_PLACES=134, PETRI_TRANSITIONS=122} [2025-03-09 01:27:05,201 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 82 predicate places. [2025-03-09 01:27:05,201 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 122 transitions, 1021 flow [2025-03-09 01:27:05,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.75) internal successors, (282), 24 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:05,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:05,201 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:05,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 01:27:05,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:05,402 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:05,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:05,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1515206064, now seen corresponding path program 3 times [2025-03-09 01:27:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:05,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541963881] [2025-03-09 01:27:05,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:27:05,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:05,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-09 01:27:05,414 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:05,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:27:05,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:05,636 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:05,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:05,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541963881] [2025-03-09 01:27:05,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541963881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:05,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:05,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:27:05,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178392363] [2025-03-09 01:27:05,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:05,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:27:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:05,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:27:05,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:27:05,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:27:05,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 122 transitions, 1021 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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:27:05,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:05,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:27:05,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:06,305 INFO L124 PetriNetUnfolderBase]: 5866/8679 cut-off events. [2025-03-09 01:27:06,305 INFO L125 PetriNetUnfolderBase]: For 34113/34464 co-relation queries the response was YES. [2025-03-09 01:27:06,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38367 conditions, 8679 events. 5866/8679 cut-off events. For 34113/34464 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 46938 event pairs, 1985 based on Foata normal form. 19/8572 useless extension candidates. Maximal degree in co-relation 38157. Up to 7820 conditions per place. [2025-03-09 01:27:06,356 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 117 selfloop transitions, 45 changer transitions 8/177 dead transitions. [2025-03-09 01:27:06,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 177 transitions, 1720 flow [2025-03-09 01:27:06,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:27:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:27:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2025-03-09 01:27:06,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.334 [2025-03-09 01:27:06,357 INFO L175 Difference]: Start difference. First operand has 134 places, 122 transitions, 1021 flow. Second operand 10 states and 167 transitions. [2025-03-09 01:27:06,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 177 transitions, 1720 flow [2025-03-09 01:27:06,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 177 transitions, 1620 flow, removed 32 selfloop flow, removed 11 redundant places. [2025-03-09 01:27:06,430 INFO L231 Difference]: Finished difference. Result has 132 places, 137 transitions, 1204 flow [2025-03-09 01:27:06,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1204, PETRI_PLACES=132, PETRI_TRANSITIONS=137} [2025-03-09 01:27:06,430 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 80 predicate places. [2025-03-09 01:27:06,430 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 137 transitions, 1204 flow [2025-03-09 01:27:06,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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:27:06,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:06,430 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:06,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:27:06,431 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:06,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1234510496, now seen corresponding path program 4 times [2025-03-09 01:27:06,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:06,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422783127] [2025-03-09 01:27:06,431 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:27:06,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:06,435 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:27:06,447 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:06,447 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:27:06,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:06,676 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:06,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:06,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422783127] [2025-03-09 01:27:06,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422783127] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:06,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001477285] [2025-03-09 01:27:06,676 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:27:06,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:06,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:06,678 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:06,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 01:27:06,716 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:27:06,733 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:06,733 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:27:06,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:06,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:27:06,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:06,957 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:27:06,959 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:27:06,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 57 treesize of output 53 [2025-03-09 01:27:07,007 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:27:07,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:07,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:27:07,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 95 [2025-03-09 01:27:07,086 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 87 treesize of output 83 [2025-03-09 01:27:07,088 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 83 treesize of output 79 [2025-03-09 01:27:07,224 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:27:07,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001477285] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:07,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:07,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 22 [2025-03-09 01:27:07,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920462147] [2025-03-09 01:27:07,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:07,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:27:07,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:07,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:27:07,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:27:07,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:27:07,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 137 transitions, 1204 flow. Second operand has 23 states, 23 states have (on average 11.782608695652174) internal successors, (271), 23 states have internal predecessors, (271), 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:07,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:07,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:27:07,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:08,493 INFO L124 PetriNetUnfolderBase]: 7222/10766 cut-off events. [2025-03-09 01:27:08,494 INFO L125 PetriNetUnfolderBase]: For 46422/46876 co-relation queries the response was YES. [2025-03-09 01:27:08,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48733 conditions, 10766 events. 7222/10766 cut-off events. For 46422/46876 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 60482 event pairs, 1599 based on Foata normal form. 27/10655 useless extension candidates. Maximal degree in co-relation 48329. Up to 8961 conditions per place. [2025-03-09 01:27:08,550 INFO L140 encePairwiseOnDemand]: 33/50 looper letters, 131 selfloop transitions, 105 changer transitions 14/257 dead transitions. [2025-03-09 01:27:08,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 257 transitions, 2654 flow [2025-03-09 01:27:08,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 01:27:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-09 01:27:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 286 transitions. [2025-03-09 01:27:08,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31777777777777777 [2025-03-09 01:27:08,551 INFO L175 Difference]: Start difference. First operand has 132 places, 137 transitions, 1204 flow. Second operand 18 states and 286 transitions. [2025-03-09 01:27:08,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 257 transitions, 2654 flow [2025-03-09 01:27:08,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 257 transitions, 2543 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-09 01:27:08,621 INFO L231 Difference]: Finished difference. Result has 156 places, 204 transitions, 2097 flow [2025-03-09 01:27:08,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2097, PETRI_PLACES=156, PETRI_TRANSITIONS=204} [2025-03-09 01:27:08,621 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 104 predicate places. [2025-03-09 01:27:08,621 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 204 transitions, 2097 flow [2025-03-09 01:27:08,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.782608695652174) internal successors, (271), 23 states have internal predecessors, (271), 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:08,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:08,622 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:08,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 01:27:08,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:08,822 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:08,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1667462576, now seen corresponding path program 5 times [2025-03-09 01:27:08,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:08,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566400598] [2025-03-09 01:27:08,823 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:27:08,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:08,827 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-09 01:27:08,834 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:08,834 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:27:08,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:09,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:09,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566400598] [2025-03-09 01:27:09,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566400598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:09,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662151063] [2025-03-09 01:27:09,073 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:27:09,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:09,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:09,075 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:09,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 01:27:09,115 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-09 01:27:09,132 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:09,132 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:27:09,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:09,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 01:27:09,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:09,165 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:09,352 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:09,353 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:09,354 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:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:09,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:09,493 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 128 treesize of output 124 [2025-03-09 01:27:09,496 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 124 treesize of output 120 [2025-03-09 01:27:10,249 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 125 treesize of output 113 [2025-03-09 01:27:10,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:27:10,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 157 [2025-03-09 01:27:11,078 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 101 treesize of output 93 [2025-03-09 01:27:11,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:27:11,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 119 [2025-03-09 01:27:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:11,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662151063] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:11,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:11,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2025-03-09 01:27:11,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941522253] [2025-03-09 01:27:11,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:11,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:27:11,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:11,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:27:11,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:27:11,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:27:11,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 204 transitions, 2097 flow. Second operand has 23 states, 23 states have (on average 11.73913043478261) internal successors, (270), 23 states have internal predecessors, (270), 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:11,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:11,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:27:11,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:13,370 INFO L124 PetriNetUnfolderBase]: 9027/13107 cut-off events. [2025-03-09 01:27:13,370 INFO L125 PetriNetUnfolderBase]: For 79432/80038 co-relation queries the response was YES. [2025-03-09 01:27:13,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69420 conditions, 13107 events. 9027/13107 cut-off events. For 79432/80038 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 72814 event pairs, 2695 based on Foata normal form. 83/13180 useless extension candidates. Maximal degree in co-relation 68887. Up to 11548 conditions per place. [2025-03-09 01:27:13,458 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 142 selfloop transitions, 53 changer transitions 54/260 dead transitions. [2025-03-09 01:27:13,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 260 transitions, 2975 flow [2025-03-09 01:27:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:27:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:27:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 227 transitions. [2025-03-09 01:27:13,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3242857142857143 [2025-03-09 01:27:13,459 INFO L175 Difference]: Start difference. First operand has 156 places, 204 transitions, 2097 flow. Second operand 14 states and 227 transitions. [2025-03-09 01:27:13,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 260 transitions, 2975 flow [2025-03-09 01:27:13,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 260 transitions, 2790 flow, removed 83 selfloop flow, removed 6 redundant places. [2025-03-09 01:27:13,705 INFO L231 Difference]: Finished difference. Result has 169 places, 192 transitions, 1894 flow [2025-03-09 01:27:13,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1924, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1894, PETRI_PLACES=169, PETRI_TRANSITIONS=192} [2025-03-09 01:27:13,706 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 117 predicate places. [2025-03-09 01:27:13,706 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 192 transitions, 1894 flow [2025-03-09 01:27:13,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.73913043478261) internal successors, (270), 23 states have internal predecessors, (270), 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:13,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:13,706 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:13,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-09 01:27:13,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 01:27:13,907 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:13,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash 767741876, now seen corresponding path program 6 times [2025-03-09 01:27:13,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:13,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110829236] [2025-03-09 01:27:13,907 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:27:13,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:13,911 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 3 equivalence classes. [2025-03-09 01:27:13,922 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:27:13,922 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:27:13,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:14,166 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:14,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:14,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110829236] [2025-03-09 01:27:14,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110829236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:14,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:14,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:27:14,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291771623] [2025-03-09 01:27:14,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:14,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:27:14,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:14,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:27:14,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:27:14,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:27:14,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 192 transitions, 1894 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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:27:14,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:14,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:27:14,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:15,213 INFO L124 PetriNetUnfolderBase]: 7280/10897 cut-off events. [2025-03-09 01:27:15,213 INFO L125 PetriNetUnfolderBase]: For 55731/56264 co-relation queries the response was YES. [2025-03-09 01:27:15,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56107 conditions, 10897 events. 7280/10897 cut-off events. For 55731/56264 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 62027 event pairs, 1821 based on Foata normal form. 21/10906 useless extension candidates. Maximal degree in co-relation 56040. Up to 9802 conditions per place. [2025-03-09 01:27:15,286 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 151 selfloop transitions, 76 changer transitions 8/242 dead transitions. [2025-03-09 01:27:15,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 242 transitions, 2801 flow [2025-03-09 01:27:15,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:27:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:27:15,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2025-03-09 01:27:15,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33 [2025-03-09 01:27:15,287 INFO L175 Difference]: Start difference. First operand has 169 places, 192 transitions, 1894 flow. Second operand 10 states and 165 transitions. [2025-03-09 01:27:15,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 242 transitions, 2801 flow [2025-03-09 01:27:15,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 242 transitions, 2616 flow, removed 27 selfloop flow, removed 13 redundant places. [2025-03-09 01:27:15,412 INFO L231 Difference]: Finished difference. Result has 162 places, 209 transitions, 2164 flow [2025-03-09 01:27:15,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1745, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2164, PETRI_PLACES=162, PETRI_TRANSITIONS=209} [2025-03-09 01:27:15,413 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 110 predicate places. [2025-03-09 01:27:15,413 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 209 transitions, 2164 flow [2025-03-09 01:27:15,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 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:27:15,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:15,413 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:15,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 01:27:15,413 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:15,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:15,413 INFO L85 PathProgramCache]: Analyzing trace with hash 19198144, now seen corresponding path program 7 times [2025-03-09 01:27:15,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:15,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348905306] [2025-03-09 01:27:15,413 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:27:15,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:15,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:27:15,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:27:15,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:15,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:15,674 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:15,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:15,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348905306] [2025-03-09 01:27:15,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348905306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:15,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569603104] [2025-03-09 01:27:15,675 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:27:15,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:15,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:15,676 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:15,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 01:27:15,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:27:15,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:27:15,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:15,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:15,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 01:27:15,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:15,744 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:15,915 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:15,919 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:15,920 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:15,957 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:15,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:16,071 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 112 [2025-03-09 01:27:16,075 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 112 treesize of output 108 [2025-03-09 01:27:16,586 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 100 treesize of output 92 [2025-03-09 01:27:16,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:27:16,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 118 [2025-03-09 01:27:17,125 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 117 treesize of output 105 [2025-03-09 01:27:17,132 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-09 01:27:17,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 1 [2025-03-09 01:27:17,183 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:17,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569603104] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:17,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:17,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2025-03-09 01:27:17,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615064692] [2025-03-09 01:27:17,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:17,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:27:17,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:17,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:27:17,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:27:17,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-03-09 01:27:17,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 209 transitions, 2164 flow. Second operand has 23 states, 23 states have (on average 12.826086956521738) internal successors, (295), 23 states have internal predecessors, (295), 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:17,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:17,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-03-09 01:27:17,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:19,223 INFO L124 PetriNetUnfolderBase]: 7007/10597 cut-off events. [2025-03-09 01:27:19,224 INFO L125 PetriNetUnfolderBase]: For 66468/66937 co-relation queries the response was YES. [2025-03-09 01:27:19,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56628 conditions, 10597 events. 7007/10597 cut-off events. For 66468/66937 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 61806 event pairs, 1972 based on Foata normal form. 41/10618 useless extension candidates. Maximal degree in co-relation 56193. Up to 8933 conditions per place. [2025-03-09 01:27:19,289 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 124 selfloop transitions, 51 changer transitions 77/264 dead transitions. [2025-03-09 01:27:19,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 264 transitions, 3024 flow [2025-03-09 01:27:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 01:27:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-09 01:27:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 297 transitions. [2025-03-09 01:27:19,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33 [2025-03-09 01:27:19,290 INFO L175 Difference]: Start difference. First operand has 162 places, 209 transitions, 2164 flow. Second operand 18 states and 297 transitions. [2025-03-09 01:27:19,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 264 transitions, 3024 flow [2025-03-09 01:27:19,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 264 transitions, 2890 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-03-09 01:27:19,431 INFO L231 Difference]: Finished difference. Result has 176 places, 173 transitions, 1730 flow [2025-03-09 01:27:19,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2039, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1730, PETRI_PLACES=176, PETRI_TRANSITIONS=173} [2025-03-09 01:27:19,431 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 124 predicate places. [2025-03-09 01:27:19,431 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 173 transitions, 1730 flow [2025-03-09 01:27:19,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.826086956521738) internal successors, (295), 23 states have internal predecessors, (295), 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:19,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:19,431 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:19,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 01:27:19,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:19,632 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:19,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:19,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1284139676, now seen corresponding path program 8 times [2025-03-09 01:27:19,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:19,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028532187] [2025-03-09 01:27:19,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:19,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:19,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-09 01:27:19,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:27:19,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:19,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:19,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028532187] [2025-03-09 01:27:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028532187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:19,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862694603] [2025-03-09 01:27:19,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:19,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:19,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:19,695 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:19,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 01:27:19,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-09 01:27:19,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:27:19,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:19,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:19,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:27:19,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:19,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:27:19,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862694603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:19,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:19,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 01:27:19,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483743971] [2025-03-09 01:27:19,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:19,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:27:19,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:19,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:27:19,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:27:19,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-03-09 01:27:19,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 173 transitions, 1730 flow. Second operand has 13 states, 13 states have (on average 12.076923076923077) internal successors, (157), 13 states have internal predecessors, (157), 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:19,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:19,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-03-09 01:27:19,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:21,007 INFO L124 PetriNetUnfolderBase]: 8577/12472 cut-off events. [2025-03-09 01:27:21,008 INFO L125 PetriNetUnfolderBase]: For 74984/75851 co-relation queries the response was YES. [2025-03-09 01:27:21,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66306 conditions, 12472 events. 8577/12472 cut-off events. For 74984/75851 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 69875 event pairs, 1151 based on Foata normal form. 493/12796 useless extension candidates. Maximal degree in co-relation 66260. Up to 4491 conditions per place. [2025-03-09 01:27:21,085 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 239 selfloop transitions, 24 changer transitions 0/272 dead transitions. [2025-03-09 01:27:21,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 272 transitions, 3042 flow [2025-03-09 01:27:21,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:27:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:27:21,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2025-03-09 01:27:21,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3488888888888889 [2025-03-09 01:27:21,086 INFO L175 Difference]: Start difference. First operand has 176 places, 173 transitions, 1730 flow. Second operand 9 states and 157 transitions. [2025-03-09 01:27:21,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 272 transitions, 3042 flow [2025-03-09 01:27:21,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 272 transitions, 2714 flow, removed 49 selfloop flow, removed 23 redundant places. [2025-03-09 01:27:21,199 INFO L231 Difference]: Finished difference. Result has 132 places, 171 transitions, 1485 flow [2025-03-09 01:27:21,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1485, PETRI_PLACES=132, PETRI_TRANSITIONS=171} [2025-03-09 01:27:21,200 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 80 predicate places. [2025-03-09 01:27:21,200 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 171 transitions, 1485 flow [2025-03-09 01:27:21,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.076923076923077) internal successors, (157), 13 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:21,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:21,200 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:21,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-09 01:27:21,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:21,401 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:21,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:21,401 INFO L85 PathProgramCache]: Analyzing trace with hash 11357032, now seen corresponding path program 9 times [2025-03-09 01:27:21,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:21,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179373736] [2025-03-09 01:27:21,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:27:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:21,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-03-09 01:27:21,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 32 statements. [2025-03-09 01:27:21,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:27:21,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:27:21,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:21,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179373736] [2025-03-09 01:27:21,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179373736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:21,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794210085] [2025-03-09 01:27:21,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:27:21,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:21,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:21,463 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:21,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-09 01:27:21,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-03-09 01:27:21,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 32 statements. [2025-03-09 01:27:21,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:27:21,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:21,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:27:21,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:27:21,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:27:21,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794210085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:21,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:21,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-09 01:27:21,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706020309] [2025-03-09 01:27:21,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:21,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:27:21,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:21,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:27:21,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:27:21,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 50 [2025-03-09 01:27:21,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 171 transitions, 1485 flow. Second operand has 17 states, 17 states have (on average 9.764705882352942) internal successors, (166), 17 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:21,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:21,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 50 [2025-03-09 01:27:21,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:24,410 INFO L124 PetriNetUnfolderBase]: 19449/27675 cut-off events. [2025-03-09 01:27:24,410 INFO L125 PetriNetUnfolderBase]: For 139005/139005 co-relation queries the response was YES. [2025-03-09 01:27:24,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137615 conditions, 27675 events. 19449/27675 cut-off events. For 139005/139005 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 157421 event pairs, 1776 based on Foata normal form. 104/27779 useless extension candidates. Maximal degree in co-relation 137580. Up to 8371 conditions per place. [2025-03-09 01:27:24,631 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 528 selfloop transitions, 237 changer transitions 0/766 dead transitions. [2025-03-09 01:27:24,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 766 transitions, 8335 flow [2025-03-09 01:27:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 01:27:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-09 01:27:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 592 transitions. [2025-03-09 01:27:24,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3382857142857143 [2025-03-09 01:27:24,632 INFO L175 Difference]: Start difference. First operand has 132 places, 171 transitions, 1485 flow. Second operand 35 states and 592 transitions. [2025-03-09 01:27:24,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 766 transitions, 8335 flow [2025-03-09 01:27:24,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 766 transitions, 7882 flow, removed 16 selfloop flow, removed 9 redundant places. [2025-03-09 01:27:24,890 INFO L231 Difference]: Finished difference. Result has 178 places, 387 transitions, 4139 flow [2025-03-09 01:27:24,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1394, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=4139, PETRI_PLACES=178, PETRI_TRANSITIONS=387} [2025-03-09 01:27:24,891 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 126 predicate places. [2025-03-09 01:27:24,891 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 387 transitions, 4139 flow [2025-03-09 01:27:24,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.764705882352942) internal successors, (166), 17 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:24,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:24,891 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:24,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-09 01:27:25,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:25,091 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:25,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:25,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2005851248, now seen corresponding path program 10 times [2025-03-09 01:27:25,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:25,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406990140] [2025-03-09 01:27:25,092 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:27:25,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:25,096 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-09 01:27:25,098 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 32 statements. [2025-03-09 01:27:25,098 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:27:25,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:27:25,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:25,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406990140] [2025-03-09 01:27:25,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406990140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:25,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913807189] [2025-03-09 01:27:25,141 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:27:25,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:25,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:25,143 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:25,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-09 01:27:25,180 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-03-09 01:27:25,192 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 32 statements. [2025-03-09 01:27:25,192 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:27:25,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:25,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:27:25,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:27:25,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:27:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913807189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:25,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:25,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-09 01:27:25,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492861267] [2025-03-09 01:27:25,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:25,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:27:25,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:25,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:27:25,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:27:25,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 50 [2025-03-09 01:27:25,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 387 transitions, 4139 flow. Second operand has 18 states, 18 states have (on average 9.666666666666666) internal successors, (174), 18 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:25,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:25,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 50 [2025-03-09 01:27:25,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:30,852 INFO L124 PetriNetUnfolderBase]: 28720/40692 cut-off events. [2025-03-09 01:27:30,852 INFO L125 PetriNetUnfolderBase]: For 372690/372690 co-relation queries the response was YES. [2025-03-09 01:27:31,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246300 conditions, 40692 events. 28720/40692 cut-off events. For 372690/372690 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 242791 event pairs, 2526 based on Foata normal form. 128/40820 useless extension candidates. Maximal degree in co-relation 246246. Up to 12399 conditions per place. [2025-03-09 01:27:31,468 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 684 selfloop transitions, 368 changer transitions 0/1053 dead transitions. [2025-03-09 01:27:31,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 1053 transitions, 13516 flow [2025-03-09 01:27:31,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 01:27:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-09 01:27:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 570 transitions. [2025-03-09 01:27:31,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32571428571428573 [2025-03-09 01:27:31,470 INFO L175 Difference]: Start difference. First operand has 178 places, 387 transitions, 4139 flow. Second operand 35 states and 570 transitions. [2025-03-09 01:27:31,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 1053 transitions, 13516 flow [2025-03-09 01:27:34,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 1053 transitions, 13278 flow, removed 119 selfloop flow, removed 0 redundant places. [2025-03-09 01:27:34,308 INFO L231 Difference]: Finished difference. Result has 233 places, 624 transitions, 8124 flow [2025-03-09 01:27:34,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3957, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=8124, PETRI_PLACES=233, PETRI_TRANSITIONS=624} [2025-03-09 01:27:34,309 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 181 predicate places. [2025-03-09 01:27:34,309 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 624 transitions, 8124 flow [2025-03-09 01:27:34,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.666666666666666) internal successors, (174), 18 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:34,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:34,309 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:34,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-09 01:27:34,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-09 01:27:34,509 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:34,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash 865769460, now seen corresponding path program 11 times [2025-03-09 01:27:34,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:34,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13002842] [2025-03-09 01:27:34,510 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:27:34,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:34,515 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-03-09 01:27:34,520 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:27:34,521 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 01:27:34,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:27:34,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:34,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13002842] [2025-03-09 01:27:34,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13002842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:34,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858180009] [2025-03-09 01:27:34,660 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:27:34,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:34,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:34,662 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:34,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-09 01:27:34,701 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-03-09 01:27:34,716 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:27:34,716 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 01:27:34,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:34,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:27:34,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:27:34,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:27:34,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858180009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:34,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:34,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-09 01:27:34,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281124749] [2025-03-09 01:27:34,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:34,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:27:34,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:34,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:27:34,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:27:34,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-09 01:27:34,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 624 transitions, 8124 flow. Second operand has 18 states, 18 states have (on average 10.722222222222221) internal successors, (193), 18 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:34,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:34,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-09 01:27:34,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:40,039 INFO L124 PetriNetUnfolderBase]: 21895/32153 cut-off events. [2025-03-09 01:27:40,039 INFO L125 PetriNetUnfolderBase]: For 519253/519367 co-relation queries the response was YES. [2025-03-09 01:27:40,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227077 conditions, 32153 events. 21895/32153 cut-off events. For 519253/519367 co-relation queries the response was YES. Maximal size of possible extension queue 1086. Compared 211202 event pairs, 2291 based on Foata normal form. 124/32236 useless extension candidates. Maximal degree in co-relation 227002. Up to 10997 conditions per place. [2025-03-09 01:27:40,586 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 543 selfloop transitions, 240 changer transitions 0/811 dead transitions. [2025-03-09 01:27:40,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 811 transitions, 12136 flow [2025-03-09 01:27:40,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:27:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:27:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 218 transitions. [2025-03-09 01:27:40,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3353846153846154 [2025-03-09 01:27:40,587 INFO L175 Difference]: Start difference. First operand has 233 places, 624 transitions, 8124 flow. Second operand 13 states and 218 transitions. [2025-03-09 01:27:40,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 811 transitions, 12136 flow [2025-03-09 01:27:44,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 811 transitions, 11421 flow, removed 323 selfloop flow, removed 1 redundant places. [2025-03-09 01:27:44,555 INFO L231 Difference]: Finished difference. Result has 246 places, 641 transitions, 8419 flow [2025-03-09 01:27:44,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=7614, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8419, PETRI_PLACES=246, PETRI_TRANSITIONS=641} [2025-03-09 01:27:44,556 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 194 predicate places. [2025-03-09 01:27:44,556 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 641 transitions, 8419 flow [2025-03-09 01:27:44,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.722222222222221) internal successors, (193), 18 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:44,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:44,556 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:44,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-09 01:27:44,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 01:27:44,757 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-09 01:27:44,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:44,757 INFO L85 PathProgramCache]: Analyzing trace with hash 886095954, now seen corresponding path program 12 times [2025-03-09 01:27:44,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:44,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282229668] [2025-03-09 01:27:44,758 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:27:44,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:44,763 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 4 equivalence classes. [2025-03-09 01:27:44,767 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 32 statements. [2025-03-09 01:27:44,767 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:27:44,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:27:44,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:44,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282229668] [2025-03-09 01:27:44,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282229668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:44,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661599001] [2025-03-09 01:27:44,826 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:27:44,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:44,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:44,827 INFO L229 MonitoredProcess]: Starting monitored process 23 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,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-09 01:27:44,867 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 4 equivalence classes. [2025-03-09 01:27:44,884 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 32 statements. [2025-03-09 01:27:44,884 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:27:44,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:44,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:27:44,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:44,965 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:27:44,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:27:45,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661599001] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:45,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:45,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-09 01:27:45,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67304996] [2025-03-09 01:27:45,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:45,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:27:45,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:45,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:27:45,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:27:45,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 50 [2025-03-09 01:27:45,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 641 transitions, 8419 flow. Second operand has 17 states, 17 states have (on average 9.941176470588236) internal successors, (169), 17 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:45,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:45,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 50 [2025-03-09 01:27:45,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand