./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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-sum-array-hom.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:30:27,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:30:27,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:30:27,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:30:27,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:30:27,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:30:27,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:30:27,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:30:27,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:30:27,866 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:30:27,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:30:27,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:30:27,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:30:27,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:30:27,866 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:30:27,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:30:27,867 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:30:27,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:30:27,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:30:27,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:30:27,867 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:30:27,867 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:30:27,867 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:30:27,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:30:27,867 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:30:27,868 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:30:27,868 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:30:27,868 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:30:27,868 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:30:27,868 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:30:27,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:30:27,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:30:27,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:30:27,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:30:27,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:30:27,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:30:27,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:30:27,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:30:27,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:30:27,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:30:27,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:30:27,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:30:27,869 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 -> 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a [2025-03-17 14:30:28,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:30:28,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:30:28,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:30:28,141 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:30:28,142 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:30:28,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-03-17 14:30:29,268 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed28be83/c7c01418b5574ab78fa0faa0358fdf81/FLAGc9b3e4abb [2025-03-17 14:30:29,533 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:30:29,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-03-17 14:30:29,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed28be83/c7c01418b5574ab78fa0faa0358fdf81/FLAGc9b3e4abb [2025-03-17 14:30:29,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed28be83/c7c01418b5574ab78fa0faa0358fdf81 [2025-03-17 14:30:29,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:30:29,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:30:29,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:30:29,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:30:29,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:30:29,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:30:29" (1/1) ... [2025-03-17 14:30:29,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204bb8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:29, skipping insertion in model container [2025-03-17 14:30:29,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:30:29" (1/1) ... [2025-03-17 14:30:29,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:30:29,977 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-17 14:30:29,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:30:29,995 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:30:30,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:30:30,037 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:30:30,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:30 WrapperNode [2025-03-17 14:30:30,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:30:30,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:30:30,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:30:30,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:30:30,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:30" (1/1) ... [2025-03-17 14:30:30,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:30" (1/1) ... [2025-03-17 14:30:30,073 INFO L138 Inliner]: procedures = 24, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2025-03-17 14:30:30,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:30:30,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:30:30,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:30:30,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:30:30,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:30" (1/1) ... [2025-03-17 14:30:30,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:30" (1/1) ... [2025-03-17 14:30:30,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:30" (1/1) ... [2025-03-17 14:30:30,101 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-17 14:30:30,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:30" (1/1) ... [2025-03-17 14:30:30,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:30" (1/1) ... [2025-03-17 14:30:30,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:30" (1/1) ... [2025-03-17 14:30:30,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:30" (1/1) ... [2025-03-17 14:30:30,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:30" (1/1) ... [2025-03-17 14:30:30,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:30" (1/1) ... [2025-03-17 14:30:30,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:30:30,118 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:30:30,118 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:30:30,118 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:30:30,119 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:30" (1/1) ... [2025-03-17 14:30:30,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:30:30,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:30,142 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-17 14:30:30,150 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-17 14:30:30,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:30:30,170 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:30:30,170 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:30:30,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:30:30,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:30:30,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 14:30:30,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 14:30:30,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:30:30,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:30:30,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:30:30,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:30:30,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:30:30,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:30:30,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:30:30,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:30:30,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:30:30,173 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:30:30,259 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:30:30,261 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:30:30,496 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:30:30,496 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:30:30,620 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:30:30,624 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:30:30,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:30:30 BoogieIcfgContainer [2025-03-17 14:30:30,624 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:30:30,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:30:30,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:30:30,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:30:30,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:30:29" (1/3) ... [2025-03-17 14:30:30,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4154b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:30:30, skipping insertion in model container [2025-03-17 14:30:30,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:30" (2/3) ... [2025-03-17 14:30:30,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4154b65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:30:30, skipping insertion in model container [2025-03-17 14:30:30,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:30:30" (3/3) ... [2025-03-17 14:30:30,634 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2025-03-17 14:30:30,643 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:30:30,644 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sum-array-hom.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 4 loop locations, and 10 error locations. [2025-03-17 14:30:30,644 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:30:30,691 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 14:30:30,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 103 flow [2025-03-17 14:30:30,754 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-03-17 14:30:30,757 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 14:30:30,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 4/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-03-17 14:30:30,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 103 flow [2025-03-17 14:30:30,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 37 transitions, 92 flow [2025-03-17 14:30:30,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:30:30,785 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;@73371984, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:30:30,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-17 14:30:30,791 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:30:30,791 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:30:30,791 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:30:30,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:30,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:30:30,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:30,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash 331881, now seen corresponding path program 1 times [2025-03-17 14:30:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:30,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166243802] [2025-03-17 14:30:30,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:30,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:30,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:30:30,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:30:30,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:30,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:30,996 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-17 14:30:30,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:30,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166243802] [2025-03-17 14:30:30,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166243802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:30,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:30,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:30:31,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174715323] [2025-03-17 14:30:31,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:31,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:30:31,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:31,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:30:31,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:30:31,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:30:31,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:31,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:31,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:30:31,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:31,156 INFO L124 PetriNetUnfolderBase]: 200/348 cut-off events. [2025-03-17 14:30:31,157 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-17 14:30:31,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 348 events. 200/348 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1189 event pairs, 124 based on Foata normal form. 1/318 useless extension candidates. Maximal degree in co-relation 585. Up to 293 conditions per place. [2025-03-17 14:30:31,161 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 21 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2025-03-17 14:30:31,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 132 flow [2025-03-17 14:30:31,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:30:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:30:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-17 14:30:31,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2025-03-17 14:30:31,178 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 92 flow. Second operand 3 states and 70 transitions. [2025-03-17 14:30:31,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 132 flow [2025-03-17 14:30:31,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 120 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 14:30:31,184 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 78 flow [2025-03-17 14:30:31,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-03-17 14:30:31,188 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2025-03-17 14:30:31,189 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 78 flow [2025-03-17 14:30:31,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:31,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:31,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:30:31,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:30:31,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:31,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash 331882, now seen corresponding path program 1 times [2025-03-17 14:30:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:31,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749760622] [2025-03-17 14:30:31,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:31,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:31,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:30:31,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:30:31,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:31,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:31,434 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-17 14:30:31,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:31,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749760622] [2025-03-17 14:30:31,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749760622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:31,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:31,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:30:31,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430200499] [2025-03-17 14:30:31,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:31,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:30:31,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:31,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:30:31,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:30:31,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:30:31,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:31,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:31,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:30:31,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:31,589 INFO L124 PetriNetUnfolderBase]: 201/351 cut-off events. [2025-03-17 14:30:31,590 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 14:30:31,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 351 events. 201/351 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1198 event pairs, 124 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 647. Up to 298 conditions per place. [2025-03-17 14:30:31,594 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 23 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2025-03-17 14:30:31,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 140 flow [2025-03-17 14:30:31,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:30:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:30:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-03-17 14:30:31,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2025-03-17 14:30:31,596 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 78 flow. Second operand 4 states and 88 transitions. [2025-03-17 14:30:31,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 140 flow [2025-03-17 14:30:31,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:31,597 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 101 flow [2025-03-17 14:30:31,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-03-17 14:30:31,598 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2025-03-17 14:30:31,598 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 101 flow [2025-03-17 14:30:31,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:31,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:31,598 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:30:31,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:30:31,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:31,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:31,600 INFO L85 PathProgramCache]: Analyzing trace with hash 318949510, now seen corresponding path program 1 times [2025-03-17 14:30:31,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:31,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841884883] [2025-03-17 14:30:31,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:31,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:31,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:30:31,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:30:31,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:31,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:31,835 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-17 14:30:31,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:31,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841884883] [2025-03-17 14:30:31,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841884883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:31,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251626321] [2025-03-17 14:30:31,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:31,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:31,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:31,838 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-17 14:30:31,840 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-17 14:30:31,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:30:31,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:30:31,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:31,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:31,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 14:30:31,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:31,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-17 14:30:32,106 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-17 14:30:32,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:32,195 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-17 14:30:32,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251626321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:32,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:32,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:30:32,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416346140] [2025-03-17 14:30:32,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:32,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:30:32,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:32,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:30:32,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:30:32,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:30:32,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 101 flow. Second operand has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:32,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:32,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:30:32,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:32,491 INFO L124 PetriNetUnfolderBase]: 202/353 cut-off events. [2025-03-17 14:30:32,491 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 14:30:32,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 353 events. 202/353 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1208 event pairs, 124 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 654. Up to 295 conditions per place. [2025-03-17 14:30:32,493 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 19 selfloop transitions, 10 changer transitions 0/39 dead transitions. [2025-03-17 14:30:32,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 167 flow [2025-03-17 14:30:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:30:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:30:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2025-03-17 14:30:32,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2025-03-17 14:30:32,496 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 101 flow. Second operand 8 states and 151 transitions. [2025-03-17 14:30:32,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 167 flow [2025-03-17 14:30:32,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:30:32,498 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 126 flow [2025-03-17 14:30:32,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=126, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2025-03-17 14:30:32,498 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-03-17 14:30:32,498 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 126 flow [2025-03-17 14:30:32,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:32,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:32,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:30:32,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:30:32,705 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-17 14:30:32,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:32,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:32,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1299509624, now seen corresponding path program 1 times [2025-03-17 14:30:32,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:32,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696400323] [2025-03-17 14:30:32,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:32,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:32,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:30:32,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:30:32,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:32,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:32,783 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-17 14:30:32,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:32,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696400323] [2025-03-17 14:30:32,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696400323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:32,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:32,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:30:32,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495709751] [2025-03-17 14:30:32,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:32,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:30:32,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:32,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:30:32,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:30:32,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-17 14:30:32,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:32,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:32,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-17 14:30:32,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:32,857 INFO L124 PetriNetUnfolderBase]: 202/336 cut-off events. [2025-03-17 14:30:32,857 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 14:30:32,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 336 events. 202/336 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1042 event pairs, 124 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 638. Up to 294 conditions per place. [2025-03-17 14:30:32,859 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 25 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2025-03-17 14:30:32,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 178 flow [2025-03-17 14:30:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:30:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:30:32,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2025-03-17 14:30:32,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2025-03-17 14:30:32,861 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 126 flow. Second operand 4 states and 74 transitions. [2025-03-17 14:30:32,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 178 flow [2025-03-17 14:30:32,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 136 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-17 14:30:32,862 INFO L231 Difference]: Finished difference. Result has 37 places, 36 transitions, 86 flow [2025-03-17 14:30:32,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=36} [2025-03-17 14:30:32,862 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -6 predicate places. [2025-03-17 14:30:32,863 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 36 transitions, 86 flow [2025-03-17 14:30:32,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:32,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:32,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:30:32,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:30:32,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:32,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:32,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1299509625, now seen corresponding path program 1 times [2025-03-17 14:30:32,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:32,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600418160] [2025-03-17 14:30:32,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:32,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:32,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:30:32,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:30:32,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:32,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:32,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-17 14:30:32,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:32,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600418160] [2025-03-17 14:30:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600418160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:32,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:32,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:30:32,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037564954] [2025-03-17 14:30:32,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:32,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:30:32,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:32,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:30:32,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:30:32,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:30:32,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:32,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:32,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:30:32,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:33,048 INFO L124 PetriNetUnfolderBase]: 433/716 cut-off events. [2025-03-17 14:30:33,048 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 14:30:33,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1404 conditions, 716 events. 433/716 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2742 event pairs, 248 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 813. Up to 384 conditions per place. [2025-03-17 14:30:33,053 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 54 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2025-03-17 14:30:33,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 65 transitions, 270 flow [2025-03-17 14:30:33,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:30:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:30:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2025-03-17 14:30:33,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6439024390243903 [2025-03-17 14:30:33,054 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 86 flow. Second operand 5 states and 132 transitions. [2025-03-17 14:30:33,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 65 transitions, 270 flow [2025-03-17 14:30:33,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 65 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:33,055 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 106 flow [2025-03-17 14:30:33,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-03-17 14:30:33,056 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-03-17 14:30:33,056 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 106 flow [2025-03-17 14:30:33,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:33,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:33,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:33,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:30:33,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:33,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:33,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1031924180, now seen corresponding path program 1 times [2025-03-17 14:30:33,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:33,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938355218] [2025-03-17 14:30:33,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:33,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:33,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:30:33,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:30:33,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:33,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:33,114 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-17 14:30:33,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:33,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938355218] [2025-03-17 14:30:33,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938355218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:33,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:30:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188612827] [2025-03-17 14:30:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:30:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:33,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:30:33,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:30:33,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:30:33,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:33,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:33,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:30:33,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:33,238 INFO L124 PetriNetUnfolderBase]: 410/680 cut-off events. [2025-03-17 14:30:33,238 INFO L125 PetriNetUnfolderBase]: For 222/253 co-relation queries the response was YES. [2025-03-17 14:30:33,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1523 conditions, 680 events. 410/680 cut-off events. For 222/253 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2581 event pairs, 248 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 900. Up to 389 conditions per place. [2025-03-17 14:30:33,241 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 51 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-03-17 14:30:33,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 282 flow [2025-03-17 14:30:33,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:30:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:30:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-03-17 14:30:33,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6292682926829268 [2025-03-17 14:30:33,243 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 106 flow. Second operand 5 states and 129 transitions. [2025-03-17 14:30:33,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 282 flow [2025-03-17 14:30:33,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:33,244 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 126 flow [2025-03-17 14:30:33,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-03-17 14:30:33,245 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2025-03-17 14:30:33,245 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 126 flow [2025-03-17 14:30:33,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:33,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:33,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:33,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:30:33,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:33,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:33,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1359541213, now seen corresponding path program 1 times [2025-03-17 14:30:33,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:33,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524697081] [2025-03-17 14:30:33,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:33,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:33,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:30:33,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:30:33,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:33,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:33,390 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-17 14:30:33,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:33,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524697081] [2025-03-17 14:30:33,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524697081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:33,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569742416] [2025-03-17 14:30:33,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:33,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:33,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:33,393 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-17 14:30:33,394 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-17 14:30:33,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:30:33,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:30:33,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:33,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:33,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:30:33,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:33,495 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-17 14:30:33,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:33,536 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-17 14:30:33,544 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-17 14:30:33,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569742416] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:33,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:33,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 14:30:33,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410031627] [2025-03-17 14:30:33,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:33,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:30:33,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:33,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:30:33,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:30:33,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:30:33,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 126 flow. Second operand has 11 states, 11 states have (on average 16.454545454545453) internal successors, (181), 11 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:33,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:33,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:30:33,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:33,909 INFO L124 PetriNetUnfolderBase]: 491/823 cut-off events. [2025-03-17 14:30:33,909 INFO L125 PetriNetUnfolderBase]: For 418/470 co-relation queries the response was YES. [2025-03-17 14:30:33,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2018 conditions, 823 events. 491/823 cut-off events. For 418/470 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3417 event pairs, 293 based on Foata normal form. 0/781 useless extension candidates. Maximal degree in co-relation 1278. Up to 404 conditions per place. [2025-03-17 14:30:33,913 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 52 selfloop transitions, 8 changer transitions 0/66 dead transitions. [2025-03-17 14:30:33,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 312 flow [2025-03-17 14:30:33,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:30:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:30:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2025-03-17 14:30:33,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6016260162601627 [2025-03-17 14:30:33,914 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 126 flow. Second operand 6 states and 148 transitions. [2025-03-17 14:30:33,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 312 flow [2025-03-17 14:30:33,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:33,916 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 152 flow [2025-03-17 14:30:33,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-03-17 14:30:33,916 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2025-03-17 14:30:33,917 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 152 flow [2025-03-17 14:30:33,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.454545454545453) internal successors, (181), 11 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:33,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:33,917 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:33,924 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-17 14:30:34,117 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,SelfDestructingSolverStorable6 [2025-03-17 14:30:34,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:34,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash 449502969, now seen corresponding path program 1 times [2025-03-17 14:30:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:34,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879905494] [2025-03-17 14:30:34,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:34,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:30:34,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:30:34,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:34,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:30:34,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:34,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879905494] [2025-03-17 14:30:34,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879905494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:34,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:34,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:30:34,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004235752] [2025-03-17 14:30:34,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:34,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:30:34,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:34,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:30:34,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:30:34,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:30:34,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:34,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:34,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:30:34,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:34,293 INFO L124 PetriNetUnfolderBase]: 483/777 cut-off events. [2025-03-17 14:30:34,293 INFO L125 PetriNetUnfolderBase]: For 923/1094 co-relation queries the response was YES. [2025-03-17 14:30:34,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2188 conditions, 777 events. 483/777 cut-off events. For 923/1094 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2991 event pairs, 306 based on Foata normal form. 0/743 useless extension candidates. Maximal degree in co-relation 1492. Up to 511 conditions per place. [2025-03-17 14:30:34,298 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 50 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2025-03-17 14:30:34,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 324 flow [2025-03-17 14:30:34,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:30:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:30:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-17 14:30:34,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6146341463414634 [2025-03-17 14:30:34,299 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 152 flow. Second operand 5 states and 126 transitions. [2025-03-17 14:30:34,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 324 flow [2025-03-17 14:30:34,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 309 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-17 14:30:34,301 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 164 flow [2025-03-17 14:30:34,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-03-17 14:30:34,302 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2025-03-17 14:30:34,302 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 164 flow [2025-03-17 14:30:34,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:34,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:34,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:34,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:30:34,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:34,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:34,304 INFO L85 PathProgramCache]: Analyzing trace with hash 823857040, now seen corresponding path program 1 times [2025-03-17 14:30:34,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:34,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602097465] [2025-03-17 14:30:34,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:34,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:34,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:30:34,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:30:34,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:34,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:34,436 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-17 14:30:34,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:34,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602097465] [2025-03-17 14:30:34,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602097465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:34,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129212829] [2025-03-17 14:30:34,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:34,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:34,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:34,439 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-17 14:30:34,441 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-17 14:30:34,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:30:34,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:30:34,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:34,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:34,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:30:34,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:34,556 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-17 14:30:34,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:34,604 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-17 14:30:34,614 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-17 14:30:34,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129212829] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:34,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:34,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 14:30:34,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87206480] [2025-03-17 14:30:34,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:34,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:30:34,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:34,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:30:34,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:30:34,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:30:34,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 164 flow. Second operand has 11 states, 11 states have (on average 16.818181818181817) internal successors, (185), 11 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:34,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:34,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:30:34,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:34,935 INFO L124 PetriNetUnfolderBase]: 625/1028 cut-off events. [2025-03-17 14:30:34,935 INFO L125 PetriNetUnfolderBase]: For 1053/1271 co-relation queries the response was YES. [2025-03-17 14:30:34,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 1028 events. 625/1028 cut-off events. For 1053/1271 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4484 event pairs, 358 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 2185. Up to 564 conditions per place. [2025-03-17 14:30:34,942 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 54 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2025-03-17 14:30:34,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 367 flow [2025-03-17 14:30:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:30:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:30:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2025-03-17 14:30:34,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5934959349593496 [2025-03-17 14:30:34,943 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 164 flow. Second operand 6 states and 146 transitions. [2025-03-17 14:30:34,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 367 flow [2025-03-17 14:30:34,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:34,950 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 190 flow [2025-03-17 14:30:34,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2025-03-17 14:30:34,951 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2025-03-17 14:30:34,951 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 190 flow [2025-03-17 14:30:34,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.818181818181817) internal successors, (185), 11 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:34,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:34,952 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:34,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:30:35,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:35,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:35,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash 849059073, now seen corresponding path program 1 times [2025-03-17 14:30:35,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:35,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134734199] [2025-03-17 14:30:35,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:35,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:30:35,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:30:35,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:35,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:30:35,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:35,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134734199] [2025-03-17 14:30:35,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134734199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:35,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087084167] [2025-03-17 14:30:35,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:35,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:35,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:35,248 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-17 14:30:35,250 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-17 14:30:35,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:30:35,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:30:35,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:35,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:35,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:30:35,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:35,349 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-17 14:30:35,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:35,392 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-17 14:30:35,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087084167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:35,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:35,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 14:30:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406840050] [2025-03-17 14:30:35,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:35,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:30:35,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:35,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:30:35,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:30:35,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:30:35,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 190 flow. Second operand has 14 states, 14 states have (on average 16.714285714285715) internal successors, (234), 14 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:35,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:35,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:30:35,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:35,791 INFO L124 PetriNetUnfolderBase]: 1167/1863 cut-off events. [2025-03-17 14:30:35,791 INFO L125 PetriNetUnfolderBase]: For 2164/2469 co-relation queries the response was YES. [2025-03-17 14:30:35,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5842 conditions, 1863 events. 1167/1863 cut-off events. For 2164/2469 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8825 event pairs, 547 based on Foata normal form. 34/1893 useless extension candidates. Maximal degree in co-relation 3771. Up to 806 conditions per place. [2025-03-17 14:30:35,806 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 80 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2025-03-17 14:30:35,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 99 transitions, 594 flow [2025-03-17 14:30:35,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:30:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:30:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions. [2025-03-17 14:30:35,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2025-03-17 14:30:35,808 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 190 flow. Second operand 8 states and 194 transitions. [2025-03-17 14:30:35,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 99 transitions, 594 flow [2025-03-17 14:30:35,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 99 transitions, 573 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-17 14:30:35,818 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 250 flow [2025-03-17 14:30:35,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=250, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-03-17 14:30:35,819 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2025-03-17 14:30:35,820 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 250 flow [2025-03-17 14:30:35,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.714285714285715) internal successors, (234), 14 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:35,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:35,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:35,827 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-17 14:30:36,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:36,021 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:36,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:36,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1443827549, now seen corresponding path program 1 times [2025-03-17 14:30:36,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:36,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796861571] [2025-03-17 14:30:36,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:36,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:30:36,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:30:36,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:36,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:36,182 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-17 14:30:36,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:36,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796861571] [2025-03-17 14:30:36,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796861571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:36,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290366377] [2025-03-17 14:30:36,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:36,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:36,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:36,185 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-17 14:30:36,186 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-17 14:30:36,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:30:36,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:30:36,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:36,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:36,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 14:30:36,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:36,357 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-17 14:30:36,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:30:36,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290366377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:36,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:30:36,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2025-03-17 14:30:36,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046190353] [2025-03-17 14:30:36,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:36,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:30:36,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:36,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:30:36,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:30:36,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-03-17 14:30:36,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:36,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:36,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-03-17 14:30:36,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:36,640 INFO L124 PetriNetUnfolderBase]: 1113/1703 cut-off events. [2025-03-17 14:30:36,640 INFO L125 PetriNetUnfolderBase]: For 4121/4555 co-relation queries the response was YES. [2025-03-17 14:30:36,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6102 conditions, 1703 events. 1113/1703 cut-off events. For 4121/4555 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7657 event pairs, 409 based on Foata normal form. 0/1620 useless extension candidates. Maximal degree in co-relation 4222. Up to 896 conditions per place. [2025-03-17 14:30:36,651 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 72 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2025-03-17 14:30:36,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 87 transitions, 658 flow [2025-03-17 14:30:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:30:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:30:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-03-17 14:30:36,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.516260162601626 [2025-03-17 14:30:36,653 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 250 flow. Second operand 6 states and 127 transitions. [2025-03-17 14:30:36,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 87 transitions, 658 flow [2025-03-17 14:30:36,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 634 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-17 14:30:36,657 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 252 flow [2025-03-17 14:30:36,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2025-03-17 14:30:36,659 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2025-03-17 14:30:36,659 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 252 flow [2025-03-17 14:30:36,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:36,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:36,659 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:36,666 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-17 14:30:36,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 14:30:36,864 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:36,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:36,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1452644532, now seen corresponding path program 1 times [2025-03-17 14:30:36,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:36,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056819474] [2025-03-17 14:30:36,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:36,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:36,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:30:36,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:30:36,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:36,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:30:36,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:36,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056819474] [2025-03-17 14:30:36,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056819474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:36,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548260844] [2025-03-17 14:30:36,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:36,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:36,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:36,938 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-17 14:30:36,943 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-17 14:30:36,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:30:36,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:30:36,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:36,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:36,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 14:30:36,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:37,066 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-17 14:30:37,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:37,113 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-17 14:30:37,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548260844] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:37,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:37,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-17 14:30:37,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49522254] [2025-03-17 14:30:37,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:37,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 14:30:37,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:37,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 14:30:37,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:30:37,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:30:37,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 252 flow. Second operand has 15 states, 15 states have (on average 16.933333333333334) internal successors, (254), 15 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:37,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:37,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:30:37,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:37,482 INFO L124 PetriNetUnfolderBase]: 1136/1713 cut-off events. [2025-03-17 14:30:37,482 INFO L125 PetriNetUnfolderBase]: For 4378/4803 co-relation queries the response was YES. [2025-03-17 14:30:37,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6404 conditions, 1713 events. 1136/1713 cut-off events. For 4378/4803 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7221 event pairs, 544 based on Foata normal form. 35/1745 useless extension candidates. Maximal degree in co-relation 4533. Up to 816 conditions per place. [2025-03-17 14:30:37,493 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 75 selfloop transitions, 13 changer transitions 0/93 dead transitions. [2025-03-17 14:30:37,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 93 transitions, 653 flow [2025-03-17 14:30:37,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:30:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:30:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2025-03-17 14:30:37,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-03-17 14:30:37,496 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 252 flow. Second operand 8 states and 192 transitions. [2025-03-17 14:30:37,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 93 transitions, 653 flow [2025-03-17 14:30:37,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 611 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 14:30:37,502 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 305 flow [2025-03-17 14:30:37,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=305, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2025-03-17 14:30:37,504 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2025-03-17 14:30:37,504 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 305 flow [2025-03-17 14:30:37,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.933333333333334) internal successors, (254), 15 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:37,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:37,505 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:37,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:30:37,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:37,706 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:37,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:37,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1843383653, now seen corresponding path program 2 times [2025-03-17 14:30:37,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:37,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057865082] [2025-03-17 14:30:37,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:37,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:37,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 14:30:37,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:30:37,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:37,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:37,852 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-17 14:30:37,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:37,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057865082] [2025-03-17 14:30:37,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057865082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:37,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446563215] [2025-03-17 14:30:37,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:37,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:37,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:37,854 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-17 14:30:37,855 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-17 14:30:37,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-17 14:30:37,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:30:37,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:37,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:37,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 14:30:37,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:37,909 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-17 14:30:38,002 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-17 14:30:38,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:38,129 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-17 14:30:38,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446563215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:38,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:38,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-17 14:30:38,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841089747] [2025-03-17 14:30:38,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:38,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 14:30:38,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:38,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 14:30:38,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:30:38,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-17 14:30:38,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 305 flow. Second operand has 20 states, 20 states have (on average 14.75) internal successors, (295), 20 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-17 14:30:38,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:38,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-17 14:30:38,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:39,337 INFO L124 PetriNetUnfolderBase]: 1330/1990 cut-off events. [2025-03-17 14:30:39,338 INFO L125 PetriNetUnfolderBase]: For 4621/4982 co-relation queries the response was YES. [2025-03-17 14:30:39,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7693 conditions, 1990 events. 1330/1990 cut-off events. For 4621/4982 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8667 event pairs, 296 based on Foata normal form. 0/1986 useless extension candidates. Maximal degree in co-relation 5218. Up to 416 conditions per place. [2025-03-17 14:30:39,350 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 137 selfloop transitions, 21 changer transitions 0/162 dead transitions. [2025-03-17 14:30:39,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 162 transitions, 1124 flow [2025-03-17 14:30:39,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:30:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:30:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 318 transitions. [2025-03-17 14:30:39,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.554006968641115 [2025-03-17 14:30:39,354 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 305 flow. Second operand 14 states and 318 transitions. [2025-03-17 14:30:39,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 162 transitions, 1124 flow [2025-03-17 14:30:39,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 162 transitions, 1096 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-17 14:30:39,363 INFO L231 Difference]: Finished difference. Result has 76 places, 56 transitions, 364 flow [2025-03-17 14:30:39,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=364, PETRI_PLACES=76, PETRI_TRANSITIONS=56} [2025-03-17 14:30:39,364 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2025-03-17 14:30:39,364 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 56 transitions, 364 flow [2025-03-17 14:30:39,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.75) internal successors, (295), 20 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-17 14:30:39,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:39,365 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:39,374 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-17 14:30:39,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:39,569 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:39,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:39,569 INFO L85 PathProgramCache]: Analyzing trace with hash -779141096, now seen corresponding path program 2 times [2025-03-17 14:30:39,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:39,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13541989] [2025-03-17 14:30:39,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:39,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:39,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-17 14:30:39,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:30:39,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:39,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:39,698 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-17 14:30:39,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:39,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13541989] [2025-03-17 14:30:39,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13541989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:39,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062075875] [2025-03-17 14:30:39,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:39,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:39,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:39,700 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-17 14:30:39,702 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-17 14:30:39,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-17 14:30:39,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:30:39,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:39,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:39,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:30:39,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:39,850 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-17 14:30:39,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:39,933 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-17 14:30:39,973 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-17 14:30:39,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062075875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:39,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:39,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-17 14:30:39,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444634176] [2025-03-17 14:30:39,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:39,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 14:30:39,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:39,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 14:30:39,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:30:40,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-03-17 14:30:40,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 56 transitions, 364 flow. Second operand has 20 states, 20 states have (on average 16.05) internal successors, (321), 20 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:40,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:40,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-03-17 14:30:40,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:41,036 INFO L124 PetriNetUnfolderBase]: 1587/2284 cut-off events. [2025-03-17 14:30:41,036 INFO L125 PetriNetUnfolderBase]: For 9197/9728 co-relation queries the response was YES. [2025-03-17 14:30:41,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9520 conditions, 2284 events. 1587/2284 cut-off events. For 9197/9728 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9457 event pairs, 312 based on Foata normal form. 0/2278 useless extension candidates. Maximal degree in co-relation 6545. Up to 481 conditions per place. [2025-03-17 14:30:41,055 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 140 selfloop transitions, 21 changer transitions 0/166 dead transitions. [2025-03-17 14:30:41,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 166 transitions, 1315 flow [2025-03-17 14:30:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:30:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:30:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 325 transitions. [2025-03-17 14:30:41,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5662020905923345 [2025-03-17 14:30:41,060 INFO L175 Difference]: Start difference. First operand has 76 places, 56 transitions, 364 flow. Second operand 14 states and 325 transitions. [2025-03-17 14:30:41,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 166 transitions, 1315 flow [2025-03-17 14:30:41,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 166 transitions, 1107 flow, removed 48 selfloop flow, removed 10 redundant places. [2025-03-17 14:30:41,070 INFO L231 Difference]: Finished difference. Result has 80 places, 59 transitions, 374 flow [2025-03-17 14:30:41,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=374, PETRI_PLACES=80, PETRI_TRANSITIONS=59} [2025-03-17 14:30:41,072 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2025-03-17 14:30:41,072 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 59 transitions, 374 flow [2025-03-17 14:30:41,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 16.05) internal successors, (321), 20 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:41,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:41,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:41,079 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-17 14:30:41,272 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,SelfDestructingSolverStorable13 [2025-03-17 14:30:41,273 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:41,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:41,273 INFO L85 PathProgramCache]: Analyzing trace with hash 632334207, now seen corresponding path program 1 times [2025-03-17 14:30:41,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:41,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82821856] [2025-03-17 14:30:41,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:41,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:30:41,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:30:41,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:41,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:30:41,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:41,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82821856] [2025-03-17 14:30:41,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82821856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:41,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:41,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:30:41,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641179802] [2025-03-17 14:30:41,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:41,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:30:41,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:41,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:30:41,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:30:41,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2025-03-17 14:30:41,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 59 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:41,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:41,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2025-03-17 14:30:41,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:41,530 INFO L124 PetriNetUnfolderBase]: 1434/2297 cut-off events. [2025-03-17 14:30:41,530 INFO L125 PetriNetUnfolderBase]: For 7871/8205 co-relation queries the response was YES. [2025-03-17 14:30:41,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9378 conditions, 2297 events. 1434/2297 cut-off events. For 7871/8205 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11075 event pairs, 388 based on Foata normal form. 3/2281 useless extension candidates. Maximal degree in co-relation 7067. Up to 1405 conditions per place. [2025-03-17 14:30:41,541 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 60 selfloop transitions, 6 changer transitions 8/82 dead transitions. [2025-03-17 14:30:41,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 82 transitions, 662 flow [2025-03-17 14:30:41,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:30:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:30:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-17 14:30:41,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7235772357723578 [2025-03-17 14:30:41,542 INFO L175 Difference]: Start difference. First operand has 80 places, 59 transitions, 374 flow. Second operand 3 states and 89 transitions. [2025-03-17 14:30:41,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 82 transitions, 662 flow [2025-03-17 14:30:41,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 82 transitions, 574 flow, removed 15 selfloop flow, removed 10 redundant places. [2025-03-17 14:30:41,549 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 314 flow [2025-03-17 14:30:41,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2025-03-17 14:30:41,550 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2025-03-17 14:30:41,550 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 314 flow [2025-03-17 14:30:41,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:41,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:41,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:41,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:30:41,550 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:41,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:41,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1336462417, now seen corresponding path program 1 times [2025-03-17 14:30:41,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:41,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389693942] [2025-03-17 14:30:41,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:41,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:41,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:30:41,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:30:41,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:41,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:41,619 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-17 14:30:41,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:41,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389693942] [2025-03-17 14:30:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389693942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:41,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357477035] [2025-03-17 14:30:41,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:41,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:41,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:41,621 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-17 14:30:41,623 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-17 14:30:41,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:30:41,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:30:41,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:41,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:41,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:30:41,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:41,721 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-17 14:30:41,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:41,762 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-17 14:30:41,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357477035] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:41,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:30:41,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-03-17 14:30:41,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257974074] [2025-03-17 14:30:41,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:41,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:30:41,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:41,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:30:41,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:30:41,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-03-17 14:30:41,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 314 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:41,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:41,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-03-17 14:30:41,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:42,108 INFO L124 PetriNetUnfolderBase]: 2520/3587 cut-off events. [2025-03-17 14:30:42,108 INFO L125 PetriNetUnfolderBase]: For 8733/9202 co-relation queries the response was YES. [2025-03-17 14:30:42,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13498 conditions, 3587 events. 2520/3587 cut-off events. For 8733/9202 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16890 event pairs, 615 based on Foata normal form. 0/3312 useless extension candidates. Maximal degree in co-relation 9609. Up to 1509 conditions per place. [2025-03-17 14:30:42,121 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 138 selfloop transitions, 28 changer transitions 0/170 dead transitions. [2025-03-17 14:30:42,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 170 transitions, 1349 flow [2025-03-17 14:30:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:30:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:30:42,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions. [2025-03-17 14:30:42,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5582655826558266 [2025-03-17 14:30:42,126 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 314 flow. Second operand 9 states and 206 transitions. [2025-03-17 14:30:42,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 170 transitions, 1349 flow [2025-03-17 14:30:42,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 170 transitions, 1113 flow, removed 42 selfloop flow, removed 9 redundant places. [2025-03-17 14:30:42,143 INFO L231 Difference]: Finished difference. Result has 68 places, 73 transitions, 388 flow [2025-03-17 14:30:42,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=388, PETRI_PLACES=68, PETRI_TRANSITIONS=73} [2025-03-17 14:30:42,143 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2025-03-17 14:30:42,143 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 73 transitions, 388 flow [2025-03-17 14:30:42,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:42,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:42,144 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] [2025-03-17 14:30:42,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 14:30:42,344 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,SelfDestructingSolverStorable15 [2025-03-17 14:30:42,344 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:42,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:42,345 INFO L85 PathProgramCache]: Analyzing trace with hash 15424241, now seen corresponding path program 2 times [2025-03-17 14:30:42,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:42,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724984212] [2025-03-17 14:30:42,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:42,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 14:30:42,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:30:42,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:42,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:30:42,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:42,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724984212] [2025-03-17 14:30:42,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724984212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:42,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290606058] [2025-03-17 14:30:42,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:42,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:42,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:42,401 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-17 14:30:42,403 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-17 14:30:42,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 14:30:42,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:30:42,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:42,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:42,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:30:42,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:42,503 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-17 14:30:42,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:42,557 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-17 14:30:42,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290606058] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:42,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:30:42,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 12 [2025-03-17 14:30:42,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261954833] [2025-03-17 14:30:42,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:42,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:30:42,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:42,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:30:42,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:30:42,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-03-17 14:30:42,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 73 transitions, 388 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:42,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:42,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-03-17 14:30:42,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:42,904 INFO L124 PetriNetUnfolderBase]: 3199/4554 cut-off events. [2025-03-17 14:30:42,904 INFO L125 PetriNetUnfolderBase]: For 7640/7896 co-relation queries the response was YES. [2025-03-17 14:30:42,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15467 conditions, 4554 events. 3199/4554 cut-off events. For 7640/7896 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 22040 event pairs, 671 based on Foata normal form. 26/4497 useless extension candidates. Maximal degree in co-relation 10365. Up to 1624 conditions per place. [2025-03-17 14:30:42,924 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 143 selfloop transitions, 54 changer transitions 0/201 dead transitions. [2025-03-17 14:30:42,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 201 transitions, 1457 flow [2025-03-17 14:30:42,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:30:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:30:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2025-03-17 14:30:42,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5447154471544715 [2025-03-17 14:30:42,926 INFO L175 Difference]: Start difference. First operand has 68 places, 73 transitions, 388 flow. Second operand 9 states and 201 transitions. [2025-03-17 14:30:42,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 201 transitions, 1457 flow [2025-03-17 14:30:42,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 201 transitions, 1454 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:42,939 INFO L231 Difference]: Finished difference. Result has 80 places, 106 transitions, 826 flow [2025-03-17 14:30:42,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=826, PETRI_PLACES=80, PETRI_TRANSITIONS=106} [2025-03-17 14:30:42,939 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2025-03-17 14:30:42,940 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 106 transitions, 826 flow [2025-03-17 14:30:42,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:42,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:42,940 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] [2025-03-17 14:30:42,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 14:30:43,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:30:43,144 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:43,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1369714225, now seen corresponding path program 3 times [2025-03-17 14:30:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:43,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782582946] [2025-03-17 14:30:43,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:30:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:43,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-17 14:30:43,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 23 statements. [2025-03-17 14:30:43,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:30:43,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:30:43,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:43,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782582946] [2025-03-17 14:30:43,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782582946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:43,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822565357] [2025-03-17 14:30:43,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:30:43,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:43,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:43,202 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-17 14:30:43,203 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-17 14:30:43,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-17 14:30:43,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 23 statements. [2025-03-17 14:30:43,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:30:43,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:43,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:30:43,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:30:43,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:30:43,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822565357] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:43,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:43,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-17 14:30:43,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898076138] [2025-03-17 14:30:43,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:43,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:30:43,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:43,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:30:43,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:30:43,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-17 14:30:43,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 106 transitions, 826 flow. Second operand has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:43,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:43,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-17 14:30:43,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:44,500 INFO L124 PetriNetUnfolderBase]: 7390/10506 cut-off events. [2025-03-17 14:30:44,500 INFO L125 PetriNetUnfolderBase]: For 35817/35817 co-relation queries the response was YES. [2025-03-17 14:30:44,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46677 conditions, 10506 events. 7390/10506 cut-off events. For 35817/35817 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 55090 event pairs, 787 based on Foata normal form. 22/10192 useless extension candidates. Maximal degree in co-relation 36924. Up to 2594 conditions per place. [2025-03-17 14:30:44,557 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 360 selfloop transitions, 438 changer transitions 0/799 dead transitions. [2025-03-17 14:30:44,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 799 transitions, 8138 flow [2025-03-17 14:30:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 14:30:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-17 14:30:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 673 transitions. [2025-03-17 14:30:44,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5295043273013376 [2025-03-17 14:30:44,560 INFO L175 Difference]: Start difference. First operand has 80 places, 106 transitions, 826 flow. Second operand 31 states and 673 transitions. [2025-03-17 14:30:44,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 799 transitions, 8138 flow [2025-03-17 14:30:44,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 799 transitions, 8063 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:44,842 INFO L231 Difference]: Finished difference. Result has 134 places, 562 transitions, 7094 flow [2025-03-17 14:30:44,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=7094, PETRI_PLACES=134, PETRI_TRANSITIONS=562} [2025-03-17 14:30:44,843 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places. [2025-03-17 14:30:44,843 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 562 transitions, 7094 flow [2025-03-17 14:30:44,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:44,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:44,843 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] [2025-03-17 14:30:44,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 14:30:45,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:30:45,044 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:45,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1479428599, now seen corresponding path program 4 times [2025-03-17 14:30:45,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:45,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705156189] [2025-03-17 14:30:45,045 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:30:45,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:45,049 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-17 14:30:45,053 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-03-17 14:30:45,053 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 14:30:45,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:30:45,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:45,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705156189] [2025-03-17 14:30:45,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705156189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:45,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:45,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:30:45,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773952406] [2025-03-17 14:30:45,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:45,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:30:45,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:45,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:30:45,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:30:45,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-17 14:30:45,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 562 transitions, 7094 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:45,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:45,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-17 14:30:45,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:46,452 INFO L124 PetriNetUnfolderBase]: 8102/11514 cut-off events. [2025-03-17 14:30:46,452 INFO L125 PetriNetUnfolderBase]: For 86447/86447 co-relation queries the response was YES. [2025-03-17 14:30:46,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67029 conditions, 11514 events. 8102/11514 cut-off events. For 86447/86447 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 60632 event pairs, 2082 based on Foata normal form. 4/11516 useless extension candidates. Maximal degree in co-relation 65354. Up to 6772 conditions per place. [2025-03-17 14:30:46,544 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 528 selfloop transitions, 283 changer transitions 7/819 dead transitions. [2025-03-17 14:30:46,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 819 transitions, 11481 flow [2025-03-17 14:30:46,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:30:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:30:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2025-03-17 14:30:46,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.578397212543554 [2025-03-17 14:30:46,545 INFO L175 Difference]: Start difference. First operand has 134 places, 562 transitions, 7094 flow. Second operand 7 states and 166 transitions. [2025-03-17 14:30:46,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 819 transitions, 11481 flow [2025-03-17 14:30:47,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 819 transitions, 11231 flow, removed 125 selfloop flow, removed 0 redundant places. [2025-03-17 14:30:47,272 INFO L231 Difference]: Finished difference. Result has 145 places, 634 transitions, 8886 flow [2025-03-17 14:30:47,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6908, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8886, PETRI_PLACES=145, PETRI_TRANSITIONS=634} [2025-03-17 14:30:47,272 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places. [2025-03-17 14:30:47,273 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 634 transitions, 8886 flow [2025-03-17 14:30:47,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:47,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:47,273 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] [2025-03-17 14:30:47,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:30:47,273 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:47,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:47,273 INFO L85 PathProgramCache]: Analyzing trace with hash -82436599, now seen corresponding path program 5 times [2025-03-17 14:30:47,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:47,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974330402] [2025-03-17 14:30:47,274 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:30:47,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:47,289 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-03-17 14:30:47,294 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:30:47,294 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 14:30:47,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:47,355 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-17 14:30:47,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974330402] [2025-03-17 14:30:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974330402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425120605] [2025-03-17 14:30:47,355 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:30:47,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:47,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:47,357 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-17 14:30:47,359 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-17 14:30:47,393 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-03-17 14:30:47,406 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:30:47,406 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 14:30:47,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:47,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:30:47,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:47,465 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-17 14:30:47,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:47,521 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-17 14:30:47,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425120605] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:47,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:30:47,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-17 14:30:47,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21254979] [2025-03-17 14:30:47,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:47,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:30:47,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:47,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:30:47,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:30:47,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-03-17 14:30:47,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 634 transitions, 8886 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:47,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:47,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-03-17 14:30:47,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:48,872 INFO L124 PetriNetUnfolderBase]: 7222/10361 cut-off events. [2025-03-17 14:30:48,873 INFO L125 PetriNetUnfolderBase]: For 84600/85178 co-relation queries the response was YES. [2025-03-17 14:30:48,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62615 conditions, 10361 events. 7222/10361 cut-off events. For 84600/85178 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 56912 event pairs, 981 based on Foata normal form. 35/10351 useless extension candidates. Maximal degree in co-relation 60974. Up to 3462 conditions per place. [2025-03-17 14:30:48,940 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 435 selfloop transitions, 350 changer transitions 0/796 dead transitions. [2025-03-17 14:30:48,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 796 transitions, 12178 flow [2025-03-17 14:30:48,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:30:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:30:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2025-03-17 14:30:48,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5701219512195121 [2025-03-17 14:30:48,942 INFO L175 Difference]: Start difference. First operand has 145 places, 634 transitions, 8886 flow. Second operand 8 states and 187 transitions. [2025-03-17 14:30:48,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 796 transitions, 12178 flow [2025-03-17 14:30:49,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 796 transitions, 11850 flow, removed 34 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:49,626 INFO L231 Difference]: Finished difference. Result has 152 places, 690 transitions, 10673 flow [2025-03-17 14:30:49,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=8608, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=294, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10673, PETRI_PLACES=152, PETRI_TRANSITIONS=690} [2025-03-17 14:30:49,627 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places. [2025-03-17 14:30:49,627 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 690 transitions, 10673 flow [2025-03-17 14:30:49,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:49,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:49,627 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] [2025-03-17 14:30:49,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 14:30:49,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:49,828 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:49,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:49,828 INFO L85 PathProgramCache]: Analyzing trace with hash -494348573, now seen corresponding path program 6 times [2025-03-17 14:30:49,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:49,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906196595] [2025-03-17 14:30:49,828 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:30:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:49,833 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-03-17 14:30:49,836 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:30:49,837 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 14:30:49,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:30:49,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:49,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906196595] [2025-03-17 14:30:49,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906196595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:49,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781185764] [2025-03-17 14:30:49,877 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:30:49,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:49,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:49,879 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-17 14:30:49,880 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-17 14:30:49,915 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-03-17 14:30:49,932 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:30:49,932 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 14:30:49,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:49,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:30:49,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:50,001 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-17 14:30:50,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:50,048 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-17 14:30:50,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781185764] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:50,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:30:50,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-03-17 14:30:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403850365] [2025-03-17 14:30:50,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:50,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:30:50,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:50,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:30:50,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:30:50,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-03-17 14:30:50,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 690 transitions, 10673 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:50,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:50,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-03-17 14:30:50,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:51,639 INFO L124 PetriNetUnfolderBase]: 7577/10884 cut-off events. [2025-03-17 14:30:51,639 INFO L125 PetriNetUnfolderBase]: For 105413/105831 co-relation queries the response was YES. [2025-03-17 14:30:51,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69662 conditions, 10884 events. 7577/10884 cut-off events. For 105413/105831 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 60075 event pairs, 1061 based on Foata normal form. 52/10885 useless extension candidates. Maximal degree in co-relation 68240. Up to 4176 conditions per place. [2025-03-17 14:30:51,743 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 384 selfloop transitions, 511 changer transitions 1/907 dead transitions. [2025-03-17 14:30:51,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 907 transitions, 14687 flow [2025-03-17 14:30:51,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:30:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:30:51,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2025-03-17 14:30:51,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5826558265582655 [2025-03-17 14:30:51,745 INFO L175 Difference]: Start difference. First operand has 152 places, 690 transitions, 10673 flow. Second operand 9 states and 215 transitions. [2025-03-17 14:30:51,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 907 transitions, 14687 flow [2025-03-17 14:30:52,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 907 transitions, 14167 flow, removed 85 selfloop flow, removed 4 redundant places. [2025-03-17 14:30:52,809 INFO L231 Difference]: Finished difference. Result has 159 places, 753 transitions, 12809 flow [2025-03-17 14:30:52,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=10176, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=444, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12809, PETRI_PLACES=159, PETRI_TRANSITIONS=753} [2025-03-17 14:30:52,810 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 116 predicate places. [2025-03-17 14:30:52,810 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 753 transitions, 12809 flow [2025-03-17 14:30:52,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:52,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:52,810 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] [2025-03-17 14:30:52,816 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-17 14:30:53,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 14:30:53,011 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:53,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1314178827, now seen corresponding path program 7 times [2025-03-17 14:30:53,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:53,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956705531] [2025-03-17 14:30:53,011 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:30:53,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:53,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:30:53,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:30:53,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:53,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:53,088 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-17 14:30:53,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:53,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956705531] [2025-03-17 14:30:53,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956705531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:53,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969932939] [2025-03-17 14:30:53,088 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:30:53,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:53,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:53,090 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-17 14:30:53,093 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-17 14:30:53,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:30:53,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:30:53,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:53,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:53,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:30:53,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:53,212 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-17 14:30:53,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:53,278 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-17 14:30:53,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969932939] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:53,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:30:53,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2025-03-17 14:30:53,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419836454] [2025-03-17 14:30:53,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:53,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:30:53,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:53,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:30:53,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:30:53,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-03-17 14:30:53,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 753 transitions, 12809 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:53,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:53,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-03-17 14:30:53,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:54,795 INFO L124 PetriNetUnfolderBase]: 7621/10858 cut-off events. [2025-03-17 14:30:54,795 INFO L125 PetriNetUnfolderBase]: For 117340/117819 co-relation queries the response was YES. [2025-03-17 14:30:54,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71634 conditions, 10858 events. 7621/10858 cut-off events. For 117340/117819 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 59145 event pairs, 799 based on Foata normal form. 49/10866 useless extension candidates. Maximal degree in co-relation 70712. Up to 2961 conditions per place. [2025-03-17 14:30:54,885 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 321 selfloop transitions, 548 changer transitions 0/880 dead transitions. [2025-03-17 14:30:54,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 880 transitions, 15520 flow [2025-03-17 14:30:54,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:30:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:30:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2025-03-17 14:30:54,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2025-03-17 14:30:54,886 INFO L175 Difference]: Start difference. First operand has 159 places, 753 transitions, 12809 flow. Second operand 8 states and 184 transitions. [2025-03-17 14:30:54,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 880 transitions, 15520 flow [2025-03-17 14:30:56,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 880 transitions, 15349 flow, removed 84 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:56,041 INFO L231 Difference]: Finished difference. Result has 167 places, 760 transitions, 14641 flow [2025-03-17 14:30:56,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=12638, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=541, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=14641, PETRI_PLACES=167, PETRI_TRANSITIONS=760} [2025-03-17 14:30:56,042 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 124 predicate places. [2025-03-17 14:30:56,042 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 760 transitions, 14641 flow [2025-03-17 14:30:56,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:56,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:56,042 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] [2025-03-17 14:30:56,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 14:30:56,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:56,242 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:56,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1251332115, now seen corresponding path program 8 times [2025-03-17 14:30:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:56,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911676769] [2025-03-17 14:30:56,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:56,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:56,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 14:30:56,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:30:56,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:56,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:30:56,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:56,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911676769] [2025-03-17 14:30:56,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911676769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:56,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708994358] [2025-03-17 14:30:56,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:56,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:56,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:56,293 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-17 14:30:56,295 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-17 14:30:56,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 14:30:56,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:30:56,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:56,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:56,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:30:56,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:56,431 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-17 14:30:56,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:56,499 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-17 14:30:56,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708994358] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:56,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:30:56,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-03-17 14:30:56,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888711773] [2025-03-17 14:30:56,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:56,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:30:56,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:56,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:30:56,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:30:56,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-03-17 14:30:56,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 760 transitions, 14641 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:56,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:56,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-03-17 14:30:56,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:58,069 INFO L124 PetriNetUnfolderBase]: 7484/10716 cut-off events. [2025-03-17 14:30:58,069 INFO L125 PetriNetUnfolderBase]: For 145194/145594 co-relation queries the response was YES. [2025-03-17 14:30:58,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76793 conditions, 10716 events. 7484/10716 cut-off events. For 145194/145594 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 58501 event pairs, 1081 based on Foata normal form. 36/10700 useless extension candidates. Maximal degree in co-relation 76330. Up to 3917 conditions per place. [2025-03-17 14:30:58,163 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 273 selfloop transitions, 567 changer transitions 0/851 dead transitions. [2025-03-17 14:30:58,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 851 transitions, 16974 flow [2025-03-17 14:30:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:30:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:30:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 210 transitions. [2025-03-17 14:30:58,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5691056910569106 [2025-03-17 14:30:58,164 INFO L175 Difference]: Start difference. First operand has 167 places, 760 transitions, 14641 flow. Second operand 9 states and 210 transitions. [2025-03-17 14:30:58,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 851 transitions, 16974 flow [2025-03-17 14:30:59,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 851 transitions, 16936 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-17 14:30:59,752 INFO L231 Difference]: Finished difference. Result has 169 places, 763 transitions, 15765 flow [2025-03-17 14:30:59,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=14596, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=563, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15765, PETRI_PLACES=169, PETRI_TRANSITIONS=763} [2025-03-17 14:30:59,753 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 126 predicate places. [2025-03-17 14:30:59,753 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 763 transitions, 15765 flow [2025-03-17 14:30:59,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:30:59,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:59,753 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] [2025-03-17 14:30:59,759 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-17 14:30:59,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:59,954 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:30:59,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:59,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2085309743, now seen corresponding path program 1 times [2025-03-17 14:30:59,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:59,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079803060] [2025-03-17 14:30:59,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:59,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:59,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:30:59,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:30:59,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:59,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:00,001 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-17 14:31:00,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:31:00,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079803060] [2025-03-17 14:31:00,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079803060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:31:00,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504686896] [2025-03-17 14:31:00,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:31:00,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:31:00,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:31:00,005 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-17 14:31:00,006 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-17 14:31:00,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:31:00,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:31:00,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:31:00,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:00,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:31:00,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:31:00,084 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-17 14:31:00,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:31:00,107 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-17 14:31:00,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504686896] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:31:00,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:31:00,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-17 14:31:00,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271671356] [2025-03-17 14:31:00,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:31:00,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:31:00,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:31:00,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:31:00,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:31:00,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:31:00,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 763 transitions, 15765 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:31:00,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:31:00,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:31:00,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:31:01,289 INFO L124 PetriNetUnfolderBase]: 6210/8975 cut-off events. [2025-03-17 14:31:01,289 INFO L125 PetriNetUnfolderBase]: For 176755/177812 co-relation queries the response was YES. [2025-03-17 14:31:01,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72129 conditions, 8975 events. 6210/8975 cut-off events. For 176755/177812 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 49838 event pairs, 933 based on Foata normal form. 954/9705 useless extension candidates. Maximal degree in co-relation 70616. Up to 4479 conditions per place. [2025-03-17 14:31:01,378 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 643 selfloop transitions, 18 changer transitions 0/888 dead transitions. [2025-03-17 14:31:01,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 888 transitions, 19921 flow [2025-03-17 14:31:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:31:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:31:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-17 14:31:01,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.551219512195122 [2025-03-17 14:31:01,379 INFO L175 Difference]: Start difference. First operand has 169 places, 763 transitions, 15765 flow. Second operand 5 states and 113 transitions. [2025-03-17 14:31:01,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 888 transitions, 19921 flow [2025-03-17 14:31:02,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 888 transitions, 19327 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-03-17 14:31:02,559 INFO L231 Difference]: Finished difference. Result has 169 places, 755 transitions, 15240 flow [2025-03-17 14:31:02,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=15204, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15240, PETRI_PLACES=169, PETRI_TRANSITIONS=755} [2025-03-17 14:31:02,559 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 126 predicate places. [2025-03-17 14:31:02,559 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 755 transitions, 15240 flow [2025-03-17 14:31:02,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:31:02,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:31:02,560 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] [2025-03-17 14:31:02,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 14:31:02,760 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,SelfDestructingSolverStorable23 [2025-03-17 14:31:02,760 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:31:02,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:31:02,761 INFO L85 PathProgramCache]: Analyzing trace with hash 910614745, now seen corresponding path program 1 times [2025-03-17 14:31:02,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:31:02,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044333073] [2025-03-17 14:31:02,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:31:02,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:31:02,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:31:02,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:31:02,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:31:02,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:03,170 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-17 14:31:03,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:31:03,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044333073] [2025-03-17 14:31:03,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044333073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:31:03,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994341536] [2025-03-17 14:31:03,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:31:03,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:31:03,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:31:03,173 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-17 14:31:03,175 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-17 14:31:03,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:31:03,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:31:03,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:31:03,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:03,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 14:31:03,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:31:03,293 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-17 14:31:03,468 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 15 treesize of output 7 [2025-03-17 14:31:03,492 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-17 14:31:03,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:31:03,715 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-17 14:31:03,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994341536] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:31:03,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:31:03,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 26 [2025-03-17 14:31:03,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723175233] [2025-03-17 14:31:03,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:31:03,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 14:31:03,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:31:03,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 14:31:03,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2025-03-17 14:31:04,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:31:04,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 755 transitions, 15240 flow. Second operand has 27 states, 27 states have (on average 17.444444444444443) internal successors, (471), 27 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:31:04,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:31:04,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:31:04,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:31:06,030 INFO L124 PetriNetUnfolderBase]: 7257/10756 cut-off events. [2025-03-17 14:31:06,031 INFO L125 PetriNetUnfolderBase]: For 185266/186018 co-relation queries the response was YES. [2025-03-17 14:31:06,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84043 conditions, 10756 events. 7257/10756 cut-off events. For 185266/186018 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 62984 event pairs, 383 based on Foata normal form. 256/10909 useless extension candidates. Maximal degree in co-relation 82352. Up to 6880 conditions per place. [2025-03-17 14:31:06,105 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 539 selfloop transitions, 498 changer transitions 1/1135 dead transitions. [2025-03-17 14:31:06,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 1135 transitions, 24146 flow [2025-03-17 14:31:06,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:31:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:31:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 276 transitions. [2025-03-17 14:31:06,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2025-03-17 14:31:06,106 INFO L175 Difference]: Start difference. First operand has 169 places, 755 transitions, 15240 flow. Second operand 12 states and 276 transitions. [2025-03-17 14:31:06,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 1135 transitions, 24146 flow [2025-03-17 14:31:07,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 1135 transitions, 23928 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-17 14:31:07,253 INFO L231 Difference]: Finished difference. Result has 182 places, 1007 transitions, 23001 flow [2025-03-17 14:31:07,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=15085, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=23001, PETRI_PLACES=182, PETRI_TRANSITIONS=1007} [2025-03-17 14:31:07,254 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places. [2025-03-17 14:31:07,254 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 1007 transitions, 23001 flow [2025-03-17 14:31:07,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 17.444444444444443) internal successors, (471), 27 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:31:07,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:31:07,254 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] [2025-03-17 14:31:07,259 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-17 14:31:07,454 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-17 14:31:07,454 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:31:07,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:31:07,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2060225647, now seen corresponding path program 1 times [2025-03-17 14:31:07,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:31:07,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384600795] [2025-03-17 14:31:07,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:31:07,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:31:07,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:31:07,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:31:07,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:31:07,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:07,681 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-17 14:31:07,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:31:07,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384600795] [2025-03-17 14:31:07,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384600795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:31:07,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:31:07,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:31:07,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758030324] [2025-03-17 14:31:07,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:31:07,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:31:07,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:31:07,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:31:07,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:31:07,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2025-03-17 14:31:07,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 1007 transitions, 23001 flow. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:31:07,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:31:07,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2025-03-17 14:31:07,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:31:09,866 INFO L124 PetriNetUnfolderBase]: 8912/13329 cut-off events. [2025-03-17 14:31:09,867 INFO L125 PetriNetUnfolderBase]: For 304509/305774 co-relation queries the response was YES. [2025-03-17 14:31:09,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115059 conditions, 13329 events. 8912/13329 cut-off events. For 304509/305774 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 81707 event pairs, 507 based on Foata normal form. 472/13524 useless extension candidates. Maximal degree in co-relation 114281. Up to 8318 conditions per place. [2025-03-17 14:31:09,984 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 669 selfloop transitions, 518 changer transitions 17/1487 dead transitions. [2025-03-17 14:31:09,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1487 transitions, 36256 flow [2025-03-17 14:31:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:31:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:31:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions. [2025-03-17 14:31:09,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6371951219512195 [2025-03-17 14:31:09,988 INFO L175 Difference]: Start difference. First operand has 182 places, 1007 transitions, 23001 flow. Second operand 8 states and 209 transitions. [2025-03-17 14:31:09,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 1487 transitions, 36256 flow [2025-03-17 14:31:12,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 1487 transitions, 35716 flow, removed 167 selfloop flow, removed 3 redundant places. [2025-03-17 14:31:12,111 INFO L231 Difference]: Finished difference. Result has 191 places, 1346 transitions, 33558 flow [2025-03-17 14:31:12,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=22663, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1007, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=33558, PETRI_PLACES=191, PETRI_TRANSITIONS=1346} [2025-03-17 14:31:12,112 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places. [2025-03-17 14:31:12,112 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 1346 transitions, 33558 flow [2025-03-17 14:31:12,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:31:12,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:31:12,112 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] [2025-03-17 14:31:12,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 14:31:12,113 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:31:12,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:31:12,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1424991569, now seen corresponding path program 2 times [2025-03-17 14:31:12,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:31:12,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801533875] [2025-03-17 14:31:12,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:31:12,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:31:12,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 14:31:12,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:31:12,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:31:12,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:12,238 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-17 14:31:12,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:31:12,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801533875] [2025-03-17 14:31:12,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801533875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:31:12,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621709865] [2025-03-17 14:31:12,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:31:12,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:31:12,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:31:12,241 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-17 14:31:12,242 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-17 14:31:12,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 14:31:12,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:31:12,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:31:12,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:12,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 14:31:12,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:31:12,476 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 15 treesize of output 7 [2025-03-17 14:31:12,495 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-17 14:31:12,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:31:12,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:31:12,530 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 28 treesize of output 21 [2025-03-17 14:31:12,961 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-17 14:31:12,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621709865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:31:12,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:31:12,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 15 [2025-03-17 14:31:12,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121799393] [2025-03-17 14:31:12,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:31:12,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:31:12,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:31:12,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:31:12,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:31:13,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2025-03-17 14:31:13,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 1346 transitions, 33558 flow. Second operand has 16 states, 16 states have (on average 19.75) internal successors, (316), 16 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:31:13,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:31:13,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2025-03-17 14:31:13,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:31:15,889 INFO L124 PetriNetUnfolderBase]: 9560/14282 cut-off events. [2025-03-17 14:31:15,889 INFO L125 PetriNetUnfolderBase]: For 356519/357965 co-relation queries the response was YES. [2025-03-17 14:31:15,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129498 conditions, 14282 events. 9560/14282 cut-off events. For 356519/357965 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 88165 event pairs, 659 based on Foata normal form. 602/14545 useless extension candidates. Maximal degree in co-relation 128740. Up to 9874 conditions per place. [2025-03-17 14:31:16,003 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 827 selfloop transitions, 438 changer transitions 15/1557 dead transitions. [2025-03-17 14:31:16,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 1557 transitions, 40427 flow [2025-03-17 14:31:16,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:31:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:31:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2025-03-17 14:31:16,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6280487804878049 [2025-03-17 14:31:16,004 INFO L175 Difference]: Start difference. First operand has 191 places, 1346 transitions, 33558 flow. Second operand 8 states and 206 transitions. [2025-03-17 14:31:16,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 1557 transitions, 40427 flow [2025-03-17 14:31:18,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 1557 transitions, 40268 flow, removed 78 selfloop flow, removed 1 redundant places. [2025-03-17 14:31:18,806 INFO L231 Difference]: Finished difference. Result has 200 places, 1458 transitions, 37829 flow [2025-03-17 14:31:18,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=33399, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=916, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=37829, PETRI_PLACES=200, PETRI_TRANSITIONS=1458} [2025-03-17 14:31:18,808 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 157 predicate places. [2025-03-17 14:31:18,808 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 1458 transitions, 37829 flow [2025-03-17 14:31:18,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 19.75) internal successors, (316), 16 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:31:18,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:31:18,808 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] [2025-03-17 14:31:18,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-17 14:31:19,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 14:31:19,009 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:31:19,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:31:19,009 INFO L85 PathProgramCache]: Analyzing trace with hash 162832321, now seen corresponding path program 2 times [2025-03-17 14:31:19,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:31:19,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332872048] [2025-03-17 14:31:19,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:31:19,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:31:19,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 14:31:19,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:31:19,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:31:19,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:19,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:31:19,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:31:19,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332872048] [2025-03-17 14:31:19,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332872048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:31:19,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614945556] [2025-03-17 14:31:19,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:31:19,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:31:19,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:31:19,464 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-17 14:31:19,466 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-17 14:31:19,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 14:31:19,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:31:19,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:31:19,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:19,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 14:31:19,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:31:19,551 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-17 14:31:19,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:31:19,687 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 17 treesize of output 15 [2025-03-17 14:31:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:31:19,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:31:20,076 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 38 treesize of output 34 [2025-03-17 14:31:20,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:31:20,087 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 94 treesize of output 86 [2025-03-17 14:31:20,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:31:20,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614945556] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:31:20,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:31:20,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-03-17 14:31:20,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738001663] [2025-03-17 14:31:20,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:31:20,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 14:31:20,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:31:20,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 14:31:20,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2025-03-17 14:31:21,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:31:21,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 1458 transitions, 37829 flow. Second operand has 25 states, 25 states have (on average 17.24) internal successors, (431), 25 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:31:21,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:31:21,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:31:21,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:31:25,722 INFO L124 PetriNetUnfolderBase]: 12671/18677 cut-off events. [2025-03-17 14:31:25,722 INFO L125 PetriNetUnfolderBase]: For 466158/468008 co-relation queries the response was YES. [2025-03-17 14:31:25,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175293 conditions, 18677 events. 12671/18677 cut-off events. For 466158/468008 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 117026 event pairs, 565 based on Foata normal form. 783/19279 useless extension candidates. Maximal degree in co-relation 174513. Up to 10774 conditions per place. [2025-03-17 14:31:25,897 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 897 selfloop transitions, 1243 changer transitions 1/2238 dead transitions. [2025-03-17 14:31:25,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 2238 transitions, 59702 flow [2025-03-17 14:31:25,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 14:31:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 14:31:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 415 transitions. [2025-03-17 14:31:25,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5623306233062331 [2025-03-17 14:31:25,898 INFO L175 Difference]: Start difference. First operand has 200 places, 1458 transitions, 37829 flow. Second operand 18 states and 415 transitions. [2025-03-17 14:31:25,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 2238 transitions, 59702 flow [2025-03-17 14:31:30,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 2238 transitions, 58605 flow, removed 298 selfloop flow, removed 3 redundant places. [2025-03-17 14:31:30,791 INFO L231 Difference]: Finished difference. Result has 223 places, 1960 transitions, 54315 flow [2025-03-17 14:31:30,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=37006, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=767, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=54315, PETRI_PLACES=223, PETRI_TRANSITIONS=1960} [2025-03-17 14:31:30,793 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 180 predicate places. [2025-03-17 14:31:30,793 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 1960 transitions, 54315 flow [2025-03-17 14:31:30,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 17.24) internal successors, (431), 25 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:31:30,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:31:30,793 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] [2025-03-17 14:31:30,799 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-17 14:31:30,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:31:30,997 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:31:30,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:31:30,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1558679059, now seen corresponding path program 3 times [2025-03-17 14:31:30,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:31:30,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122607383] [2025-03-17 14:31:30,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:31:30,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:31:31,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-17 14:31:31,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 25 statements. [2025-03-17 14:31:31,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:31:31,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:31:31,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:31:31,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122607383] [2025-03-17 14:31:31,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122607383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:31:31,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840258111] [2025-03-17 14:31:31,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:31:31,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:31:31,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:31:31,351 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-17 14:31:31,353 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-17 14:31:31,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-17 14:31:31,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 25 statements. [2025-03-17 14:31:31,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:31:31,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:31,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 14:31:31,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:31:31,427 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-17 14:31:31,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:31:31,520 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 17 treesize of output 15 [2025-03-17 14:31:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:31:31,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:31:31,763 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 38 treesize of output 34 [2025-03-17 14:31:31,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:31:31,769 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 94 treesize of output 86 [2025-03-17 14:31:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:31:32,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840258111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:31:32,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:31:32,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 22 [2025-03-17 14:31:32,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057536009] [2025-03-17 14:31:32,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:31:32,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 14:31:32,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:31:32,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 14:31:32,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2025-03-17 14:31:32,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:31:32,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1960 transitions, 54315 flow. Second operand has 23 states, 23 states have (on average 17.26086956521739) internal successors, (397), 23 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:31:32,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:31:32,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:31:32,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:31:38,623 INFO L124 PetriNetUnfolderBase]: 13955/20565 cut-off events. [2025-03-17 14:31:38,623 INFO L125 PetriNetUnfolderBase]: For 554378/556249 co-relation queries the response was YES. [2025-03-17 14:31:38,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205038 conditions, 20565 events. 13955/20565 cut-off events. For 554378/556249 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 130376 event pairs, 716 based on Foata normal form. 607/20945 useless extension candidates. Maximal degree in co-relation 204216. Up to 12194 conditions per place. [2025-03-17 14:31:38,899 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 977 selfloop transitions, 1385 changer transitions 1/2460 dead transitions. [2025-03-17 14:31:38,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 2460 transitions, 69254 flow [2025-03-17 14:31:38,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 14:31:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 14:31:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 407 transitions. [2025-03-17 14:31:38,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.551490514905149 [2025-03-17 14:31:38,900 INFO L175 Difference]: Start difference. First operand has 223 places, 1960 transitions, 54315 flow. Second operand 18 states and 407 transitions. [2025-03-17 14:31:38,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 2460 transitions, 69254 flow [2025-03-17 14:31:45,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 2460 transitions, 67398 flow, removed 332 selfloop flow, removed 8 redundant places. [2025-03-17 14:31:46,009 INFO L231 Difference]: Finished difference. Result has 240 places, 2227 transitions, 63173 flow [2025-03-17 14:31:46,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=52517, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1960, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=741, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=63173, PETRI_PLACES=240, PETRI_TRANSITIONS=2227} [2025-03-17 14:31:46,011 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places. [2025-03-17 14:31:46,011 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 2227 transitions, 63173 flow [2025-03-17 14:31:46,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 17.26086956521739) internal successors, (397), 23 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:31:46,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:31:46,011 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] [2025-03-17 14:31:46,017 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-17 14:31:46,212 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,SelfDestructingSolverStorable28 [2025-03-17 14:31:46,212 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:31:46,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:31:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1908898411, now seen corresponding path program 3 times [2025-03-17 14:31:46,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:31:46,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118796961] [2025-03-17 14:31:46,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:31:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:31:46,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-17 14:31:46,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 25 statements. [2025-03-17 14:31:46,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:31:46,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:46,394 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-17 14:31:46,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:31:46,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118796961] [2025-03-17 14:31:46,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118796961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:31:46,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650171159] [2025-03-17 14:31:46,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:31:46,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:31:46,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:31:46,397 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-17 14:31:46,399 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-17 14:31:46,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-17 14:31:46,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 25 statements. [2025-03-17 14:31:46,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:31:46,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:46,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 14:31:46,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:31:46,551 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 15 treesize of output 7 [2025-03-17 14:31:46,567 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-17 14:31:46,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:31:46,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:31:46,620 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 24 treesize of output 21 [2025-03-17 14:31:46,803 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-17 14:31:46,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650171159] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:31:46,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:31:46,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 14 [2025-03-17 14:31:46,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94325979] [2025-03-17 14:31:46,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:31:46,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 14:31:46,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:31:46,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 14:31:46,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:31:46,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2025-03-17 14:31:46,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 2227 transitions, 63173 flow. Second operand has 15 states, 15 states have (on average 19.533333333333335) internal successors, (293), 15 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:31:46,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:31:46,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2025-03-17 14:31:46,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:31:53,123 INFO L124 PetriNetUnfolderBase]: 13657/20520 cut-off events. [2025-03-17 14:31:53,123 INFO L125 PetriNetUnfolderBase]: For 608541/610559 co-relation queries the response was YES. [2025-03-17 14:31:53,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216299 conditions, 20520 events. 13657/20520 cut-off events. For 608541/610559 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 135510 event pairs, 487 based on Foata normal form. 586/20613 useless extension candidates. Maximal degree in co-relation 215427. Up to 11762 conditions per place. [2025-03-17 14:31:53,377 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 1046 selfloop transitions, 1001 changer transitions 13/2449 dead transitions. [2025-03-17 14:31:53,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 2449 transitions, 71808 flow [2025-03-17 14:31:53,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:31:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:31:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2025-03-17 14:31:53,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6554878048780488 [2025-03-17 14:31:53,378 INFO L175 Difference]: Start difference. First operand has 240 places, 2227 transitions, 63173 flow. Second operand 8 states and 215 transitions. [2025-03-17 14:31:53,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 2449 transitions, 71808 flow [2025-03-17 14:32:02,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 2449 transitions, 69986 flow, removed 494 selfloop flow, removed 3 redundant places. [2025-03-17 14:32:02,180 INFO L231 Difference]: Finished difference. Result has 247 places, 2319 transitions, 67090 flow [2025-03-17 14:32:02,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=61428, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=901, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=67090, PETRI_PLACES=247, PETRI_TRANSITIONS=2319} [2025-03-17 14:32:02,182 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 204 predicate places. [2025-03-17 14:32:02,182 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 2319 transitions, 67090 flow [2025-03-17 14:32:02,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 19.533333333333335) internal successors, (293), 15 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:02,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:02,182 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] [2025-03-17 14:32:02,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-17 14:32:02,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:32:02,386 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-17 14:32:02,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:02,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1399103595, now seen corresponding path program 4 times [2025-03-17 14:32:02,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:02,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159290958] [2025-03-17 14:32:02,386 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:32:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:02,391 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-17 14:32:02,399 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:32:02,399 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:32:02,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:02,693 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-17 14:32:02,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:02,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159290958] [2025-03-17 14:32:02,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159290958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:32:02,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272804203] [2025-03-17 14:32:02,694 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:32:02,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:32:02,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:32:02,696 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-17 14:32:02,697 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-17 14:32:02,742 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-17 14:32:02,760 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:32:02,760 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:32:02,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:02,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 14:32:02,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:32:02,792 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-17 14:32:03,004 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 15 treesize of output 7 [2025-03-17 14:32:03,011 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-17 14:32:03,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:32:03,208 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-17 14:32:03,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272804203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:32:03,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:32:03,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 25 [2025-03-17 14:32:03,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070214903] [2025-03-17 14:32:03,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:32:03,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 14:32:03,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:03,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 14:32:03,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2025-03-17 14:32:03,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-17 14:32:03,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 2319 transitions, 67090 flow. Second operand has 26 states, 26 states have (on average 17.53846153846154) internal successors, (456), 26 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:03,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:03,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-17 14:32:03,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand