./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/unroll-cond-2.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 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:30:35,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:30:35,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:30:35,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:30:35,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:30:35,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:30:35,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:30:35,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:30:35,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:30:35,132 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:30:35,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:30:35,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:30:35,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:30:35,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:30:35,134 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:30:35,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:30:35,134 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:30:35,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:30:35,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:30:35,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:30:35,134 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:30:35,134 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:30:35,134 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:30:35,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:30:35,135 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:30:35,135 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:30:35,135 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:30:35,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:30:35,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:30:35,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:30:35,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:30:35,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:30:35,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:30:35,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:30:35,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:30:35,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:30:35,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:30:35,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:30:35,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:30:35,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:30:35,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:30:35,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:30:35,136 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 -> 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b [2025-03-09 01:30:35,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:30:35,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:30:35,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:30:35,359 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:30:35,360 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:30:35,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2025-03-09 01:30:36,437 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/433697e61/436e0c1a56dc4178972a03d80a2512fc/FLAGb7b56cc61 [2025-03-09 01:30:36,642 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:30:36,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2025-03-09 01:30:36,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/433697e61/436e0c1a56dc4178972a03d80a2512fc/FLAGb7b56cc61 [2025-03-09 01:30:37,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/433697e61/436e0c1a56dc4178972a03d80a2512fc [2025-03-09 01:30:37,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:30:37,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:30:37,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:30:37,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:30:37,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:30:37,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:30:37" (1/1) ... [2025-03-09 01:30:37,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378fba94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37, skipping insertion in model container [2025-03-09 01:30:37,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:30:37" (1/1) ... [2025-03-09 01:30:37,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:30:37,121 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:30:37,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:30:37,129 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:30:37,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:30:37,152 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:30:37,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37 WrapperNode [2025-03-09 01:30:37,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:30:37,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:30:37,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:30:37,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:30:37,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37" (1/1) ... [2025-03-09 01:30:37,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37" (1/1) ... [2025-03-09 01:30:37,182 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2025-03-09 01:30:37,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:30:37,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:30:37,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:30:37,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:30:37,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37" (1/1) ... [2025-03-09 01:30:37,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37" (1/1) ... [2025-03-09 01:30:37,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37" (1/1) ... [2025-03-09 01:30:37,215 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-09 01:30:37,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37" (1/1) ... [2025-03-09 01:30:37,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37" (1/1) ... [2025-03-09 01:30:37,223 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37" (1/1) ... [2025-03-09 01:30:37,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37" (1/1) ... [2025-03-09 01:30:37,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37" (1/1) ... [2025-03-09 01:30:37,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37" (1/1) ... [2025-03-09 01:30:37,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:30:37,230 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:30:37,230 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:30:37,230 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:30:37,234 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37" (1/1) ... [2025-03-09 01:30:37,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:30:37,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:37,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:30:37,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:30:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:30:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:30:37,281 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:30:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:30:37,281 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:30:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:30:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:30:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:30:37,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:30:37,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:30:37,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:30:37,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:30:37,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:30:37,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:30:37,283 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:30:37,358 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:30:37,359 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:30:37,607 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:30:37,608 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:30:37,759 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:30:37,760 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:30:37,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:37 BoogieIcfgContainer [2025-03-09 01:30:37,761 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:30:37,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:30:37,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:30:37,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:30:37,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:30:37" (1/3) ... [2025-03-09 01:30:37,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41080312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:30:37, skipping insertion in model container [2025-03-09 01:30:37,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:37" (2/3) ... [2025-03-09 01:30:37,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41080312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:30:37, skipping insertion in model container [2025-03-09 01:30:37,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:37" (3/3) ... [2025-03-09 01:30:37,769 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2025-03-09 01:30:37,780 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:30:37,781 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-2.wvr.c that has 3 procedures, 37 locations, 1 initial locations, 3 loop locations, and 12 error locations. [2025-03-09 01:30:37,782 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:30:37,820 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:30:37,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 40 transitions, 94 flow [2025-03-09 01:30:37,865 INFO L124 PetriNetUnfolderBase]: 4/38 cut-off events. [2025-03-09 01:30:37,868 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:30:37,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 38 events. 4/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-03-09 01:30:37,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 40 transitions, 94 flow [2025-03-09 01:30:37,874 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 86 flow [2025-03-09 01:30:37,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:30:37,889 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;@235b531c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:30:37,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-09 01:30:37,892 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:30:37,892 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:30:37,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:30:37,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:37,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:30:37,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:37,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:37,897 INFO L85 PathProgramCache]: Analyzing trace with hash 369435, now seen corresponding path program 1 times [2025-03-09 01:30:37,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:37,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401069010] [2025-03-09 01:30:37,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:37,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:37,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:30:37,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:30:37,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:37,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:38,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:38,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401069010] [2025-03-09 01:30:38,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401069010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:38,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:38,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:30:38,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007141662] [2025-03-09 01:30:38,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:38,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:30:38,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:38,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:30:38,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:30:38,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-09 01:30:38,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 86 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-09 01:30:38,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:38,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-09 01:30:38,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:38,236 INFO L124 PetriNetUnfolderBase]: 97/237 cut-off events. [2025-03-09 01:30:38,236 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-09 01:30:38,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 237 events. 97/237 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1095 event pairs, 64 based on Foata normal form. 1/195 useless extension candidates. Maximal degree in co-relation 366. Up to 163 conditions per place. [2025-03-09 01:30:38,240 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 20 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2025-03-09 01:30:38,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 124 flow [2025-03-09 01:30:38,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-09 01:30:38,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-03-09 01:30:38,250 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 86 flow. Second operand 3 states and 69 transitions. [2025-03-09 01:30:38,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 124 flow [2025-03-09 01:30:38,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:38,255 INFO L231 Difference]: Finished difference. Result has 35 places, 34 transitions, 76 flow [2025-03-09 01:30:38,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, 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=76, PETRI_PLACES=35, PETRI_TRANSITIONS=34} [2025-03-09 01:30:38,260 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2025-03-09 01:30:38,260 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 34 transitions, 76 flow [2025-03-09 01:30:38,261 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-09 01:30:38,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:38,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:30:38,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:30:38,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:38,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:38,263 INFO L85 PathProgramCache]: Analyzing trace with hash 369436, now seen corresponding path program 1 times [2025-03-09 01:30:38,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:38,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971545531] [2025-03-09 01:30:38,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:38,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:38,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:30:38,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:30:38,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:38,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:38,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:38,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971545531] [2025-03-09 01:30:38,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971545531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:38,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:38,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:38,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972293465] [2025-03-09 01:30:38,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:38,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:38,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:38,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:38,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-09 01:30:38,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 76 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-09 01:30:38,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:38,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-09 01:30:38,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:38,592 INFO L124 PetriNetUnfolderBase]: 97/239 cut-off events. [2025-03-09 01:30:38,592 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-09 01:30:38,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 239 events. 97/239 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1098 event pairs, 64 based on Foata normal form. 1/197 useless extension candidates. Maximal degree in co-relation 398. Up to 167 conditions per place. [2025-03-09 01:30:38,593 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 23 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2025-03-09 01:30:38,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 130 flow [2025-03-09 01:30:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:38,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-09 01:30:38,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-09 01:30:38,598 INFO L175 Difference]: Start difference. First operand has 35 places, 34 transitions, 76 flow. Second operand 3 states and 72 transitions. [2025-03-09 01:30:38,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 130 flow [2025-03-09 01:30:38,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:38,600 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 86 flow [2025-03-09 01:30:38,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2025-03-09 01:30:38,600 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-03-09 01:30:38,601 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 86 flow [2025-03-09 01:30:38,601 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-09 01:30:38,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:38,601 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:30:38,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:30:38,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:38,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:38,601 INFO L85 PathProgramCache]: Analyzing trace with hash 355039940, now seen corresponding path program 1 times [2025-03-09 01:30:38,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:38,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993829624] [2025-03-09 01:30:38,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:38,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:38,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:30:38,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:30:38,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:38,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:38,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:38,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993829624] [2025-03-09 01:30:38,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993829624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:38,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780734381] [2025-03-09 01:30:38,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:38,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:38,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:38,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:38,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:30:38,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:30:38,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:30:38,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:38,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:38,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:30:38,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:38,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-09 01:30:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:39,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:39,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780734381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:39,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:39,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:39,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924504371] [2025-03-09 01:30:39,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:39,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:39,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:39,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:39,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:39,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-09 01:30:39,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 86 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-09 01:30:39,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:39,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-09 01:30:39,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:39,538 INFO L124 PetriNetUnfolderBase]: 98/241 cut-off events. [2025-03-09 01:30:39,538 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-09 01:30:39,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 241 events. 98/241 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1102 event pairs, 64 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 414. Up to 164 conditions per place. [2025-03-09 01:30:39,540 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 19 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2025-03-09 01:30:39,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 148 flow [2025-03-09 01:30:39,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:30:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:30:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2025-03-09 01:30:39,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2025-03-09 01:30:39,541 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 86 flow. Second operand 7 states and 134 transitions. [2025-03-09 01:30:39,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 148 flow [2025-03-09 01:30:39,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:39,542 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 110 flow [2025-03-09 01:30:39,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-03-09 01:30:39,543 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2025-03-09 01:30:39,543 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 110 flow [2025-03-09 01:30:39,543 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-09 01:30:39,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:39,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:39,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:30:39,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:39,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:39,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1506934140, now seen corresponding path program 1 times [2025-03-09 01:30:39,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:39,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783235494] [2025-03-09 01:30:39,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:39,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:39,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:30:39,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:30:39,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:39,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:39,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:39,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783235494] [2025-03-09 01:30:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783235494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:39,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:39,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:30:39,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47357114] [2025-03-09 01:30:39,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:39,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:39,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:39,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:39,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:39,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2025-03-09 01:30:39,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:39,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:39,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2025-03-09 01:30:39,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:39,857 INFO L124 PetriNetUnfolderBase]: 98/214 cut-off events. [2025-03-09 01:30:39,857 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-09 01:30:39,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 214 events. 98/214 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 826 event pairs, 64 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 371. Up to 163 conditions per place. [2025-03-09 01:30:39,858 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 24 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2025-03-09 01:30:39,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 156 flow [2025-03-09 01:30:39,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-03-09 01:30:39,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-03-09 01:30:39,860 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 110 flow. Second operand 4 states and 70 transitions. [2025-03-09 01:30:39,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 156 flow [2025-03-09 01:30:39,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 141 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:39,861 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 93 flow [2025-03-09 01:30:39,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-03-09 01:30:39,863 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-03-09 01:30:39,863 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 93 flow [2025-03-09 01:30:39,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:39,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:39,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:39,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:30:39,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:39,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:39,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1506934139, now seen corresponding path program 1 times [2025-03-09 01:30:39,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:39,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836069468] [2025-03-09 01:30:39,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:39,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:39,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:30:39,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:30:39,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:39,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:40,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836069468] [2025-03-09 01:30:40,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836069468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243840651] [2025-03-09 01:30:40,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:40,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:40,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:40,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:40,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:30:40,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:30:40,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:30:40,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:40,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:40,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:40,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:40,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:40,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:40,189 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 29 treesize of output 25 [2025-03-09 01:30:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:40,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243840651] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:40,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:40,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:40,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930753518] [2025-03-09 01:30:40,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:40,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:40,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:40,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:40,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:40,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-09 01:30:40,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 93 flow. Second operand has 11 states, 11 states have (on average 17.181818181818183) internal successors, (189), 11 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:40,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:40,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-09 01:30:40,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:40,433 INFO L124 PetriNetUnfolderBase]: 206/393 cut-off events. [2025-03-09 01:30:40,433 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:30:40,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 393 events. 206/393 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1700 event pairs, 71 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 735. Up to 196 conditions per place. [2025-03-09 01:30:40,435 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 39 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-03-09 01:30:40,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 216 flow [2025-03-09 01:30:40,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-03-09 01:30:40,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.585 [2025-03-09 01:30:40,438 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 93 flow. Second operand 5 states and 117 transitions. [2025-03-09 01:30:40,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 216 flow [2025-03-09 01:30:40,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:40,439 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 108 flow [2025-03-09 01:30:40,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2025-03-09 01:30:40,439 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2025-03-09 01:30:40,439 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 108 flow [2025-03-09 01:30:40,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.181818181818183) internal successors, (189), 11 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:40,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:40,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:40,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:40,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:40,641 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:40,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:40,641 INFO L85 PathProgramCache]: Analyzing trace with hash -784053988, now seen corresponding path program 1 times [2025-03-09 01:30:40,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:40,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304936755] [2025-03-09 01:30:40,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:40,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:40,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:40,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:40,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:40,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:40,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:40,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304936755] [2025-03-09 01:30:40,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304936755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:40,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568819905] [2025-03-09 01:30:40,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:40,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:40,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:40,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:40,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:30:40,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:40,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:40,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:40,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:40,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:40,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:40,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:40,936 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 29 treesize of output 25 [2025-03-09 01:30:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:40,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568819905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:40,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:40,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:40,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671674661] [2025-03-09 01:30:40,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:40,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:40,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:40,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:40,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:41,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-03-09 01:30:41,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 108 flow. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:41,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:41,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-03-09 01:30:41,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:41,194 INFO L124 PetriNetUnfolderBase]: 371/670 cut-off events. [2025-03-09 01:30:41,194 INFO L125 PetriNetUnfolderBase]: For 71/89 co-relation queries the response was YES. [2025-03-09 01:30:41,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 670 events. 371/670 cut-off events. For 71/89 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2981 event pairs, 102 based on Foata normal form. 0/553 useless extension candidates. Maximal degree in co-relation 1368. Up to 388 conditions per place. [2025-03-09 01:30:41,197 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 39 selfloop transitions, 6 changer transitions 0/49 dead transitions. [2025-03-09 01:30:41,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 233 flow [2025-03-09 01:30:41,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-09 01:30:41,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.535 [2025-03-09 01:30:41,200 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 108 flow. Second operand 5 states and 107 transitions. [2025-03-09 01:30:41,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 233 flow [2025-03-09 01:30:41,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 225 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:41,201 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 129 flow [2025-03-09 01:30:41,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-03-09 01:30:41,202 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2025-03-09 01:30:41,202 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 129 flow [2025-03-09 01:30:41,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:41,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:41,202 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:41,209 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-09 01:30:41,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:41,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:41,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:41,403 INFO L85 PathProgramCache]: Analyzing trace with hash -759715896, now seen corresponding path program 1 times [2025-03-09 01:30:41,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:41,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534086573] [2025-03-09 01:30:41,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:41,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:41,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:41,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:41,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:41,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:41,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:41,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534086573] [2025-03-09 01:30:41,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534086573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:41,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369401743] [2025-03-09 01:30:41,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:41,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:41,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:41,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:41,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:30:41,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:41,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:41,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:41,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:41,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:30:41,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:41,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:41,739 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 36 treesize of output 32 [2025-03-09 01:30:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:41,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369401743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:41,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:41,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-09 01:30:41,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802645532] [2025-03-09 01:30:41,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:41,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:30:41,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:41,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:30:41,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:30:42,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-09 01:30:42,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 129 flow. Second operand has 17 states, 17 states have (on average 16.764705882352942) internal successors, (285), 17 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:42,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:42,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-09 01:30:42,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:42,349 INFO L124 PetriNetUnfolderBase]: 640/1238 cut-off events. [2025-03-09 01:30:42,350 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-03-09 01:30:42,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 1238 events. 640/1238 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6838 event pairs, 332 based on Foata normal form. 0/1112 useless extension candidates. Maximal degree in co-relation 1417. Up to 547 conditions per place. [2025-03-09 01:30:42,355 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 73 selfloop transitions, 12 changer transitions 0/91 dead transitions. [2025-03-09 01:30:42,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 91 transitions, 449 flow [2025-03-09 01:30:42,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:30:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:30:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2025-03-09 01:30:42,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61875 [2025-03-09 01:30:42,357 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 129 flow. Second operand 8 states and 198 transitions. [2025-03-09 01:30:42,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 91 transitions, 449 flow [2025-03-09 01:30:42,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 91 transitions, 435 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:42,359 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 192 flow [2025-03-09 01:30:42,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=192, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2025-03-09 01:30:42,360 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2025-03-09 01:30:42,361 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 192 flow [2025-03-09 01:30:42,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.764705882352942) internal successors, (285), 17 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:42,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:42,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:42,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:42,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:42,562 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:42,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:42,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1464130570, now seen corresponding path program 1 times [2025-03-09 01:30:42,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:42,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885592882] [2025-03-09 01:30:42,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:42,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:42,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:30:42,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:30:42,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:42,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:42,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:42,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885592882] [2025-03-09 01:30:42,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885592882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:42,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871313367] [2025-03-09 01:30:42,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:42,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:42,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:42,667 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:42,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:30:42,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:30:42,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:30:42,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:42,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:42,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:30:42,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:42,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:42,813 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 29 treesize of output 25 [2025-03-09 01:30:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:42,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871313367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:42,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:42,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-09 01:30:42,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541019747] [2025-03-09 01:30:42,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:42,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:30:42,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:42,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:30:42,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:30:43,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-03-09 01:30:43,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 192 flow. Second operand has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 14 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:43,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:43,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-03-09 01:30:43,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:43,260 INFO L124 PetriNetUnfolderBase]: 762/1360 cut-off events. [2025-03-09 01:30:43,260 INFO L125 PetriNetUnfolderBase]: For 784/820 co-relation queries the response was YES. [2025-03-09 01:30:43,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3411 conditions, 1360 events. 762/1360 cut-off events. For 784/820 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6997 event pairs, 349 based on Foata normal form. 0/1256 useless extension candidates. Maximal degree in co-relation 2177. Up to 990 conditions per place. [2025-03-09 01:30:43,276 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 61 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2025-03-09 01:30:43,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 437 flow [2025-03-09 01:30:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:30:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:30:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2025-03-09 01:30:43,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-03-09 01:30:43,277 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 192 flow. Second operand 7 states and 156 transitions. [2025-03-09 01:30:43,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 437 flow [2025-03-09 01:30:43,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 430 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:43,280 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 225 flow [2025-03-09 01:30:43,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=225, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2025-03-09 01:30:43,281 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-03-09 01:30:43,281 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 225 flow [2025-03-09 01:30:43,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 14 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:43,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:43,281 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:43,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:43,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:43,486 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:43,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:43,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2002164960, now seen corresponding path program 2 times [2025-03-09 01:30:43,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:43,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789218483] [2025-03-09 01:30:43,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:43,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:43,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:30:43,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-09 01:30:43,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:43,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:43,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:43,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789218483] [2025-03-09 01:30:43,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789218483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:43,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930264828] [2025-03-09 01:30:43,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:43,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:43,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:43,583 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:43,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:30:43,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:30:43,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-09 01:30:43,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:43,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:43,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:30:43,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:43,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:30:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:43,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:43,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930264828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:43,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:43,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:43,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754472811] [2025-03-09 01:30:43,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:43,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:43,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:43,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:43,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:43,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-09 01:30:43,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 225 flow. Second operand has 11 states, 11 states have (on average 17.727272727272727) internal successors, (195), 11 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:43,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:43,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-09 01:30:43,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:44,172 INFO L124 PetriNetUnfolderBase]: 616/1180 cut-off events. [2025-03-09 01:30:44,173 INFO L125 PetriNetUnfolderBase]: For 653/653 co-relation queries the response was YES. [2025-03-09 01:30:44,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3024 conditions, 1180 events. 616/1180 cut-off events. For 653/653 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6524 event pairs, 325 based on Foata normal form. 0/1176 useless extension candidates. Maximal degree in co-relation 2003. Up to 751 conditions per place. [2025-03-09 01:30:44,178 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 44 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2025-03-09 01:30:44,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 403 flow [2025-03-09 01:30:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-09 01:30:44,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.54 [2025-03-09 01:30:44,180 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 225 flow. Second operand 5 states and 108 transitions. [2025-03-09 01:30:44,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 403 flow [2025-03-09 01:30:44,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 380 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:30:44,182 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 221 flow [2025-03-09 01:30:44,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-03-09 01:30:44,184 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2025-03-09 01:30:44,185 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 221 flow [2025-03-09 01:30:44,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.727272727272727) internal successors, (195), 11 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:44,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:44,185 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:44,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:30:44,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:44,386 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:44,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:44,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1719782193, now seen corresponding path program 1 times [2025-03-09 01:30:44,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:44,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371756192] [2025-03-09 01:30:44,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:44,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:44,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:30:44,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:30:44,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:44,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:44,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:44,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371756192] [2025-03-09 01:30:44,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371756192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:44,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849420102] [2025-03-09 01:30:44,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:44,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:44,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:44,506 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:44,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:30:44,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:30:44,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:30:44,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:44,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:44,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:30:44,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:44,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:44,706 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 36 treesize of output 32 [2025-03-09 01:30:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:44,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849420102] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:44,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:44,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-09 01:30:44,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799660735] [2025-03-09 01:30:44,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:44,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:30:44,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:44,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:30:44,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:30:45,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-03-09 01:30:45,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 221 flow. Second operand has 17 states, 17 states have (on average 15.294117647058824) internal successors, (260), 17 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:45,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:45,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-03-09 01:30:45,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:45,334 INFO L124 PetriNetUnfolderBase]: 693/1233 cut-off events. [2025-03-09 01:30:45,334 INFO L125 PetriNetUnfolderBase]: For 1288/1288 co-relation queries the response was YES. [2025-03-09 01:30:45,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3395 conditions, 1233 events. 693/1233 cut-off events. For 1288/1288 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6128 event pairs, 364 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 2296. Up to 603 conditions per place. [2025-03-09 01:30:45,340 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 70 selfloop transitions, 15 changer transitions 0/88 dead transitions. [2025-03-09 01:30:45,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 532 flow [2025-03-09 01:30:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:30:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:30:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2025-03-09 01:30:45,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56875 [2025-03-09 01:30:45,342 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 221 flow. Second operand 8 states and 182 transitions. [2025-03-09 01:30:45,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 532 flow [2025-03-09 01:30:45,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 88 transitions, 500 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:45,346 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 272 flow [2025-03-09 01:30:45,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=272, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-03-09 01:30:45,347 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2025-03-09 01:30:45,347 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 272 flow [2025-03-09 01:30:45,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.294117647058824) internal successors, (260), 17 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:45,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:45,347 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:45,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:45,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:45,548 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:45,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:45,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1602915250, now seen corresponding path program 2 times [2025-03-09 01:30:45,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:45,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215082284] [2025-03-09 01:30:45,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:45,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:30:45,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-09 01:30:45,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:45,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:30:45,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:45,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215082284] [2025-03-09 01:30:45,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215082284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:45,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:45,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:30:45,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053995179] [2025-03-09 01:30:45,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:45,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:45,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:45,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:45,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:45,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-03-09 01:30:45,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:45,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:45,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-03-09 01:30:45,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:45,829 INFO L124 PetriNetUnfolderBase]: 669/1192 cut-off events. [2025-03-09 01:30:45,830 INFO L125 PetriNetUnfolderBase]: For 1310/1310 co-relation queries the response was YES. [2025-03-09 01:30:45,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3432 conditions, 1192 events. 669/1192 cut-off events. For 1310/1310 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5918 event pairs, 446 based on Foata normal form. 0/1160 useless extension candidates. Maximal degree in co-relation 2315. Up to 950 conditions per place. [2025-03-09 01:30:45,834 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 45 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2025-03-09 01:30:45,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 421 flow [2025-03-09 01:30:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-03-09 01:30:45,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-09 01:30:45,835 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 272 flow. Second operand 5 states and 96 transitions. [2025-03-09 01:30:45,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 421 flow [2025-03-09 01:30:45,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 406 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:30:45,838 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 269 flow [2025-03-09 01:30:45,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2025-03-09 01:30:45,838 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2025-03-09 01:30:45,838 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 269 flow [2025-03-09 01:30:45,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:45,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:45,838 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:45,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:30:45,839 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:45,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:45,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1491690889, now seen corresponding path program 2 times [2025-03-09 01:30:45,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:45,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461203256] [2025-03-09 01:30:45,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:45,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:45,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 01:30:45,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 15 statements. [2025-03-09 01:30:45,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:45,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:45,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:45,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461203256] [2025-03-09 01:30:45,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461203256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:45,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269665195] [2025-03-09 01:30:45,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:45,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:45,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:45,951 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:45,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:30:45,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 01:30:45,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 15 statements. [2025-03-09 01:30:45,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:46,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:46,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:30:46,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:46,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:30:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:46,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:46,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269665195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:46,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:46,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:46,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248074744] [2025-03-09 01:30:46,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:46,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:46,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:46,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:46,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:46,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2025-03-09 01:30:46,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 269 flow. Second operand has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:46,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:46,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2025-03-09 01:30:46,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:46,527 INFO L124 PetriNetUnfolderBase]: 612/1092 cut-off events. [2025-03-09 01:30:46,527 INFO L125 PetriNetUnfolderBase]: For 1194/1194 co-relation queries the response was YES. [2025-03-09 01:30:46,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3275 conditions, 1092 events. 612/1092 cut-off events. For 1194/1194 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5414 event pairs, 240 based on Foata normal form. 16/1092 useless extension candidates. Maximal degree in co-relation 2134. Up to 560 conditions per place. [2025-03-09 01:30:46,532 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 38 selfloop transitions, 15 changer transitions 0/56 dead transitions. [2025-03-09 01:30:46,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 422 flow [2025-03-09 01:30:46,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:46,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-03-09 01:30:46,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-03-09 01:30:46,534 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 269 flow. Second operand 5 states and 95 transitions. [2025-03-09 01:30:46,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 422 flow [2025-03-09 01:30:46,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 404 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:46,537 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 269 flow [2025-03-09 01:30:46,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-03-09 01:30:46,539 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-03-09 01:30:46,539 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 269 flow [2025-03-09 01:30:46,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.545454545454547) internal successors, (182), 11 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:46,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:46,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:46,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:30:46,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 01:30:46,740 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:46,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:46,741 INFO L85 PathProgramCache]: Analyzing trace with hash -685772036, now seen corresponding path program 1 times [2025-03-09 01:30:46,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:46,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527537286] [2025-03-09 01:30:46,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:46,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:46,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:30:46,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:30:46,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:46,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:46,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:46,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527537286] [2025-03-09 01:30:46,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527537286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:46,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:46,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:46,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919149173] [2025-03-09 01:30:46,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:46,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:30:46,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:46,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:30:46,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:30:46,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-03-09 01:30:46,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:46,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:46,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-03-09 01:30:46,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:46,851 INFO L124 PetriNetUnfolderBase]: 624/1112 cut-off events. [2025-03-09 01:30:46,851 INFO L125 PetriNetUnfolderBase]: For 1485/1485 co-relation queries the response was YES. [2025-03-09 01:30:46,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3421 conditions, 1112 events. 624/1112 cut-off events. For 1485/1485 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5434 event pairs, 171 based on Foata normal form. 2/1108 useless extension candidates. Maximal degree in co-relation 2248. Up to 788 conditions per place. [2025-03-09 01:30:46,855 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 49 selfloop transitions, 7 changer transitions 1/60 dead transitions. [2025-03-09 01:30:46,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 442 flow [2025-03-09 01:30:46,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-09 01:30:46,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2025-03-09 01:30:46,857 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 269 flow. Second operand 3 states and 86 transitions. [2025-03-09 01:30:46,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 442 flow [2025-03-09 01:30:46,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 406 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:46,860 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 288 flow [2025-03-09 01:30:46,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2025-03-09 01:30:46,860 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2025-03-09 01:30:46,860 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 288 flow [2025-03-09 01:30:46,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:46,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:46,860 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-09 01:30:46,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:30:46,862 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:46,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:46,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1438343004, now seen corresponding path program 1 times [2025-03-09 01:30:46,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:46,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033920113] [2025-03-09 01:30:46,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:46,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:46,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:30:46,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:46,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:46,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:46,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:46,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033920113] [2025-03-09 01:30:46,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033920113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:46,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:46,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:30:46,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919470261] [2025-03-09 01:30:46,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:46,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:46,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:46,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:46,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:46,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-09 01:30:46,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:46,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:46,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-09 01:30:46,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:47,066 INFO L124 PetriNetUnfolderBase]: 698/1206 cut-off events. [2025-03-09 01:30:47,066 INFO L125 PetriNetUnfolderBase]: For 1555/1555 co-relation queries the response was YES. [2025-03-09 01:30:47,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3695 conditions, 1206 events. 698/1206 cut-off events. For 1555/1555 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6126 event pairs, 263 based on Foata normal form. 18/1218 useless extension candidates. Maximal degree in co-relation 2439. Up to 664 conditions per place. [2025-03-09 01:30:47,071 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 85 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2025-03-09 01:30:47,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 96 transitions, 757 flow [2025-03-09 01:30:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:47,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-09 01:30:47,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.655 [2025-03-09 01:30:47,072 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 288 flow. Second operand 5 states and 131 transitions. [2025-03-09 01:30:47,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 96 transitions, 757 flow [2025-03-09 01:30:47,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 96 transitions, 734 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:47,075 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 350 flow [2025-03-09 01:30:47,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=350, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-03-09 01:30:47,076 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2025-03-09 01:30:47,076 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 350 flow [2025-03-09 01:30:47,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:47,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:47,076 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-09 01:30:47,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:30:47,076 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:47,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1533619170, now seen corresponding path program 2 times [2025-03-09 01:30:47,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:47,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542399137] [2025-03-09 01:30:47,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:47,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:47,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:47,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 19 statements. [2025-03-09 01:30:47,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:47,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:47,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:47,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542399137] [2025-03-09 01:30:47,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542399137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:47,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:47,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:30:47,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044491248] [2025-03-09 01:30:47,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:47,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:30:47,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:47,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:30:47,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:30:47,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:30:47,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 350 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:47,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:47,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:30:47,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:47,345 INFO L124 PetriNetUnfolderBase]: 744/1278 cut-off events. [2025-03-09 01:30:47,345 INFO L125 PetriNetUnfolderBase]: For 2686/2686 co-relation queries the response was YES. [2025-03-09 01:30:47,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4491 conditions, 1278 events. 744/1278 cut-off events. For 2686/2686 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6164 event pairs, 150 based on Foata normal form. 60/1338 useless extension candidates. Maximal degree in co-relation 2711. Up to 594 conditions per place. [2025-03-09 01:30:47,351 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 90 selfloop transitions, 28 changer transitions 0/119 dead transitions. [2025-03-09 01:30:47,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 119 transitions, 985 flow [2025-03-09 01:30:47,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:30:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:30:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2025-03-09 01:30:47,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.596875 [2025-03-09 01:30:47,352 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 350 flow. Second operand 8 states and 191 transitions. [2025-03-09 01:30:47,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 119 transitions, 985 flow [2025-03-09 01:30:47,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 119 transitions, 951 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:47,359 INFO L231 Difference]: Finished difference. Result has 68 places, 69 transitions, 611 flow [2025-03-09 01:30:47,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=611, PETRI_PLACES=68, PETRI_TRANSITIONS=69} [2025-03-09 01:30:47,359 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2025-03-09 01:30:47,359 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 611 flow [2025-03-09 01:30:47,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:47,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:47,360 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-09 01:30:47,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:30:47,360 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:47,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1198952388, now seen corresponding path program 3 times [2025-03-09 01:30:47,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:47,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766651741] [2025-03-09 01:30:47,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:47,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:47,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:47,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 19 statements. [2025-03-09 01:30:47,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:30:47,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:47,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:47,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766651741] [2025-03-09 01:30:47,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766651741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:47,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:47,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:30:47,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950835850] [2025-03-09 01:30:47,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:47,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:47,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:47,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:47,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:47,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:30:47,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 611 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:47,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:47,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:30:47,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:47,604 INFO L124 PetriNetUnfolderBase]: 836/1428 cut-off events. [2025-03-09 01:30:47,604 INFO L125 PetriNetUnfolderBase]: For 5934/5934 co-relation queries the response was YES. [2025-03-09 01:30:47,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6268 conditions, 1428 events. 836/1428 cut-off events. For 5934/5934 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7196 event pairs, 254 based on Foata normal form. 8/1436 useless extension candidates. Maximal degree in co-relation 4062. Up to 686 conditions per place. [2025-03-09 01:30:47,612 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 91 selfloop transitions, 31 changer transitions 1/124 dead transitions. [2025-03-09 01:30:47,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 124 transitions, 1342 flow [2025-03-09 01:30:47,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-09 01:30:47,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-09 01:30:47,614 INFO L175 Difference]: Start difference. First operand has 68 places, 69 transitions, 611 flow. Second operand 5 states and 130 transitions. [2025-03-09 01:30:47,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 124 transitions, 1342 flow [2025-03-09 01:30:47,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 124 transitions, 1287 flow, removed 14 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:47,623 INFO L231 Difference]: Finished difference. Result has 74 places, 86 transitions, 923 flow [2025-03-09 01:30:47,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=923, PETRI_PLACES=74, PETRI_TRANSITIONS=86} [2025-03-09 01:30:47,624 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2025-03-09 01:30:47,624 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 86 transitions, 923 flow [2025-03-09 01:30:47,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:47,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:47,624 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-09 01:30:47,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:30:47,625 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:47,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:47,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1761964446, now seen corresponding path program 4 times [2025-03-09 01:30:47,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:47,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136450910] [2025-03-09 01:30:47,625 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:47,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:47,630 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:47,637 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:47,637 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:47,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:47,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:47,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136450910] [2025-03-09 01:30:47,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136450910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:47,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:47,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:30:47,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292700442] [2025-03-09 01:30:47,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:47,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:30:47,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:47,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:30:47,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:30:47,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-09 01:30:47,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 86 transitions, 923 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:47,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:47,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-09 01:30:47,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:47,980 INFO L124 PetriNetUnfolderBase]: 842/1468 cut-off events. [2025-03-09 01:30:47,980 INFO L125 PetriNetUnfolderBase]: For 7912/7912 co-relation queries the response was YES. [2025-03-09 01:30:47,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6920 conditions, 1468 events. 842/1468 cut-off events. For 7912/7912 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7456 event pairs, 332 based on Foata normal form. 16/1484 useless extension candidates. Maximal degree in co-relation 4546. Up to 905 conditions per place. [2025-03-09 01:30:47,990 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 76 selfloop transitions, 48 changer transitions 1/127 dead transitions. [2025-03-09 01:30:47,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 127 transitions, 1535 flow [2025-03-09 01:30:47,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:30:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:30:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-03-09 01:30:47,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6208333333333333 [2025-03-09 01:30:47,991 INFO L175 Difference]: Start difference. First operand has 74 places, 86 transitions, 923 flow. Second operand 6 states and 149 transitions. [2025-03-09 01:30:47,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 127 transitions, 1535 flow [2025-03-09 01:30:48,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 127 transitions, 1507 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:48,007 INFO L231 Difference]: Finished difference. Result has 82 places, 104 transitions, 1318 flow [2025-03-09 01:30:48,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1318, PETRI_PLACES=82, PETRI_TRANSITIONS=104} [2025-03-09 01:30:48,008 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 42 predicate places. [2025-03-09 01:30:48,008 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 104 transitions, 1318 flow [2025-03-09 01:30:48,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:48,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:48,008 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-09 01:30:48,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:30:48,008 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:48,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:48,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2066767740, now seen corresponding path program 5 times [2025-03-09 01:30:48,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:48,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824945011] [2025-03-09 01:30:48,009 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:48,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:48,015 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:30:48,020 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:30:48,021 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:48,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:48,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:48,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824945011] [2025-03-09 01:30:48,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824945011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:48,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:48,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:30:48,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704456212] [2025-03-09 01:30:48,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:48,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:30:48,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:48,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:30:48,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:30:48,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:30:48,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 104 transitions, 1318 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:48,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:48,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:30:48,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:48,294 INFO L124 PetriNetUnfolderBase]: 850/1452 cut-off events. [2025-03-09 01:30:48,295 INFO L125 PetriNetUnfolderBase]: For 9874/9874 co-relation queries the response was YES. [2025-03-09 01:30:48,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7484 conditions, 1452 events. 850/1452 cut-off events. For 9874/9874 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7334 event pairs, 226 based on Foata normal form. 12/1464 useless extension candidates. Maximal degree in co-relation 4963. Up to 706 conditions per place. [2025-03-09 01:30:48,303 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 106 selfloop transitions, 45 changer transitions 1/153 dead transitions. [2025-03-09 01:30:48,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 153 transitions, 1922 flow [2025-03-09 01:30:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:30:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:30:48,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2025-03-09 01:30:48,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-09 01:30:48,304 INFO L175 Difference]: Start difference. First operand has 82 places, 104 transitions, 1318 flow. Second operand 6 states and 156 transitions. [2025-03-09 01:30:48,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 153 transitions, 1922 flow [2025-03-09 01:30:48,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 153 transitions, 1852 flow, removed 19 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:48,324 INFO L231 Difference]: Finished difference. Result has 88 places, 108 transitions, 1437 flow [2025-03-09 01:30:48,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1437, PETRI_PLACES=88, PETRI_TRANSITIONS=108} [2025-03-09 01:30:48,325 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 48 predicate places. [2025-03-09 01:30:48,325 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 108 transitions, 1437 flow [2025-03-09 01:30:48,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:48,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:48,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:48,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:30:48,326 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:48,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:48,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1340356797, now seen corresponding path program 1 times [2025-03-09 01:30:48,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:48,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814040905] [2025-03-09 01:30:48,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:48,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:48,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:30:48,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:48,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:48,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:48,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:48,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814040905] [2025-03-09 01:30:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814040905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:48,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087483135] [2025-03-09 01:30:48,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:48,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:48,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:48,437 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:48,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:30:48,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:30:48,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:48,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:48,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:48,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:30:48,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:48,535 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-09 01:30:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:48,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:48,564 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:30:48,565 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 19 treesize of output 7 [2025-03-09 01:30:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:48,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087483135] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:48,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:48,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 8 [2025-03-09 01:30:48,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466397278] [2025-03-09 01:30:48,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:48,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:30:48,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:48,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:30:48,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:30:48,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-03-09 01:30:48,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 108 transitions, 1437 flow. Second operand has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:48,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:48,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-03-09 01:30:48,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:48,867 INFO L124 PetriNetUnfolderBase]: 1146/2019 cut-off events. [2025-03-09 01:30:48,867 INFO L125 PetriNetUnfolderBase]: For 14581/14581 co-relation queries the response was YES. [2025-03-09 01:30:48,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10096 conditions, 2019 events. 1146/2019 cut-off events. For 14581/14581 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10836 event pairs, 165 based on Foata normal form. 2/2017 useless extension candidates. Maximal degree in co-relation 8777. Up to 1001 conditions per place. [2025-03-09 01:30:48,879 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 106 selfloop transitions, 58 changer transitions 1/173 dead transitions. [2025-03-09 01:30:48,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 173 transitions, 2227 flow [2025-03-09 01:30:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:30:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:30:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2025-03-09 01:30:48,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2025-03-09 01:30:48,881 INFO L175 Difference]: Start difference. First operand has 88 places, 108 transitions, 1437 flow. Second operand 7 states and 185 transitions. [2025-03-09 01:30:48,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 173 transitions, 2227 flow [2025-03-09 01:30:48,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 173 transitions, 2164 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:48,908 INFO L231 Difference]: Finished difference. Result has 94 places, 129 transitions, 1725 flow [2025-03-09 01:30:48,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1378, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1725, PETRI_PLACES=94, PETRI_TRANSITIONS=129} [2025-03-09 01:30:48,909 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 54 predicate places. [2025-03-09 01:30:48,909 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 129 transitions, 1725 flow [2025-03-09 01:30:48,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.666666666666668) internal successors, (195), 9 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:48,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:48,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:48,915 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-09 01:30:49,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:49,110 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:49,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1177761947, now seen corresponding path program 2 times [2025-03-09 01:30:49,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:49,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832191580] [2025-03-09 01:30:49,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:49,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:49,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:30:49,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-09 01:30:49,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:49,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:49,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:49,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832191580] [2025-03-09 01:30:49,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832191580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:49,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:49,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:30:49,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950649824] [2025-03-09 01:30:49,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:49,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:30:49,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:49,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:30:49,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:30:49,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-03-09 01:30:49,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 129 transitions, 1725 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:49,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:49,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-03-09 01:30:49,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:49,444 INFO L124 PetriNetUnfolderBase]: 1235/2210 cut-off events. [2025-03-09 01:30:49,444 INFO L125 PetriNetUnfolderBase]: For 16991/16991 co-relation queries the response was YES. [2025-03-09 01:30:49,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11367 conditions, 2210 events. 1235/2210 cut-off events. For 16991/16991 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12319 event pairs, 337 based on Foata normal form. 2/2206 useless extension candidates. Maximal degree in co-relation 9875. Up to 1456 conditions per place. [2025-03-09 01:30:49,456 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 104 selfloop transitions, 53 changer transitions 1/166 dead transitions. [2025-03-09 01:30:49,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 166 transitions, 2375 flow [2025-03-09 01:30:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:30:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:30:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2025-03-09 01:30:49,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-03-09 01:30:49,457 INFO L175 Difference]: Start difference. First operand has 94 places, 129 transitions, 1725 flow. Second operand 6 states and 148 transitions. [2025-03-09 01:30:49,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 166 transitions, 2375 flow [2025-03-09 01:30:49,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 166 transitions, 2295 flow, removed 21 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:49,490 INFO L231 Difference]: Finished difference. Result has 99 places, 139 transitions, 1945 flow [2025-03-09 01:30:49,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1945, PETRI_PLACES=99, PETRI_TRANSITIONS=139} [2025-03-09 01:30:49,491 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 59 predicate places. [2025-03-09 01:30:49,491 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 139 transitions, 1945 flow [2025-03-09 01:30:49,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:49,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:49,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:49,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:30:49,491 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:49,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:49,492 INFO L85 PathProgramCache]: Analyzing trace with hash -714338479, now seen corresponding path program 1 times [2025-03-09 01:30:49,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:49,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674501047] [2025-03-09 01:30:49,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:49,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:49,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:30:49,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:49,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:49,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:49,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:49,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674501047] [2025-03-09 01:30:49,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674501047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:49,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:49,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:30:49,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81955870] [2025-03-09 01:30:49,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:49,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:30:49,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:49,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:30:49,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:30:49,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:30:49,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 139 transitions, 1945 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:49,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:49,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:30:49,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:49,894 INFO L124 PetriNetUnfolderBase]: 1411/2418 cut-off events. [2025-03-09 01:30:49,894 INFO L125 PetriNetUnfolderBase]: For 17755/17755 co-relation queries the response was YES. [2025-03-09 01:30:49,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12547 conditions, 2418 events. 1411/2418 cut-off events. For 17755/17755 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13255 event pairs, 560 based on Foata normal form. 12/2430 useless extension candidates. Maximal degree in co-relation 11804. Up to 1577 conditions per place. [2025-03-09 01:30:49,930 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 136 selfloop transitions, 45 changer transitions 0/182 dead transitions. [2025-03-09 01:30:49,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 182 transitions, 2644 flow [2025-03-09 01:30:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:30:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:30:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2025-03-09 01:30:49,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5821428571428572 [2025-03-09 01:30:49,932 INFO L175 Difference]: Start difference. First operand has 99 places, 139 transitions, 1945 flow. Second operand 7 states and 163 transitions. [2025-03-09 01:30:49,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 182 transitions, 2644 flow [2025-03-09 01:30:49,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 182 transitions, 2573 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:49,960 INFO L231 Difference]: Finished difference. Result has 107 places, 145 transitions, 2116 flow [2025-03-09 01:30:49,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1884, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2116, PETRI_PLACES=107, PETRI_TRANSITIONS=145} [2025-03-09 01:30:49,961 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 67 predicate places. [2025-03-09 01:30:49,961 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 145 transitions, 2116 flow [2025-03-09 01:30:49,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:49,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:49,961 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:49,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:30:49,961 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:49,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash 60557363, now seen corresponding path program 2 times [2025-03-09 01:30:49,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:49,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886079173] [2025-03-09 01:30:49,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:49,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:49,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:30:49,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:49,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:49,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:50,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:50,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886079173] [2025-03-09 01:30:50,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886079173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:50,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450060311] [2025-03-09 01:30:50,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:50,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:50,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:50,147 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:50,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:30:50,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:30:50,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:30:50,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:50,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:50,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 01:30:50,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:50,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 01:30:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:50,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:50,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2025-03-09 01:30:50,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:30:50,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 116 [2025-03-09 01:30:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:50,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450060311] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:50,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:50,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2025-03-09 01:30:50,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126293189] [2025-03-09 01:30:50,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:50,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:30:50,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:50,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:30:50,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:30:51,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:30:51,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 145 transitions, 2116 flow. Second operand has 19 states, 19 states have (on average 17.157894736842106) internal successors, (326), 19 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:51,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:51,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:30:51,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:53,205 INFO L124 PetriNetUnfolderBase]: 4031/6740 cut-off events. [2025-03-09 01:30:53,206 INFO L125 PetriNetUnfolderBase]: For 39645/39645 co-relation queries the response was YES. [2025-03-09 01:30:53,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32352 conditions, 6740 events. 4031/6740 cut-off events. For 39645/39645 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 40855 event pairs, 164 based on Foata normal form. 23/6763 useless extension candidates. Maximal degree in co-relation 31683. Up to 1371 conditions per place. [2025-03-09 01:30:53,234 INFO L140 encePairwiseOnDemand]: 25/40 looper letters, 354 selfloop transitions, 217 changer transitions 196/768 dead transitions. [2025-03-09 01:30:53,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 768 transitions, 9003 flow [2025-03-09 01:30:53,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-09 01:30:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-03-09 01:30:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 1277 transitions. [2025-03-09 01:30:53,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5700892857142857 [2025-03-09 01:30:53,238 INFO L175 Difference]: Start difference. First operand has 107 places, 145 transitions, 2116 flow. Second operand 56 states and 1277 transitions. [2025-03-09 01:30:53,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 768 transitions, 9003 flow [2025-03-09 01:30:53,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 768 transitions, 8877 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:53,345 INFO L231 Difference]: Finished difference. Result has 199 places, 301 transitions, 4500 flow [2025-03-09 01:30:53,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=4500, PETRI_PLACES=199, PETRI_TRANSITIONS=301} [2025-03-09 01:30:53,346 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 159 predicate places. [2025-03-09 01:30:53,346 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 301 transitions, 4500 flow [2025-03-09 01:30:53,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 17.157894736842106) internal successors, (326), 19 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:53,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:53,346 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:53,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:53,551 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,SelfDestructingSolverStorable21 [2025-03-09 01:30:53,551 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:53,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:53,551 INFO L85 PathProgramCache]: Analyzing trace with hash 356270278, now seen corresponding path program 3 times [2025-03-09 01:30:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:53,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619234048] [2025-03-09 01:30:53,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:53,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:30:53,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:30:53,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:53,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:53,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:53,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619234048] [2025-03-09 01:30:53,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619234048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:53,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105075785] [2025-03-09 01:30:53,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:30:53,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:53,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:53,713 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:53,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:30:53,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:30:53,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:30:53,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:30:53,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:53,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 01:30:53,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:53,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 01:30:53,872 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-09 01:30:53,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:53,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:54,016 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 33 treesize of output 29 [2025-03-09 01:30:54,022 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:30:54,022 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 62 treesize of output 41 [2025-03-09 01:30:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:54,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105075785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:54,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:54,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-09 01:30:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963156395] [2025-03-09 01:30:54,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:54,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:30:54,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:54,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:30:54,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:30:54,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2025-03-09 01:30:54,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 301 transitions, 4500 flow. Second operand has 17 states, 17 states have (on average 15.058823529411764) internal successors, (256), 17 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:54,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:54,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2025-03-09 01:30:54,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:55,142 INFO L124 PetriNetUnfolderBase]: 2674/4717 cut-off events. [2025-03-09 01:30:55,142 INFO L125 PetriNetUnfolderBase]: For 89236/89295 co-relation queries the response was YES. [2025-03-09 01:30:55,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31638 conditions, 4717 events. 2674/4717 cut-off events. For 89236/89295 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 28820 event pairs, 704 based on Foata normal form. 7/4694 useless extension candidates. Maximal degree in co-relation 31415. Up to 2122 conditions per place. [2025-03-09 01:30:55,169 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 196 selfloop transitions, 70 changer transitions 114/395 dead transitions. [2025-03-09 01:30:55,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 395 transitions, 6350 flow [2025-03-09 01:30:55,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:30:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:30:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 230 transitions. [2025-03-09 01:30:55,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-03-09 01:30:55,170 INFO L175 Difference]: Start difference. First operand has 199 places, 301 transitions, 4500 flow. Second operand 11 states and 230 transitions. [2025-03-09 01:30:55,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 395 transitions, 6350 flow [2025-03-09 01:30:55,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 395 transitions, 5416 flow, removed 431 selfloop flow, removed 17 redundant places. [2025-03-09 01:30:55,327 INFO L231 Difference]: Finished difference. Result has 183 places, 233 transitions, 3071 flow [2025-03-09 01:30:55,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3727, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3071, PETRI_PLACES=183, PETRI_TRANSITIONS=233} [2025-03-09 01:30:55,328 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 143 predicate places. [2025-03-09 01:30:55,328 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 233 transitions, 3071 flow [2025-03-09 01:30:55,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.058823529411764) internal successors, (256), 17 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:55,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:55,328 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:55,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:55,528 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,SelfDestructingSolverStorable22 [2025-03-09 01:30:55,528 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:55,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:55,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2024015002, now seen corresponding path program 4 times [2025-03-09 01:30:55,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:55,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125425616] [2025-03-09 01:30:55,529 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:55,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:55,532 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:30:55,538 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:30:55,538 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:55,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:55,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:55,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125425616] [2025-03-09 01:30:55,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125425616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:55,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657377056] [2025-03-09 01:30:55,778 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:30:55,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:55,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:55,780 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:55,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:30:55,872 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:30:55,884 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:30:55,884 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:30:55,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:55,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 01:30:55,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:55,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 01:30:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:56,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:56,163 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 87 treesize of output 77 [2025-03-09 01:30:56,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:30:56,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 188 [2025-03-09 01:30:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:56,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657377056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:56,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:56,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-09 01:30:56,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217825803] [2025-03-09 01:30:56,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:56,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:30:56,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:56,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:30:56,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:30:57,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-03-09 01:30:57,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 233 transitions, 3071 flow. Second operand has 22 states, 22 states have (on average 18.681818181818183) internal successors, (411), 22 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:57,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:57,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-03-09 01:30:57,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:57,931 INFO L124 PetriNetUnfolderBase]: 1957/3489 cut-off events. [2025-03-09 01:30:57,931 INFO L125 PetriNetUnfolderBase]: For 58266/58293 co-relation queries the response was YES. [2025-03-09 01:30:57,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21804 conditions, 3489 events. 1957/3489 cut-off events. For 58266/58293 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 20275 event pairs, 476 based on Foata normal form. 4/3474 useless extension candidates. Maximal degree in co-relation 21638. Up to 2280 conditions per place. [2025-03-09 01:30:57,954 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 208 selfloop transitions, 68 changer transitions 32/323 dead transitions. [2025-03-09 01:30:57,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 323 transitions, 4599 flow [2025-03-09 01:30:57,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:30:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:30:57,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 330 transitions. [2025-03-09 01:30:57,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-03-09 01:30:57,955 INFO L175 Difference]: Start difference. First operand has 183 places, 233 transitions, 3071 flow. Second operand 14 states and 330 transitions. [2025-03-09 01:30:57,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 323 transitions, 4599 flow [2025-03-09 01:30:58,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 323 transitions, 4246 flow, removed 130 selfloop flow, removed 15 redundant places. [2025-03-09 01:30:58,098 INFO L231 Difference]: Finished difference. Result has 180 places, 237 transitions, 2954 flow [2025-03-09 01:30:58,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2816, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2954, PETRI_PLACES=180, PETRI_TRANSITIONS=237} [2025-03-09 01:30:58,099 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 140 predicate places. [2025-03-09 01:30:58,099 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 237 transitions, 2954 flow [2025-03-09 01:30:58,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 18.681818181818183) internal successors, (411), 22 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:58,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:58,099 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:58,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:30:58,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 01:30:58,299 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:58,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:58,300 INFO L85 PathProgramCache]: Analyzing trace with hash -364099088, now seen corresponding path program 5 times [2025-03-09 01:30:58,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:58,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571806245] [2025-03-09 01:30:58,300 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:30:58,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:58,304 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:30:58,309 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:30:58,309 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:30:58,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:58,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:58,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571806245] [2025-03-09 01:30:58,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571806245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:58,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:58,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:30:58,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973622274] [2025-03-09 01:30:58,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:58,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:30:58,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:58,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:30:58,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:30:58,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:30:58,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 237 transitions, 2954 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:58,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:58,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:30:58,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:58,957 INFO L124 PetriNetUnfolderBase]: 2149/3661 cut-off events. [2025-03-09 01:30:58,957 INFO L125 PetriNetUnfolderBase]: For 61010/61010 co-relation queries the response was YES. [2025-03-09 01:30:58,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22385 conditions, 3661 events. 2149/3661 cut-off events. For 61010/61010 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 20560 event pairs, 555 based on Foata normal form. 16/3677 useless extension candidates. Maximal degree in co-relation 22209. Up to 1711 conditions per place. [2025-03-09 01:30:58,978 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 312 selfloop transitions, 39 changer transitions 24/376 dead transitions. [2025-03-09 01:30:58,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 376 transitions, 4986 flow [2025-03-09 01:30:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 212 transitions. [2025-03-09 01:30:58,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-03-09 01:30:58,979 INFO L175 Difference]: Start difference. First operand has 180 places, 237 transitions, 2954 flow. Second operand 9 states and 212 transitions. [2025-03-09 01:30:58,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 376 transitions, 4986 flow [2025-03-09 01:30:59,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 376 transitions, 4834 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-03-09 01:30:59,095 INFO L231 Difference]: Finished difference. Result has 178 places, 229 transitions, 2752 flow [2025-03-09 01:30:59,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2827, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2752, PETRI_PLACES=178, PETRI_TRANSITIONS=229} [2025-03-09 01:30:59,096 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 138 predicate places. [2025-03-09 01:30:59,096 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 229 transitions, 2752 flow [2025-03-09 01:30:59,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:59,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:59,096 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:59,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 01:30:59,096 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:59,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:59,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1156190152, now seen corresponding path program 6 times [2025-03-09 01:30:59,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:59,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926052046] [2025-03-09 01:30:59,097 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:30:59,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:59,101 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:30:59,106 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:30:59,106 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-09 01:30:59,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:59,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:59,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926052046] [2025-03-09 01:30:59,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926052046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:59,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:59,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:30:59,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54585950] [2025-03-09 01:30:59,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:59,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:30:59,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:59,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:30:59,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:30:59,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:30:59,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 229 transitions, 2752 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:59,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:59,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:30:59,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:59,619 INFO L124 PetriNetUnfolderBase]: 2073/3519 cut-off events. [2025-03-09 01:30:59,619 INFO L125 PetriNetUnfolderBase]: For 63238/63238 co-relation queries the response was YES. [2025-03-09 01:30:59,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21995 conditions, 3519 events. 2073/3519 cut-off events. For 63238/63238 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 19541 event pairs, 649 based on Foata normal form. 22/3541 useless extension candidates. Maximal degree in co-relation 21769. Up to 1901 conditions per place. [2025-03-09 01:30:59,642 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 264 selfloop transitions, 56 changer transitions 21/342 dead transitions. [2025-03-09 01:30:59,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 342 transitions, 4531 flow [2025-03-09 01:30:59,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:30:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:30:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions. [2025-03-09 01:30:59,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2025-03-09 01:30:59,644 INFO L175 Difference]: Start difference. First operand has 178 places, 229 transitions, 2752 flow. Second operand 9 states and 206 transitions. [2025-03-09 01:30:59,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 342 transitions, 4531 flow [2025-03-09 01:30:59,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 342 transitions, 4335 flow, removed 21 selfloop flow, removed 13 redundant places. [2025-03-09 01:30:59,755 INFO L231 Difference]: Finished difference. Result has 173 places, 238 transitions, 2861 flow [2025-03-09 01:30:59,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2595, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2861, PETRI_PLACES=173, PETRI_TRANSITIONS=238} [2025-03-09 01:30:59,755 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 133 predicate places. [2025-03-09 01:30:59,755 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 238 transitions, 2861 flow [2025-03-09 01:30:59,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:59,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:59,755 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:59,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 01:30:59,756 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:30:59,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:59,756 INFO L85 PathProgramCache]: Analyzing trace with hash 572228072, now seen corresponding path program 7 times [2025-03-09 01:30:59,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:59,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649378015] [2025-03-09 01:30:59,756 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:30:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:59,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:30:59,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:30:59,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:59,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:30:59,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:59,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649378015] [2025-03-09 01:30:59,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649378015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:59,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:59,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:30:59,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530178905] [2025-03-09 01:30:59,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:59,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:30:59,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:59,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:30:59,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:30:59,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:30:59,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 238 transitions, 2861 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:59,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:59,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:30:59,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:00,388 INFO L124 PetriNetUnfolderBase]: 2042/3472 cut-off events. [2025-03-09 01:31:00,388 INFO L125 PetriNetUnfolderBase]: For 63614/63614 co-relation queries the response was YES. [2025-03-09 01:31:00,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21418 conditions, 3472 events. 2042/3472 cut-off events. For 63614/63614 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 19307 event pairs, 651 based on Foata normal form. 16/3488 useless extension candidates. Maximal degree in co-relation 21300. Up to 1857 conditions per place. [2025-03-09 01:31:00,411 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 261 selfloop transitions, 50 changer transitions 25/337 dead transitions. [2025-03-09 01:31:00,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 337 transitions, 4428 flow [2025-03-09 01:31:00,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:31:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:31:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 199 transitions. [2025-03-09 01:31:00,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5527777777777778 [2025-03-09 01:31:00,412 INFO L175 Difference]: Start difference. First operand has 173 places, 238 transitions, 2861 flow. Second operand 9 states and 199 transitions. [2025-03-09 01:31:00,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 337 transitions, 4428 flow [2025-03-09 01:31:00,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 337 transitions, 4314 flow, removed 17 selfloop flow, removed 4 redundant places. [2025-03-09 01:31:00,511 INFO L231 Difference]: Finished difference. Result has 178 places, 230 transitions, 2703 flow [2025-03-09 01:31:00,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2767, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2703, PETRI_PLACES=178, PETRI_TRANSITIONS=230} [2025-03-09 01:31:00,511 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 138 predicate places. [2025-03-09 01:31:00,511 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 230 transitions, 2703 flow [2025-03-09 01:31:00,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:00,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:00,511 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:00,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 01:31:00,512 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:31:00,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash -897461908, now seen corresponding path program 8 times [2025-03-09 01:31:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:00,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730403650] [2025-03-09 01:31:00,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:00,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:00,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:31:00,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:00,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:31:00,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:00,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:00,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730403650] [2025-03-09 01:31:00,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730403650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:00,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343018949] [2025-03-09 01:31:00,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:00,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:00,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:00,603 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:00,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:31:00,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:31:00,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:00,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:31:00,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:00,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 01:31:00,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:00,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 01:31:00,775 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-09 01:31:00,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:00,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:00,940 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 33 treesize of output 29 [2025-03-09 01:31:00,945 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:31:00,946 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 62 treesize of output 41 [2025-03-09 01:31:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:00,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343018949] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:00,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:00,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-09 01:31:00,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560891949] [2025-03-09 01:31:00,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:00,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:31:00,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:00,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:31:00,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:31:01,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:31:01,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 230 transitions, 2703 flow. Second operand has 18 states, 18 states have (on average 17.444444444444443) internal successors, (314), 18 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:01,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:01,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:31:01,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:02,322 INFO L124 PetriNetUnfolderBase]: 1955/3326 cut-off events. [2025-03-09 01:31:02,322 INFO L125 PetriNetUnfolderBase]: For 60394/60394 co-relation queries the response was YES. [2025-03-09 01:31:02,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20657 conditions, 3326 events. 1955/3326 cut-off events. For 60394/60394 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 18114 event pairs, 231 based on Foata normal form. 8/3334 useless extension candidates. Maximal degree in co-relation 20386. Up to 1459 conditions per place. [2025-03-09 01:31:02,350 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 262 selfloop transitions, 99 changer transitions 57/419 dead transitions. [2025-03-09 01:31:02,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 419 transitions, 5049 flow [2025-03-09 01:31:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-09 01:31:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-09 01:31:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 611 transitions. [2025-03-09 01:31:02,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5091666666666667 [2025-03-09 01:31:02,352 INFO L175 Difference]: Start difference. First operand has 178 places, 230 transitions, 2703 flow. Second operand 30 states and 611 transitions. [2025-03-09 01:31:02,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 419 transitions, 5049 flow [2025-03-09 01:31:02,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 419 transitions, 4884 flow, removed 27 selfloop flow, removed 8 redundant places. [2025-03-09 01:31:02,440 INFO L231 Difference]: Finished difference. Result has 199 places, 236 transitions, 2808 flow [2025-03-09 01:31:02,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2556, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2808, PETRI_PLACES=199, PETRI_TRANSITIONS=236} [2025-03-09 01:31:02,440 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 159 predicate places. [2025-03-09 01:31:02,440 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 236 transitions, 2808 flow [2025-03-09 01:31:02,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.444444444444443) internal successors, (314), 18 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:02,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:02,440 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:02,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 01:31:02,641 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,SelfDestructingSolverStorable27 [2025-03-09 01:31:02,641 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:31:02,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:02,642 INFO L85 PathProgramCache]: Analyzing trace with hash 640865959, now seen corresponding path program 3 times [2025-03-09 01:31:02,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:02,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96440956] [2025-03-09 01:31:02,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:31:02,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:02,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-09 01:31:02,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 23 statements. [2025-03-09 01:31:02,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:31:02,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:02,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:02,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96440956] [2025-03-09 01:31:02,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96440956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:02,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127179866] [2025-03-09 01:31:02,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:31:02,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:02,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:02,745 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:02,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 01:31:02,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-09 01:31:02,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 23 statements. [2025-03-09 01:31:02,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:31:02,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:02,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:31:02,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:02,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:02,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:02,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127179866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:02,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:02,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 15 [2025-03-09 01:31:02,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560136292] [2025-03-09 01:31:02,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:02,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:31:02,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:02,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:31:02,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:31:02,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:31:02,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 236 transitions, 2808 flow. Second operand has 15 states, 15 states have (on average 16.2) internal successors, (243), 15 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:02,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:02,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:31:02,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:04,072 INFO L124 PetriNetUnfolderBase]: 2453/4292 cut-off events. [2025-03-09 01:31:04,072 INFO L125 PetriNetUnfolderBase]: For 71669/71669 co-relation queries the response was YES. [2025-03-09 01:31:04,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25870 conditions, 4292 events. 2453/4292 cut-off events. For 71669/71669 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 25384 event pairs, 427 based on Foata normal form. 15/4307 useless extension candidates. Maximal degree in co-relation 25770. Up to 1336 conditions per place. [2025-03-09 01:31:04,092 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 273 selfloop transitions, 223 changer transitions 4/501 dead transitions. [2025-03-09 01:31:04,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 501 transitions, 6126 flow [2025-03-09 01:31:04,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-09 01:31:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-09 01:31:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 556 transitions. [2025-03-09 01:31:04,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5148148148148148 [2025-03-09 01:31:04,093 INFO L175 Difference]: Start difference. First operand has 199 places, 236 transitions, 2808 flow. Second operand 27 states and 556 transitions. [2025-03-09 01:31:04,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 501 transitions, 6126 flow [2025-03-09 01:31:04,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 501 transitions, 5612 flow, removed 101 selfloop flow, removed 22 redundant places. [2025-03-09 01:31:04,163 INFO L231 Difference]: Finished difference. Result has 194 places, 340 transitions, 4178 flow [2025-03-09 01:31:04,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2525, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=4178, PETRI_PLACES=194, PETRI_TRANSITIONS=340} [2025-03-09 01:31:04,164 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 154 predicate places. [2025-03-09 01:31:04,164 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 340 transitions, 4178 flow [2025-03-09 01:31:04,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.2) internal successors, (243), 15 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:04,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:04,164 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:04,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 01:31:04,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:04,365 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:31:04,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:04,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1622071905, now seen corresponding path program 4 times [2025-03-09 01:31:04,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:04,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351538648] [2025-03-09 01:31:04,365 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:31:04,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:04,369 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:31:04,377 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:04,377 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:31:04,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:04,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:04,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351538648] [2025-03-09 01:31:04,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351538648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:04,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395181036] [2025-03-09 01:31:04,505 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:31:04,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:04,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:04,507 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:04,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 01:31:04,546 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:31:04,591 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:04,591 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:31:04,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:04,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:31:04,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:04,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:04,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395181036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:04,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:04,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-09 01:31:04,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684227821] [2025-03-09 01:31:04,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:04,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:31:04,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:04,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:31:04,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:31:04,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:31:04,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 340 transitions, 4178 flow. Second operand has 17 states, 17 states have (on average 15.941176470588236) internal successors, (271), 17 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:04,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:04,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:31:04,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:06,686 INFO L124 PetriNetUnfolderBase]: 5024/8741 cut-off events. [2025-03-09 01:31:06,686 INFO L125 PetriNetUnfolderBase]: For 131019/131019 co-relation queries the response was YES. [2025-03-09 01:31:06,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54169 conditions, 8741 events. 5024/8741 cut-off events. For 131019/131019 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 57165 event pairs, 379 based on Foata normal form. 15/8756 useless extension candidates. Maximal degree in co-relation 54075. Up to 1543 conditions per place. [2025-03-09 01:31:06,746 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 420 selfloop transitions, 566 changer transitions 0/987 dead transitions. [2025-03-09 01:31:06,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 987 transitions, 13606 flow [2025-03-09 01:31:06,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-09 01:31:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-09 01:31:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 760 transitions. [2025-03-09 01:31:06,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2025-03-09 01:31:06,748 INFO L175 Difference]: Start difference. First operand has 194 places, 340 transitions, 4178 flow. Second operand 34 states and 760 transitions. [2025-03-09 01:31:06,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 987 transitions, 13606 flow [2025-03-09 01:31:07,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 987 transitions, 12438 flow, removed 572 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:07,233 INFO L231 Difference]: Finished difference. Result has 249 places, 740 transitions, 10708 flow [2025-03-09 01:31:07,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3841, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=10708, PETRI_PLACES=249, PETRI_TRANSITIONS=740} [2025-03-09 01:31:07,234 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 209 predicate places. [2025-03-09 01:31:07,234 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 740 transitions, 10708 flow [2025-03-09 01:31:07,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.941176470588236) internal successors, (271), 17 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:07,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:07,234 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:07,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 01:31:07,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:07,435 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:31:07,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:07,435 INFO L85 PathProgramCache]: Analyzing trace with hash 116341433, now seen corresponding path program 5 times [2025-03-09 01:31:07,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:07,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639440497] [2025-03-09 01:31:07,435 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:31:07,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:07,439 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-03-09 01:31:07,446 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:07,446 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:31:07,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:07,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:07,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639440497] [2025-03-09 01:31:07,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639440497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:07,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104694604] [2025-03-09 01:31:07,586 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:31:07,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:07,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:07,588 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:07,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 01:31:07,628 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-03-09 01:31:07,694 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:07,694 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:31:07,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:07,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:31:07,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:07,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:07,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104694604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:07,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:07,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-09 01:31:07,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746261165] [2025-03-09 01:31:07,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:07,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:31:07,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:07,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:31:07,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:31:07,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:31:07,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 740 transitions, 10708 flow. Second operand has 18 states, 18 states have (on average 16.055555555555557) internal successors, (289), 18 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:07,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:07,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:31:07,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:10,618 INFO L124 PetriNetUnfolderBase]: 5890/10247 cut-off events. [2025-03-09 01:31:10,618 INFO L125 PetriNetUnfolderBase]: For 191713/191713 co-relation queries the response was YES. [2025-03-09 01:31:10,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72124 conditions, 10247 events. 5890/10247 cut-off events. For 191713/191713 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 69331 event pairs, 1200 based on Foata normal form. 168/10415 useless extension candidates. Maximal degree in co-relation 72007. Up to 3968 conditions per place. [2025-03-09 01:31:10,713 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 729 selfloop transitions, 545 changer transitions 0/1275 dead transitions. [2025-03-09 01:31:10,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 1275 transitions, 20681 flow [2025-03-09 01:31:10,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-09 01:31:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-09 01:31:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 684 transitions. [2025-03-09 01:31:10,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5516129032258065 [2025-03-09 01:31:10,715 INFO L175 Difference]: Start difference. First operand has 249 places, 740 transitions, 10708 flow. Second operand 31 states and 684 transitions. [2025-03-09 01:31:10,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 1275 transitions, 20681 flow [2025-03-09 01:31:12,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 1275 transitions, 18104 flow, removed 1256 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:12,175 INFO L231 Difference]: Finished difference. Result has 297 places, 985 transitions, 15115 flow [2025-03-09 01:31:12,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9551, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=319, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=15115, PETRI_PLACES=297, PETRI_TRANSITIONS=985} [2025-03-09 01:31:12,176 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 257 predicate places. [2025-03-09 01:31:12,176 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 985 transitions, 15115 flow [2025-03-09 01:31:12,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 16.055555555555557) internal successors, (289), 18 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:12,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:12,176 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:12,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-09 01:31:12,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:12,377 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:31:12,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1617149887, now seen corresponding path program 6 times [2025-03-09 01:31:12,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:12,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135579931] [2025-03-09 01:31:12,377 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:31:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:12,381 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-03-09 01:31:12,385 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-03-09 01:31:12,385 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 01:31:12,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:12,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:12,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135579931] [2025-03-09 01:31:12,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135579931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:12,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:12,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:31:12,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978379281] [2025-03-09 01:31:12,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:12,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:31:12,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:12,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:31:12,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:31:12,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:31:12,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 985 transitions, 15115 flow. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:12,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:12,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:31:12,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:14,708 INFO L124 PetriNetUnfolderBase]: 5894/10257 cut-off events. [2025-03-09 01:31:14,708 INFO L125 PetriNetUnfolderBase]: For 118669/118669 co-relation queries the response was YES. [2025-03-09 01:31:14,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66645 conditions, 10257 events. 5894/10257 cut-off events. For 118669/118669 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 69282 event pairs, 2511 based on Foata normal form. 3/10260 useless extension candidates. Maximal degree in co-relation 66510. Up to 8637 conditions per place. [2025-03-09 01:31:14,781 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 926 selfloop transitions, 100 changer transitions 0/1027 dead transitions. [2025-03-09 01:31:14,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 1027 transitions, 17539 flow [2025-03-09 01:31:14,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:31:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:31:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2025-03-09 01:31:14,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-09 01:31:14,782 INFO L175 Difference]: Start difference. First operand has 297 places, 985 transitions, 15115 flow. Second operand 9 states and 198 transitions. [2025-03-09 01:31:14,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 1027 transitions, 17539 flow [2025-03-09 01:31:15,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 1027 transitions, 16925 flow, removed 189 selfloop flow, removed 6 redundant places. [2025-03-09 01:31:15,771 INFO L231 Difference]: Finished difference. Result has 301 places, 987 transitions, 14755 flow [2025-03-09 01:31:15,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14501, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=885, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14755, PETRI_PLACES=301, PETRI_TRANSITIONS=987} [2025-03-09 01:31:15,771 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 261 predicate places. [2025-03-09 01:31:15,771 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 987 transitions, 14755 flow [2025-03-09 01:31:15,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:15,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:15,772 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:15,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-09 01:31:15,772 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:31:15,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1189576941, now seen corresponding path program 7 times [2025-03-09 01:31:15,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:15,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179711235] [2025-03-09 01:31:15,772 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:31:15,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:15,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:31:15,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:15,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:15,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:15,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:15,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179711235] [2025-03-09 01:31:15,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179711235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:15,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524256168] [2025-03-09 01:31:15,871 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:31:15,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:15,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:15,873 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:15,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 01:31:15,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:31:15,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:15,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:15,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:15,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:31:15,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:15,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:16,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524256168] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:16,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:16,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-09 01:31:16,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664107447] [2025-03-09 01:31:16,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:16,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:31:16,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:16,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:31:16,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:31:16,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:31:16,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 987 transitions, 14755 flow. Second operand has 16 states, 16 states have (on average 16.0) internal successors, (256), 16 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:16,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:16,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:31:16,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:21,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 01:31:24,838 INFO L124 PetriNetUnfolderBase]: 6560/11471 cut-off events. [2025-03-09 01:31:24,839 INFO L125 PetriNetUnfolderBase]: For 119845/119845 co-relation queries the response was YES. [2025-03-09 01:31:24,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72256 conditions, 11471 events. 6560/11471 cut-off events. For 119845/119845 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 80238 event pairs, 1160 based on Foata normal form. 18/11489 useless extension candidates. Maximal degree in co-relation 72121. Up to 3984 conditions per place. [2025-03-09 01:31:24,939 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 446 selfloop transitions, 998 changer transitions 0/1445 dead transitions. [2025-03-09 01:31:24,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 1445 transitions, 22871 flow [2025-03-09 01:31:24,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-09 01:31:24,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-03-09 01:31:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 883 transitions. [2025-03-09 01:31:24,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.551875 [2025-03-09 01:31:24,941 INFO L175 Difference]: Start difference. First operand has 301 places, 987 transitions, 14755 flow. Second operand 40 states and 883 transitions. [2025-03-09 01:31:24,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 1445 transitions, 22871 flow [2025-03-09 01:31:25,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 1445 transitions, 22615 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-03-09 01:31:25,955 INFO L231 Difference]: Finished difference. Result has 349 places, 1273 transitions, 21938 flow [2025-03-09 01:31:25,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14529, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=739, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=21938, PETRI_PLACES=349, PETRI_TRANSITIONS=1273} [2025-03-09 01:31:25,956 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 309 predicate places. [2025-03-09 01:31:25,956 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 1273 transitions, 21938 flow [2025-03-09 01:31:25,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.0) internal successors, (256), 16 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:25,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:25,956 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:25,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 01:31:26,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:26,161 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:31:26,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:26,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1155996289, now seen corresponding path program 8 times [2025-03-09 01:31:26,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:26,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556090304] [2025-03-09 01:31:26,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:26,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:26,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:31:26,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:26,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:31:26,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:26,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:26,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556090304] [2025-03-09 01:31:26,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556090304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:26,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526432870] [2025-03-09 01:31:26,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:26,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:26,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:26,244 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:26,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 01:31:26,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:31:26,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:26,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:31:26,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:26,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:31:26,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:26,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:26,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526432870] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:26,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:26,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 15 [2025-03-09 01:31:26,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999739396] [2025-03-09 01:31:26,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:26,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:31:26,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:26,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:31:26,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:31:26,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:31:26,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 1273 transitions, 21938 flow. Second operand has 15 states, 15 states have (on average 16.133333333333333) internal successors, (242), 15 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:26,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:26,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:31:26,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:29,818 INFO L124 PetriNetUnfolderBase]: 6618/11594 cut-off events. [2025-03-09 01:31:29,818 INFO L125 PetriNetUnfolderBase]: For 151962/151962 co-relation queries the response was YES. [2025-03-09 01:31:29,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81864 conditions, 11594 events. 6618/11594 cut-off events. For 151962/151962 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 81182 event pairs, 1417 based on Foata normal form. 21/11615 useless extension candidates. Maximal degree in co-relation 81716. Up to 4843 conditions per place. [2025-03-09 01:31:29,928 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 742 selfloop transitions, 668 changer transitions 0/1411 dead transitions. [2025-03-09 01:31:29,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 1411 transitions, 26440 flow [2025-03-09 01:31:29,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 01:31:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-09 01:31:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 462 transitions. [2025-03-09 01:31:29,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5021739130434782 [2025-03-09 01:31:29,929 INFO L175 Difference]: Start difference. First operand has 349 places, 1273 transitions, 21938 flow. Second operand 23 states and 462 transitions. [2025-03-09 01:31:29,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 1411 transitions, 26440 flow [2025-03-09 01:31:31,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 1411 transitions, 25220 flow, removed 498 selfloop flow, removed 9 redundant places. [2025-03-09 01:31:31,646 INFO L231 Difference]: Finished difference. Result has 368 places, 1308 transitions, 23649 flow [2025-03-09 01:31:31,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=20732, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=631, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=23649, PETRI_PLACES=368, PETRI_TRANSITIONS=1308} [2025-03-09 01:31:31,647 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 328 predicate places. [2025-03-09 01:31:31,647 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 1308 transitions, 23649 flow [2025-03-09 01:31:31,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.133333333333333) internal successors, (242), 15 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:31,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:31,647 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:31,654 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-09 01:31:31,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:31,848 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:31:31,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:31,848 INFO L85 PathProgramCache]: Analyzing trace with hash -939867947, now seen corresponding path program 9 times [2025-03-09 01:31:31,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:31,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318597183] [2025-03-09 01:31:31,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:31:31,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:31,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-09 01:31:31,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 23 statements. [2025-03-09 01:31:31,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:31:31,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:31,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:31,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318597183] [2025-03-09 01:31:31,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318597183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:31,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510567699] [2025-03-09 01:31:31,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:31:31,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:31,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:31,968 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:31,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-09 01:31:32,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-09 01:31:32,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 23 statements. [2025-03-09 01:31:32,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:31:32,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:32,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:31:32,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:32,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:32,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:32,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510567699] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:32,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:32,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-09 01:31:32,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153517310] [2025-03-09 01:31:32,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:32,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:31:32,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:32,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:31:32,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:31:32,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:31:32,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 1308 transitions, 23649 flow. Second operand has 17 states, 17 states have (on average 16.058823529411764) internal successors, (273), 17 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:32,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:32,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:31:32,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:37,388 INFO L124 PetriNetUnfolderBase]: 7899/13940 cut-off events. [2025-03-09 01:31:37,388 INFO L125 PetriNetUnfolderBase]: For 192052/192052 co-relation queries the response was YES. [2025-03-09 01:31:37,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101288 conditions, 13940 events. 7899/13940 cut-off events. For 192052/192052 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 102803 event pairs, 1653 based on Foata normal form. 42/13982 useless extension candidates. Maximal degree in co-relation 101137. Up to 6247 conditions per place. [2025-03-09 01:31:37,592 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 544 selfloop transitions, 1342 changer transitions 0/1887 dead transitions. [2025-03-09 01:31:37,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 1887 transitions, 36645 flow [2025-03-09 01:31:37,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-09 01:31:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-09 01:31:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 892 transitions. [2025-03-09 01:31:37,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.530952380952381 [2025-03-09 01:31:37,594 INFO L175 Difference]: Start difference. First operand has 368 places, 1308 transitions, 23649 flow. Second operand 42 states and 892 transitions. [2025-03-09 01:31:37,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 1887 transitions, 36645 flow [2025-03-09 01:31:40,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 1887 transitions, 36313 flow, removed 74 selfloop flow, removed 7 redundant places. [2025-03-09 01:31:40,129 INFO L231 Difference]: Finished difference. Result has 424 places, 1732 transitions, 36798 flow [2025-03-09 01:31:40,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=23344, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=960, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=36798, PETRI_PLACES=424, PETRI_TRANSITIONS=1732} [2025-03-09 01:31:40,131 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 384 predicate places. [2025-03-09 01:31:40,131 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 1732 transitions, 36798 flow [2025-03-09 01:31:40,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.058823529411764) internal successors, (273), 17 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:40,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:40,131 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:40,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-09 01:31:40,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:40,332 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:31:40,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:40,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1441971073, now seen corresponding path program 10 times [2025-03-09 01:31:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:40,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767268409] [2025-03-09 01:31:40,333 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:31:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:40,336 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:31:40,341 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:40,341 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:31:40,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:40,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:40,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767268409] [2025-03-09 01:31:40,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767268409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:40,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173633355] [2025-03-09 01:31:40,455 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:31:40,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:40,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:40,457 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:40,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-09 01:31:40,504 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:31:40,526 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:40,526 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:31:40,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:40,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:31:40,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:40,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:40,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173633355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:40,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:40,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-09 01:31:40,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493419968] [2025-03-09 01:31:40,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:40,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:31:40,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:40,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:31:40,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:31:40,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:31:40,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 1732 transitions, 36798 flow. Second operand has 17 states, 17 states have (on average 16.176470588235293) internal successors, (275), 17 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:40,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:40,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:31:40,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:47,597 INFO L124 PetriNetUnfolderBase]: 9224/16107 cut-off events. [2025-03-09 01:31:47,597 INFO L125 PetriNetUnfolderBase]: For 281278/281278 co-relation queries the response was YES. [2025-03-09 01:31:47,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130660 conditions, 16107 events. 9224/16107 cut-off events. For 281278/281278 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 120151 event pairs, 538 based on Foata normal form. 226/16333 useless extension candidates. Maximal degree in co-relation 130492. Up to 3141 conditions per place. [2025-03-09 01:31:47,820 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 706 selfloop transitions, 1613 changer transitions 0/2320 dead transitions. [2025-03-09 01:31:47,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 2320 transitions, 51845 flow [2025-03-09 01:31:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-09 01:31:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-09 01:31:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 811 transitions. [2025-03-09 01:31:47,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.547972972972973 [2025-03-09 01:31:47,823 INFO L175 Difference]: Start difference. First operand has 424 places, 1732 transitions, 36798 flow. Second operand 37 states and 811 transitions. [2025-03-09 01:31:47,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 2320 transitions, 51845 flow [2025-03-09 01:31:52,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 2320 transitions, 50657 flow, removed 454 selfloop flow, removed 10 redundant places. [2025-03-09 01:31:52,496 INFO L231 Difference]: Finished difference. Result has 470 places, 2111 transitions, 50078 flow [2025-03-09 01:31:52,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=35114, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=50078, PETRI_PLACES=470, PETRI_TRANSITIONS=2111} [2025-03-09 01:31:52,499 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 430 predicate places. [2025-03-09 01:31:52,499 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 2111 transitions, 50078 flow [2025-03-09 01:31:52,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.176470588235293) internal successors, (275), 17 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:52,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:52,499 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:52,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-09 01:31:52,700 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,SelfDestructingSolverStorable35 [2025-03-09 01:31:52,700 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:31:52,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:52,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1912654782, now seen corresponding path program 9 times [2025-03-09 01:31:52,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:52,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907577723] [2025-03-09 01:31:52,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:31:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:52,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-09 01:31:52,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:31:52,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:31:52,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:52,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:52,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907577723] [2025-03-09 01:31:52,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907577723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:52,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056396449] [2025-03-09 01:31:52,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:31:52,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:52,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:52,817 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:52,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-09 01:31:52,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-09 01:31:52,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:31:52,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:31:52,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:52,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:31:52,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:53,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:53,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056396449] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:53,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:31:53,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 7] total 17 [2025-03-09 01:31:53,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715033384] [2025-03-09 01:31:53,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:53,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:31:53,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:53,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:31:53,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:31:53,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2025-03-09 01:31:53,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 2111 transitions, 50078 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:53,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:53,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2025-03-09 01:31:53,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:00,108 INFO L124 PetriNetUnfolderBase]: 8524/15269 cut-off events. [2025-03-09 01:32:00,108 INFO L125 PetriNetUnfolderBase]: For 304831/304831 co-relation queries the response was YES. [2025-03-09 01:32:00,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135883 conditions, 15269 events. 8524/15269 cut-off events. For 304831/304831 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 117423 event pairs, 941 based on Foata normal form. 22/15278 useless extension candidates. Maximal degree in co-relation 135695. Up to 12002 conditions per place. [2025-03-09 01:32:00,308 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 1521 selfloop transitions, 619 changer transitions 0/2144 dead transitions. [2025-03-09 01:32:00,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 2144 transitions, 54709 flow [2025-03-09 01:32:00,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:32:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:32:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2025-03-09 01:32:00,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-09 01:32:00,309 INFO L175 Difference]: Start difference. First operand has 470 places, 2111 transitions, 50078 flow. Second operand 7 states and 168 transitions. [2025-03-09 01:32:00,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 2144 transitions, 54709 flow [2025-03-09 01:32:06,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 2144 transitions, 53928 flow, removed 295 selfloop flow, removed 4 redundant places. [2025-03-09 01:32:06,507 INFO L231 Difference]: Finished difference. Result has 476 places, 2114 transitions, 51852 flow [2025-03-09 01:32:06,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=49165, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=610, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=51852, PETRI_PLACES=476, PETRI_TRANSITIONS=2114} [2025-03-09 01:32:06,509 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 436 predicate places. [2025-03-09 01:32:06,509 INFO L471 AbstractCegarLoop]: Abstraction has has 476 places, 2114 transitions, 51852 flow [2025-03-09 01:32:06,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:06,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:06,509 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:06,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-09 01:32:06,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-09 01:32:06,710 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-09 01:32:06,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:06,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1786657048, now seen corresponding path program 1 times [2025-03-09 01:32:06,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:06,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066479274] [2025-03-09 01:32:06,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:06,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:06,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:32:06,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:32:06,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:06,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:32:06,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:06,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066479274] [2025-03-09 01:32:06,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066479274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:32:06,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579207220] [2025-03-09 01:32:06,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:32:06,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:32:06,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:06,813 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:32:06,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-09 01:32:06,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:32:06,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:32:06,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:32:06,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:06,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:32:06,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:32:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:32:06,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:32:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:32:07,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579207220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:32:07,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:32:07,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 17 [2025-03-09 01:32:07,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483333978] [2025-03-09 01:32:07,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:32:07,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:32:07,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:07,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:32:07,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:32:07,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2025-03-09 01:32:07,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 2114 transitions, 51852 flow. Second operand has 17 states, 17 states have (on average 16.11764705882353) internal successors, (274), 17 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:07,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:07,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2025-03-09 01:32:07,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand