./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/parallel-misc-1.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 faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:25:34,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:25:35,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:25:35,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:25:35,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:25:35,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:25:35,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:25:35,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:25:35,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:25:35,046 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:25:35,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:25:35,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:25:35,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:25:35,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:25:35,047 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:25:35,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:25:35,047 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:25:35,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:25:35,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:25:35,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:25:35,047 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:25:35,047 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:25:35,047 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:25:35,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:25:35,047 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:25:35,047 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:25:35,047 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:25:35,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:25:35,048 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:25:35,048 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:25:35,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:25:35,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:25:35,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:25:35,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:25:35,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:25:35,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:25:35,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:25:35,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:25:35,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:25:35,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:25:35,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:25:35,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:25:35,048 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 -> faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 [2025-03-17 14:25:35,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:25:35,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:25:35,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:25:35,293 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:25:35,293 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:25:35,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-03-17 14:25:36,386 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfb7cc3b/71cfb0e245ee41f29f72d251e75543cf/FLAG9cf79bcb5 [2025-03-17 14:25:36,621 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:25:36,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-03-17 14:25:36,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfb7cc3b/71cfb0e245ee41f29f72d251e75543cf/FLAG9cf79bcb5 [2025-03-17 14:25:36,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bfb7cc3b/71cfb0e245ee41f29f72d251e75543cf [2025-03-17 14:25:36,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:25:36,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:25:36,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:25:36,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:25:36,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:25:36,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:25:36" (1/1) ... [2025-03-17 14:25:36,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7a3495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:36, skipping insertion in model container [2025-03-17 14:25:36,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:25:36" (1/1) ... [2025-03-17 14:25:36,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:25:37,097 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:25:37,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:25:37,108 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:25:37,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:25:37,145 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:25:37,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:37 WrapperNode [2025-03-17 14:25:37,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:25:37,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:25:37,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:25:37,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:25:37,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:37" (1/1) ... [2025-03-17 14:25:37,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:37" (1/1) ... [2025-03-17 14:25:37,184 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 18, calls inlined = 32, statements flattened = 270 [2025-03-17 14:25:37,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:25:37,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:25:37,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:25:37,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:25:37,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:37" (1/1) ... [2025-03-17 14:25:37,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:37" (1/1) ... [2025-03-17 14:25:37,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:37" (1/1) ... [2025-03-17 14:25:37,221 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-17 14:25:37,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:37" (1/1) ... [2025-03-17 14:25:37,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:37" (1/1) ... [2025-03-17 14:25:37,235 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:37" (1/1) ... [2025-03-17 14:25:37,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:37" (1/1) ... [2025-03-17 14:25:37,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:37" (1/1) ... [2025-03-17 14:25:37,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:37" (1/1) ... [2025-03-17 14:25:37,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:25:37,247 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:25:37,247 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:25:37,247 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:25:37,248 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:37" (1/1) ... [2025-03-17 14:25:37,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:25:37,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:37,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:25:37,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:25:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:25:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:25:37,297 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:25:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:25:37,297 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:25:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:25:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:25:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:25:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:25:37,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:25:37,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:25:37,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:25:37,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:25:37,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:25:37,299 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:25:37,379 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:25:37,380 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:25:37,808 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:25:37,808 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:25:38,092 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:25:38,092 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:25:38,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:25:38 BoogieIcfgContainer [2025-03-17 14:25:38,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:25:38,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:25:38,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:25:38,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:25:38,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:25:36" (1/3) ... [2025-03-17 14:25:38,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eec2740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:25:38, skipping insertion in model container [2025-03-17 14:25:38,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:25:37" (2/3) ... [2025-03-17 14:25:38,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eec2740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:25:38, skipping insertion in model container [2025-03-17 14:25:38,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:25:38" (3/3) ... [2025-03-17 14:25:38,098 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-03-17 14:25:38,109 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:25:38,110 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-1.wvr.c that has 3 procedures, 45 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-03-17 14:25:38,110 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:25:38,159 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 14:25:38,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 112 flow [2025-03-17 14:25:38,199 INFO L124 PetriNetUnfolderBase]: 5/47 cut-off events. [2025-03-17 14:25:38,200 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:25:38,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 47 events. 5/47 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 114 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-03-17 14:25:38,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 49 transitions, 112 flow [2025-03-17 14:25:38,208 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 46 transitions, 104 flow [2025-03-17 14:25:38,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:25:38,226 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;@55fefbae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:25:38,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-17 14:25:38,231 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:25:38,232 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:25:38,232 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:25:38,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:38,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:25:38,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:38,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:38,238 INFO L85 PathProgramCache]: Analyzing trace with hash 825908, now seen corresponding path program 1 times [2025-03-17 14:25:38,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:38,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522976143] [2025-03-17 14:25:38,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:38,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:38,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:25:38,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:25:38,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:38,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:38,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:38,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522976143] [2025-03-17 14:25:38,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522976143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:38,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:38,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:25:38,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204893602] [2025-03-17 14:25:38,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:38,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:25:38,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:38,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:25:38,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:25:38,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-17 14:25:38,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:38,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:38,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-17 14:25:38,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:38,620 INFO L124 PetriNetUnfolderBase]: 220/511 cut-off events. [2025-03-17 14:25:38,620 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-17 14:25:38,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 511 events. 220/511 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2833 event pairs, 130 based on Foata normal form. 1/398 useless extension candidates. Maximal degree in co-relation 810. Up to 338 conditions per place. [2025-03-17 14:25:38,629 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 23 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-03-17 14:25:38,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 148 flow [2025-03-17 14:25:38,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:25:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:25:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-17 14:25:38,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2025-03-17 14:25:38,638 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 104 flow. Second operand 3 states and 90 transitions. [2025-03-17 14:25:38,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 148 flow [2025-03-17 14:25:38,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 140 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:25:38,643 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 94 flow [2025-03-17 14:25:38,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2025-03-17 14:25:38,647 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2025-03-17 14:25:38,647 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 94 flow [2025-03-17 14:25:38,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:38,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:38,648 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:25:38,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:25:38,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:38,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:38,648 INFO L85 PathProgramCache]: Analyzing trace with hash 825909, now seen corresponding path program 1 times [2025-03-17 14:25:38,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:38,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363119965] [2025-03-17 14:25:38,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:38,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:38,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:25:38,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:25:38,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:38,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:38,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:38,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363119965] [2025-03-17 14:25:38,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363119965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:38,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:38,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:25:38,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87534598] [2025-03-17 14:25:38,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:38,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:25:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:38,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:25:38,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:25:38,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-17 14:25:38,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:38,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:38,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-17 14:25:38,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:39,119 INFO L124 PetriNetUnfolderBase]: 221/514 cut-off events. [2025-03-17 14:25:39,119 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:25:39,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 514 events. 221/514 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2837 event pairs, 130 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 850. Up to 343 conditions per place. [2025-03-17 14:25:39,123 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 25 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2025-03-17 14:25:39,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 160 flow [2025-03-17 14:25:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:25:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:25:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-17 14:25:39,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5816326530612245 [2025-03-17 14:25:39,125 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 94 flow. Second operand 4 states and 114 transitions. [2025-03-17 14:25:39,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 160 flow [2025-03-17 14:25:39,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:25:39,126 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 117 flow [2025-03-17 14:25:39,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2025-03-17 14:25:39,127 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2025-03-17 14:25:39,127 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 117 flow [2025-03-17 14:25:39,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:39,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:39,127 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:25:39,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:25:39,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:39,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash 793724906, now seen corresponding path program 1 times [2025-03-17 14:25:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:39,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653311858] [2025-03-17 14:25:39,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:39,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:25:39,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:25:39,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:39,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:39,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:39,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653311858] [2025-03-17 14:25:39,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653311858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:39,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741556431] [2025-03-17 14:25:39,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:39,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:39,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:39,382 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:25:39,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:25:39,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:25:39,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:25:39,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:39,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:39,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:25:39,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:39,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 14:25:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:39,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:39,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741556431] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:39,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:39,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:25:39,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432615407] [2025-03-17 14:25:39,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:39,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:25:39,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:39,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:25:39,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:25:39,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-17 14:25:39,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 117 flow. Second operand has 11 states, 11 states have (on average 22.363636363636363) internal successors, (246), 11 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:39,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:39,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-17 14:25:39,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:40,142 INFO L124 PetriNetUnfolderBase]: 221/513 cut-off events. [2025-03-17 14:25:40,142 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:25:40,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 513 events. 221/513 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2837 event pairs, 130 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 857. Up to 339 conditions per place. [2025-03-17 14:25:40,145 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 21 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2025-03-17 14:25:40,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 45 transitions, 169 flow [2025-03-17 14:25:40,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:25:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:25:40,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2025-03-17 14:25:40,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5272108843537415 [2025-03-17 14:25:40,147 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 117 flow. Second operand 6 states and 155 transitions. [2025-03-17 14:25:40,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 45 transitions, 169 flow [2025-03-17 14:25:40,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:25:40,148 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 124 flow [2025-03-17 14:25:40,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=124, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2025-03-17 14:25:40,149 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2025-03-17 14:25:40,149 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 124 flow [2025-03-17 14:25:40,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.363636363636363) internal successors, (246), 11 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:40,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:40,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:25:40,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:25:40,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:40,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:40,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:40,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1162034598, now seen corresponding path program 1 times [2025-03-17 14:25:40,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:40,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570511439] [2025-03-17 14:25:40,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:40,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:40,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:25:40,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:25:40,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:40,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:40,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:40,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570511439] [2025-03-17 14:25:40,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570511439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:40,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:40,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:25:40,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488637160] [2025-03-17 14:25:40,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:40,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:25:40,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:40,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:25:40,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:25:40,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-17 14:25:40,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 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-17 14:25:40,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:40,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-17 14:25:40,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:40,560 INFO L124 PetriNetUnfolderBase]: 273/601 cut-off events. [2025-03-17 14:25:40,560 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:25:40,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 601 events. 273/601 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3096 event pairs, 157 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 827. Up to 313 conditions per place. [2025-03-17 14:25:40,563 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 37 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-03-17 14:25:40,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 232 flow [2025-03-17 14:25:40,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:25:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:25:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-03-17 14:25:40,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-17 14:25:40,564 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 124 flow. Second operand 4 states and 126 transitions. [2025-03-17 14:25:40,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 232 flow [2025-03-17 14:25:40,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 202 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-17 14:25:40,566 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 113 flow [2025-03-17 14:25:40,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2025-03-17 14:25:40,566 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2025-03-17 14:25:40,566 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 113 flow [2025-03-17 14:25:40,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 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-17 14:25:40,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:40,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:40,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:25:40,567 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:40,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:40,567 INFO L85 PathProgramCache]: Analyzing trace with hash -45907535, now seen corresponding path program 1 times [2025-03-17 14:25:40,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:40,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151236047] [2025-03-17 14:25:40,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:40,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:40,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:25:40,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:25:40,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:40,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:40,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:40,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151236047] [2025-03-17 14:25:40,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151236047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:40,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:40,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:25:40,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783432120] [2025-03-17 14:25:40,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:40,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:25:40,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:40,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:25:40,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:25:40,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-03-17 14:25:40,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:40,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:40,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-03-17 14:25:40,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:40,751 INFO L124 PetriNetUnfolderBase]: 245/494 cut-off events. [2025-03-17 14:25:40,751 INFO L125 PetriNetUnfolderBase]: For 80/92 co-relation queries the response was YES. [2025-03-17 14:25:40,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 494 events. 245/494 cut-off events. For 80/92 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2237 event pairs, 135 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 644. Up to 378 conditions per place. [2025-03-17 14:25:40,754 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 26 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2025-03-17 14:25:40,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 159 flow [2025-03-17 14:25:40,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:25:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:25:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-17 14:25:40,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-17 14:25:40,757 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 113 flow. Second operand 4 states and 91 transitions. [2025-03-17 14:25:40,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 159 flow [2025-03-17 14:25:40,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:25:40,760 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 104 flow [2025-03-17 14:25:40,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2025-03-17 14:25:40,761 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2025-03-17 14:25:40,761 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 104 flow [2025-03-17 14:25:40,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:40,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:40,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:40,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:25:40,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:40,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:40,762 INFO L85 PathProgramCache]: Analyzing trace with hash -45907534, now seen corresponding path program 1 times [2025-03-17 14:25:40,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:40,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718413998] [2025-03-17 14:25:40,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:40,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:40,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:25:40,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:25:40,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:40,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:40,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:40,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718413998] [2025-03-17 14:25:40,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718413998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:40,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:40,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:25:40,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944620986] [2025-03-17 14:25:40,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:40,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:25:40,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:40,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:25:40,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:25:40,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-17 14:25:40,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:40,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:40,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-17 14:25:40,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:40,961 INFO L124 PetriNetUnfolderBase]: 255/473 cut-off events. [2025-03-17 14:25:40,961 INFO L125 PetriNetUnfolderBase]: For 99/124 co-relation queries the response was YES. [2025-03-17 14:25:40,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 473 events. 255/473 cut-off events. For 99/124 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2012 event pairs, 138 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 895. Up to 327 conditions per place. [2025-03-17 14:25:40,964 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 39 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-03-17 14:25:40,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 223 flow [2025-03-17 14:25:40,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:25:40,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:25:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2025-03-17 14:25:40,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6479591836734694 [2025-03-17 14:25:40,966 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 104 flow. Second operand 4 states and 127 transitions. [2025-03-17 14:25:40,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 223 flow [2025-03-17 14:25:40,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 219 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:25:40,968 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 119 flow [2025-03-17 14:25:40,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-03-17 14:25:40,970 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2025-03-17 14:25:40,970 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 119 flow [2025-03-17 14:25:40,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:40,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:40,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:40,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:25:40,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:40,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:40,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2066824326, now seen corresponding path program 1 times [2025-03-17 14:25:40,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:40,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941283362] [2025-03-17 14:25:40,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:40,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:40,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:25:40,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:25:40,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:40,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:41,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:41,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941283362] [2025-03-17 14:25:41,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941283362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:41,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667893656] [2025-03-17 14:25:41,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:41,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:41,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:41,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:25:41,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:25:41,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:25:41,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:25:41,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:41,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:41,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:25:41,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:41,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:41,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-17 14:25:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667893656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:41,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:41,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 14:25:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2814990] [2025-03-17 14:25:41,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:41,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:25:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:41,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:25:41,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:25:41,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2025-03-17 14:25:41,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 119 flow. Second operand has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:41,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:41,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2025-03-17 14:25:41,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:41,657 INFO L124 PetriNetUnfolderBase]: 395/734 cut-off events. [2025-03-17 14:25:41,658 INFO L125 PetriNetUnfolderBase]: For 226/270 co-relation queries the response was YES. [2025-03-17 14:25:41,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 734 events. 395/734 cut-off events. For 226/270 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3476 event pairs, 167 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 1503. Up to 265 conditions per place. [2025-03-17 14:25:41,663 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 55 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2025-03-17 14:25:41,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 318 flow [2025-03-17 14:25:41,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:25:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:25:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2025-03-17 14:25:41,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.608843537414966 [2025-03-17 14:25:41,664 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 119 flow. Second operand 6 states and 179 transitions. [2025-03-17 14:25:41,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 318 flow [2025-03-17 14:25:41,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:25:41,665 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 141 flow [2025-03-17 14:25:41,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2025-03-17 14:25:41,666 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2025-03-17 14:25:41,666 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 141 flow [2025-03-17 14:25:41,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:41,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:41,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:41,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:25:41,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 14:25:41,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:41,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1921129757, now seen corresponding path program 1 times [2025-03-17 14:25:41,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:41,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642600593] [2025-03-17 14:25:41,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:41,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:41,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:25:41,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:25:41,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:41,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:42,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:42,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642600593] [2025-03-17 14:25:42,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642600593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:42,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950421339] [2025-03-17 14:25:42,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:42,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:42,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:42,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:25:42,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:25:42,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:25:42,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:25:42,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:42,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:42,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:25:42,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:42,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:42,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-17 14:25:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:42,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950421339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:42,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:42,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 14:25:42,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210561572] [2025-03-17 14:25:42,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:42,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:25:42,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:42,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:25:42,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:25:42,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2025-03-17 14:25:42,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 141 flow. Second operand has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:42,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:42,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2025-03-17 14:25:42,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:42,513 INFO L124 PetriNetUnfolderBase]: 637/1067 cut-off events. [2025-03-17 14:25:42,514 INFO L125 PetriNetUnfolderBase]: For 506/572 co-relation queries the response was YES. [2025-03-17 14:25:42,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2555 conditions, 1067 events. 637/1067 cut-off events. For 506/572 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4806 event pairs, 247 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 2454. Up to 466 conditions per place. [2025-03-17 14:25:42,520 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 60 selfloop transitions, 7 changer transitions 0/73 dead transitions. [2025-03-17 14:25:42,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 380 flow [2025-03-17 14:25:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:25:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:25:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2025-03-17 14:25:42,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2025-03-17 14:25:42,521 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 141 flow. Second operand 6 states and 178 transitions. [2025-03-17 14:25:42,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 380 flow [2025-03-17 14:25:42,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:25:42,523 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 161 flow [2025-03-17 14:25:42,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-03-17 14:25:42,523 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2025-03-17 14:25:42,523 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 161 flow [2025-03-17 14:25:42,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:42,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:42,523 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:42,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:25:42,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:42,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:42,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1407689216, now seen corresponding path program 1 times [2025-03-17 14:25:42,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:42,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776191882] [2025-03-17 14:25:42,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:42,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:42,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:25:42,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:25:42,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:42,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:42,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:42,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776191882] [2025-03-17 14:25:42,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776191882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:42,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336056483] [2025-03-17 14:25:42,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:42,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:42,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:42,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:25:42,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:25:42,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:25:42,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:25:42,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:42,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:42,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:25:42,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:42,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:43,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336056483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:43,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:43,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2025-03-17 14:25:43,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31631869] [2025-03-17 14:25:43,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:43,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:25:43,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:43,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:25:43,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:25:43,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-17 14:25:43,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 161 flow. Second operand has 14 states, 14 states have (on average 23.071428571428573) internal successors, (323), 14 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:43,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:43,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-17 14:25:43,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:43,483 INFO L124 PetriNetUnfolderBase]: 1085/1894 cut-off events. [2025-03-17 14:25:43,483 INFO L125 PetriNetUnfolderBase]: For 1048/1089 co-relation queries the response was YES. [2025-03-17 14:25:43,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4857 conditions, 1894 events. 1085/1894 cut-off events. For 1048/1089 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9984 event pairs, 646 based on Foata normal form. 26/1730 useless extension candidates. Maximal degree in co-relation 3928. Up to 873 conditions per place. [2025-03-17 14:25:43,491 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 93 selfloop transitions, 10 changer transitions 0/109 dead transitions. [2025-03-17 14:25:43,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 109 transitions, 599 flow [2025-03-17 14:25:43,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:25:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:25:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 280 transitions. [2025-03-17 14:25:43,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2025-03-17 14:25:43,493 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 161 flow. Second operand 9 states and 280 transitions. [2025-03-17 14:25:43,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 109 transitions, 599 flow [2025-03-17 14:25:43,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 109 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:25:43,498 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 227 flow [2025-03-17 14:25:43,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=227, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2025-03-17 14:25:43,499 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2025-03-17 14:25:43,499 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 227 flow [2025-03-17 14:25:43,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 23.071428571428573) internal successors, (323), 14 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:43,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:43,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:43,506 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-17 14:25:43,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:43,701 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:43,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:43,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1291984228, now seen corresponding path program 1 times [2025-03-17 14:25:43,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:43,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871031350] [2025-03-17 14:25:43,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:43,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:43,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:25:43,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:25:43,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:43,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:43,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:43,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871031350] [2025-03-17 14:25:43,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871031350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:43,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:43,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:25:43,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780069766] [2025-03-17 14:25:43,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:43,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:25:43,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:43,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:25:43,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:25:43,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-17 14:25:43,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:43,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:43,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-17 14:25:43,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:44,002 INFO L124 PetriNetUnfolderBase]: 1410/2415 cut-off events. [2025-03-17 14:25:44,002 INFO L125 PetriNetUnfolderBase]: For 2069/2210 co-relation queries the response was YES. [2025-03-17 14:25:44,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6659 conditions, 2415 events. 1410/2415 cut-off events. For 2069/2210 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13290 event pairs, 169 based on Foata normal form. 3/2139 useless extension candidates. Maximal degree in co-relation 5551. Up to 1227 conditions per place. [2025-03-17 14:25:44,014 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 76 selfloop transitions, 17 changer transitions 4/104 dead transitions. [2025-03-17 14:25:44,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 104 transitions, 657 flow [2025-03-17 14:25:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:25:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:25:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2025-03-17 14:25:44,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746938775510204 [2025-03-17 14:25:44,015 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 227 flow. Second operand 5 states and 183 transitions. [2025-03-17 14:25:44,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 104 transitions, 657 flow [2025-03-17 14:25:44,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 104 transitions, 654 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:25:44,025 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 356 flow [2025-03-17 14:25:44,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2025-03-17 14:25:44,027 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2025-03-17 14:25:44,028 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 356 flow [2025-03-17 14:25:44,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:44,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:44,029 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:44,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:25:44,029 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:44,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:44,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1363646282, now seen corresponding path program 1 times [2025-03-17 14:25:44,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:44,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071298912] [2025-03-17 14:25:44,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:44,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:44,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:25:44,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:25:44,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:44,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:44,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:44,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071298912] [2025-03-17 14:25:44,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071298912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:44,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929551314] [2025-03-17 14:25:44,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:44,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:44,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:44,116 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:25:44,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:25:44,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:25:44,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:25:44,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:44,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:44,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:25:44,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:44,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:44,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929551314] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:44,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:44,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2025-03-17 14:25:44,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416631200] [2025-03-17 14:25:44,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:44,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:25:44,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:44,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:25:44,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:25:44,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-17 14:25:44,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 356 flow. Second operand has 14 states, 14 states have (on average 23.5) internal successors, (329), 14 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:44,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:44,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-17 14:25:44,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:44,810 INFO L124 PetriNetUnfolderBase]: 1310/2202 cut-off events. [2025-03-17 14:25:44,810 INFO L125 PetriNetUnfolderBase]: For 3508/3589 co-relation queries the response was YES. [2025-03-17 14:25:44,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7515 conditions, 2202 events. 1310/2202 cut-off events. For 3508/3589 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 11352 event pairs, 722 based on Foata normal form. 27/2219 useless extension candidates. Maximal degree in co-relation 6259. Up to 1423 conditions per place. [2025-03-17 14:25:44,822 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 111 selfloop transitions, 10 changer transitions 1/128 dead transitions. [2025-03-17 14:25:44,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 128 transitions, 973 flow [2025-03-17 14:25:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:25:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:25:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 273 transitions. [2025-03-17 14:25:44,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-17 14:25:44,823 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 356 flow. Second operand 9 states and 273 transitions. [2025-03-17 14:25:44,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 128 transitions, 973 flow [2025-03-17 14:25:44,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 128 transitions, 896 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-17 14:25:44,832 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 374 flow [2025-03-17 14:25:44,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=374, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2025-03-17 14:25:44,832 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 26 predicate places. [2025-03-17 14:25:44,832 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 374 flow [2025-03-17 14:25:44,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 23.5) internal successors, (329), 14 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:44,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:44,833 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:44,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:25:45,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 14:25:45,033 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:45,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:45,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1423412875, now seen corresponding path program 2 times [2025-03-17 14:25:45,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:45,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006121309] [2025-03-17 14:25:45,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:25:45,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:45,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 14:25:45,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:25:45,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:25:45,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:25:45,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:45,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006121309] [2025-03-17 14:25:45,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006121309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:45,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277583815] [2025-03-17 14:25:45,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:25:45,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:45,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:45,238 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:25:45,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:25:45,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 14:25:45,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:25:45,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:25:45,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:45,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:25:45,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:45,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 14:25:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:45,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:45,508 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:45,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277583815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:45,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:45,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-03-17 14:25:45,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989358084] [2025-03-17 14:25:45,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:45,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:25:45,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:45,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:25:45,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:25:45,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2025-03-17 14:25:45,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 374 flow. Second operand has 16 states, 16 states have (on average 19.5) internal successors, (312), 16 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:45,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:45,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2025-03-17 14:25:45,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:46,548 INFO L124 PetriNetUnfolderBase]: 1779/2900 cut-off events. [2025-03-17 14:25:46,548 INFO L125 PetriNetUnfolderBase]: For 3040/3040 co-relation queries the response was YES. [2025-03-17 14:25:46,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9935 conditions, 2900 events. 1779/2900 cut-off events. For 3040/3040 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 14590 event pairs, 382 based on Foata normal form. 84/2973 useless extension candidates. Maximal degree in co-relation 8097. Up to 716 conditions per place. [2025-03-17 14:25:46,563 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 159 selfloop transitions, 11 changer transitions 0/175 dead transitions. [2025-03-17 14:25:46,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 175 transitions, 1269 flow [2025-03-17 14:25:46,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:25:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:25:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 303 transitions. [2025-03-17 14:25:46,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.562152133580705 [2025-03-17 14:25:46,565 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 374 flow. Second operand 11 states and 303 transitions. [2025-03-17 14:25:46,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 175 transitions, 1269 flow [2025-03-17 14:25:46,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 175 transitions, 1258 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:25:46,573 INFO L231 Difference]: Finished difference. Result has 81 places, 65 transitions, 404 flow [2025-03-17 14:25:46,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=404, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2025-03-17 14:25:46,574 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 33 predicate places. [2025-03-17 14:25:46,574 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 404 flow [2025-03-17 14:25:46,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 19.5) internal successors, (312), 16 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:46,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:46,574 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:46,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:25:46,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:46,775 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:46,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash 956509931, now seen corresponding path program 2 times [2025-03-17 14:25:46,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:46,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107710774] [2025-03-17 14:25:46,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:25:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:46,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 14:25:46,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:25:46,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:25:46,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:25:46,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:46,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107710774] [2025-03-17 14:25:46,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107710774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:46,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493053176] [2025-03-17 14:25:46,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:25:46,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:46,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:46,970 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:25:46,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:25:47,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 14:25:47,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:25:47,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:25:47,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:47,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:25:47,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:47,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-17 14:25:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:25:47,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:25:47,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493053176] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:25:47,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:25:47,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-03-17 14:25:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29176124] [2025-03-17 14:25:47,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:25:47,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:25:47,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:47,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:25:47,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:25:47,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2025-03-17 14:25:47,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 65 transitions, 404 flow. Second operand has 16 states, 16 states have (on average 20.625) internal successors, (330), 16 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:47,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:47,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2025-03-17 14:25:47,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:48,381 INFO L124 PetriNetUnfolderBase]: 1778/2878 cut-off events. [2025-03-17 14:25:48,381 INFO L125 PetriNetUnfolderBase]: For 4155/4155 co-relation queries the response was YES. [2025-03-17 14:25:48,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10086 conditions, 2878 events. 1778/2878 cut-off events. For 4155/4155 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 14406 event pairs, 229 based on Foata normal form. 68/2928 useless extension candidates. Maximal degree in co-relation 8242. Up to 974 conditions per place. [2025-03-17 14:25:48,396 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 110 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2025-03-17 14:25:48,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 124 transitions, 992 flow [2025-03-17 14:25:48,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:25:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:25:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 190 transitions. [2025-03-17 14:25:48,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5539358600583091 [2025-03-17 14:25:48,398 INFO L175 Difference]: Start difference. First operand has 81 places, 65 transitions, 404 flow. Second operand 7 states and 190 transitions. [2025-03-17 14:25:48,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 124 transitions, 992 flow [2025-03-17 14:25:48,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 124 transitions, 942 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-17 14:25:48,403 INFO L231 Difference]: Finished difference. Result has 80 places, 65 transitions, 392 flow [2025-03-17 14:25:48,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=392, PETRI_PLACES=80, PETRI_TRANSITIONS=65} [2025-03-17 14:25:48,404 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 32 predicate places. [2025-03-17 14:25:48,404 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 65 transitions, 392 flow [2025-03-17 14:25:48,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 20.625) internal successors, (330), 16 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:48,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:48,404 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-17 14:25:48,410 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-17 14:25:48,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:48,608 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:48,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:48,608 INFO L85 PathProgramCache]: Analyzing trace with hash 680243705, now seen corresponding path program 1 times [2025-03-17 14:25:48,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:48,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825343523] [2025-03-17 14:25:48,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:48,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:25:48,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:25:48,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:48,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:48,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:48,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825343523] [2025-03-17 14:25:48,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825343523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:48,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803562024] [2025-03-17 14:25:48,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:48,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:48,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:48,685 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:25:48,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:25:48,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:25:48,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:25:48,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:48,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:48,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:25:48,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:48,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:48,830 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-17 14:25:48,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803562024] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:48,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:25:48,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-17 14:25:48,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254471581] [2025-03-17 14:25:48,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:48,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:25:48,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:48,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:25:48,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:25:48,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-17 14:25:48,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 65 transitions, 392 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:48,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:48,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-17 14:25:48,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:49,039 INFO L124 PetriNetUnfolderBase]: 1670/2706 cut-off events. [2025-03-17 14:25:49,040 INFO L125 PetriNetUnfolderBase]: For 4224/4224 co-relation queries the response was YES. [2025-03-17 14:25:49,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9341 conditions, 2706 events. 1670/2706 cut-off events. For 4224/4224 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 13289 event pairs, 955 based on Foata normal form. 61/2749 useless extension candidates. Maximal degree in co-relation 7731. Up to 2126 conditions per place. [2025-03-17 14:25:49,050 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 69 selfloop transitions, 8 changer transitions 0/83 dead transitions. [2025-03-17 14:25:49,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 83 transitions, 652 flow [2025-03-17 14:25:49,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:25:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:25:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-03-17 14:25:49,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5836734693877551 [2025-03-17 14:25:49,051 INFO L175 Difference]: Start difference. First operand has 80 places, 65 transitions, 392 flow. Second operand 5 states and 143 transitions. [2025-03-17 14:25:49,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 83 transitions, 652 flow [2025-03-17 14:25:49,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 83 transitions, 636 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-17 14:25:49,056 INFO L231 Difference]: Finished difference. Result has 80 places, 64 transitions, 392 flow [2025-03-17 14:25:49,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=392, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2025-03-17 14:25:49,057 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 32 predicate places. [2025-03-17 14:25:49,057 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 392 flow [2025-03-17 14:25:49,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:49,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:49,057 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-17 14:25:49,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:25:49,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 14:25:49,258 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:49,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1165506440, now seen corresponding path program 1 times [2025-03-17 14:25:49,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:49,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354634405] [2025-03-17 14:25:49,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:49,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:49,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:25:49,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:25:49,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:49,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:25:49,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:49,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354634405] [2025-03-17 14:25:49,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354634405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:49,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662980914] [2025-03-17 14:25:49,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:49,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:49,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:49,421 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:25:49,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:25:49,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:25:49,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:25:49,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:49,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:49,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:25:49,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:49,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:49,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662980914] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:49,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:25:49,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-17 14:25:49,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055259319] [2025-03-17 14:25:49,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:49,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:25:49,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:49,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:25:49,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:25:49,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-17 14:25:49,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 392 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:49,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:49,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-17 14:25:49,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:49,718 INFO L124 PetriNetUnfolderBase]: 1546/2482 cut-off events. [2025-03-17 14:25:49,718 INFO L125 PetriNetUnfolderBase]: For 3691/3691 co-relation queries the response was YES. [2025-03-17 14:25:49,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8858 conditions, 2482 events. 1546/2482 cut-off events. For 3691/3691 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 11665 event pairs, 835 based on Foata normal form. 46/2518 useless extension candidates. Maximal degree in co-relation 7468. Up to 1844 conditions per place. [2025-03-17 14:25:49,729 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 67 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2025-03-17 14:25:49,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 82 transitions, 653 flow [2025-03-17 14:25:49,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:25:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:25:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2025-03-17 14:25:49,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5877551020408164 [2025-03-17 14:25:49,733 INFO L175 Difference]: Start difference. First operand has 80 places, 64 transitions, 392 flow. Second operand 5 states and 144 transitions. [2025-03-17 14:25:49,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 82 transitions, 653 flow [2025-03-17 14:25:49,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 82 transitions, 629 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 14:25:49,739 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 408 flow [2025-03-17 14:25:49,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=408, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2025-03-17 14:25:49,739 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 32 predicate places. [2025-03-17 14:25:49,739 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 408 flow [2025-03-17 14:25:49,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:49,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:49,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:49,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:25:49,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:25:49,944 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:49,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1794610382, now seen corresponding path program 1 times [2025-03-17 14:25:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:49,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314853373] [2025-03-17 14:25:49,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:49,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:25:49,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:25:49,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:49,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:50,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:50,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314853373] [2025-03-17 14:25:50,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314853373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:50,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56326566] [2025-03-17 14:25:50,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:50,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:50,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:50,407 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:25:50,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:25:50,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:25:50,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:25:50,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:50,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:50,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 14:25:50,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:50,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 14:25:50,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 14:25:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:50,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:25:50,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56326566] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:50,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:25:50,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 9] total 24 [2025-03-17 14:25:50,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708350996] [2025-03-17 14:25:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:50,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:25:50,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:50,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:25:50,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-03-17 14:25:50,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-17 14:25:50,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 408 flow. Second operand has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:50,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:50,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-17 14:25:50,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:51,498 INFO L124 PetriNetUnfolderBase]: 2249/3655 cut-off events. [2025-03-17 14:25:51,498 INFO L125 PetriNetUnfolderBase]: For 7693/7693 co-relation queries the response was YES. [2025-03-17 14:25:51,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13610 conditions, 3655 events. 2249/3655 cut-off events. For 7693/7693 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 19163 event pairs, 204 based on Foata normal form. 2/3641 useless extension candidates. Maximal degree in co-relation 11807. Up to 2076 conditions per place. [2025-03-17 14:25:51,516 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 134 selfloop transitions, 46 changer transitions 3/192 dead transitions. [2025-03-17 14:25:51,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 192 transitions, 1531 flow [2025-03-17 14:25:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:25:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:25:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 352 transitions. [2025-03-17 14:25:51,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7183673469387755 [2025-03-17 14:25:51,518 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 408 flow. Second operand 10 states and 352 transitions. [2025-03-17 14:25:51,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 192 transitions, 1531 flow [2025-03-17 14:25:51,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 192 transitions, 1500 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-17 14:25:51,531 INFO L231 Difference]: Finished difference. Result has 93 places, 107 transitions, 927 flow [2025-03-17 14:25:51,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=927, PETRI_PLACES=93, PETRI_TRANSITIONS=107} [2025-03-17 14:25:51,532 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 45 predicate places. [2025-03-17 14:25:51,532 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 107 transitions, 927 flow [2025-03-17 14:25:51,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:51,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:51,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:51,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 14:25:51,733 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,SelfDestructingSolverStorable15 [2025-03-17 14:25:51,733 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:51,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1121517382, now seen corresponding path program 2 times [2025-03-17 14:25:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:51,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468582968] [2025-03-17 14:25:51,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:25:51,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:51,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:25:51,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-03-17 14:25:51,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:25:51,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:25:52,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:52,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468582968] [2025-03-17 14:25:52,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468582968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:52,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:52,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:25:52,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333806463] [2025-03-17 14:25:52,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:52,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:25:52,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:52,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:25:52,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:25:52,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-17 14:25:52,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 107 transitions, 927 flow. Second operand has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:52,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:52,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-17 14:25:52,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:52,769 INFO L124 PetriNetUnfolderBase]: 3336/5358 cut-off events. [2025-03-17 14:25:52,769 INFO L125 PetriNetUnfolderBase]: For 16111/16111 co-relation queries the response was YES. [2025-03-17 14:25:52,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23685 conditions, 5358 events. 3336/5358 cut-off events. For 16111/16111 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 29794 event pairs, 420 based on Foata normal form. 2/5340 useless extension candidates. Maximal degree in co-relation 20879. Up to 2972 conditions per place. [2025-03-17 14:25:52,799 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 166 selfloop transitions, 120 changer transitions 6/301 dead transitions. [2025-03-17 14:25:52,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 301 transitions, 3096 flow [2025-03-17 14:25:52,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:25:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:25:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 401 transitions. [2025-03-17 14:25:52,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6819727891156463 [2025-03-17 14:25:52,801 INFO L175 Difference]: Start difference. First operand has 93 places, 107 transitions, 927 flow. Second operand 12 states and 401 transitions. [2025-03-17 14:25:52,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 301 transitions, 3096 flow [2025-03-17 14:25:52,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 301 transitions, 3048 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-03-17 14:25:52,839 INFO L231 Difference]: Finished difference. Result has 111 places, 222 transitions, 2555 flow [2025-03-17 14:25:52,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2555, PETRI_PLACES=111, PETRI_TRANSITIONS=222} [2025-03-17 14:25:52,839 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 63 predicate places. [2025-03-17 14:25:52,840 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 222 transitions, 2555 flow [2025-03-17 14:25:52,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:52,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:52,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:52,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:25:52,841 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:52,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1521014692, now seen corresponding path program 3 times [2025-03-17 14:25:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:52,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040230450] [2025-03-17 14:25:52,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:25:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:52,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-17 14:25:52,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-03-17 14:25:52,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:25:52,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:25:53,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:53,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040230450] [2025-03-17 14:25:53,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040230450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:53,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:53,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:25:53,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70195152] [2025-03-17 14:25:53,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:53,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:25:53,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:53,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:25:53,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:25:53,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-17 14:25:53,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 222 transitions, 2555 flow. Second operand has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:53,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:53,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-17 14:25:53,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:54,051 INFO L124 PetriNetUnfolderBase]: 4130/6585 cut-off events. [2025-03-17 14:25:54,051 INFO L125 PetriNetUnfolderBase]: For 28908/28908 co-relation queries the response was YES. [2025-03-17 14:25:54,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33095 conditions, 6585 events. 4130/6585 cut-off events. For 28908/28908 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 37820 event pairs, 466 based on Foata normal form. 2/6569 useless extension candidates. Maximal degree in co-relation 29760. Up to 2994 conditions per place. [2025-03-17 14:25:54,133 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 160 selfloop transitions, 196 changer transitions 21/386 dead transitions. [2025-03-17 14:25:54,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 386 transitions, 4812 flow [2025-03-17 14:25:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:25:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:25:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 454 transitions. [2025-03-17 14:25:54,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6618075801749271 [2025-03-17 14:25:54,134 INFO L175 Difference]: Start difference. First operand has 111 places, 222 transitions, 2555 flow. Second operand 14 states and 454 transitions. [2025-03-17 14:25:54,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 386 transitions, 4812 flow [2025-03-17 14:25:54,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 386 transitions, 4682 flow, removed 61 selfloop flow, removed 1 redundant places. [2025-03-17 14:25:54,216 INFO L231 Difference]: Finished difference. Result has 130 places, 285 transitions, 3916 flow [2025-03-17 14:25:54,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2451, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3916, PETRI_PLACES=130, PETRI_TRANSITIONS=285} [2025-03-17 14:25:54,218 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 82 predicate places. [2025-03-17 14:25:54,218 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 285 transitions, 3916 flow [2025-03-17 14:25:54,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:54,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:54,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:54,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:25:54,218 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:54,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash -404474946, now seen corresponding path program 1 times [2025-03-17 14:25:54,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:54,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295978408] [2025-03-17 14:25:54,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:54,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:54,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:25:54,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:25:54,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:54,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:54,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:54,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295978408] [2025-03-17 14:25:54,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295978408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:54,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174706743] [2025-03-17 14:25:54,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:25:54,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:54,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:54,637 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:25:54,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:25:54,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:25:54,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:25:54,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:25:54,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:54,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 14:25:54,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:54,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 14:25:54,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 14:25:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:25:54,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:25:55,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174706743] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:55,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:25:55,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 8] total 21 [2025-03-17 14:25:55,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276932676] [2025-03-17 14:25:55,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:55,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:25:55,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:55,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:25:55,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-17 14:25:55,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-17 14:25:55,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 285 transitions, 3916 flow. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:55,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:55,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-17 14:25:55,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:56,054 INFO L124 PetriNetUnfolderBase]: 4351/6961 cut-off events. [2025-03-17 14:25:56,055 INFO L125 PetriNetUnfolderBase]: For 43508/43508 co-relation queries the response was YES. [2025-03-17 14:25:56,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38437 conditions, 6961 events. 4351/6961 cut-off events. For 43508/43508 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 40570 event pairs, 570 based on Foata normal form. 2/6949 useless extension candidates. Maximal degree in co-relation 35989. Up to 4729 conditions per place. [2025-03-17 14:25:56,094 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 298 selfloop transitions, 78 changer transitions 3/388 dead transitions. [2025-03-17 14:25:56,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 388 transitions, 5614 flow [2025-03-17 14:25:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:25:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:25:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 290 transitions. [2025-03-17 14:25:56,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7397959183673469 [2025-03-17 14:25:56,095 INFO L175 Difference]: Start difference. First operand has 130 places, 285 transitions, 3916 flow. Second operand 8 states and 290 transitions. [2025-03-17 14:25:56,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 388 transitions, 5614 flow [2025-03-17 14:25:56,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 388 transitions, 5435 flow, removed 62 selfloop flow, removed 3 redundant places. [2025-03-17 14:25:56,212 INFO L231 Difference]: Finished difference. Result has 137 places, 296 transitions, 4164 flow [2025-03-17 14:25:56,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3766, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4164, PETRI_PLACES=137, PETRI_TRANSITIONS=296} [2025-03-17 14:25:56,212 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 89 predicate places. [2025-03-17 14:25:56,212 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 296 transitions, 4164 flow [2025-03-17 14:25:56,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:56,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:56,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:56,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 14:25:56,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:56,413 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:56,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:56,417 INFO L85 PathProgramCache]: Analyzing trace with hash -258029732, now seen corresponding path program 2 times [2025-03-17 14:25:56,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:56,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430551352] [2025-03-17 14:25:56,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:25:56,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:56,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:25:56,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-03-17 14:25:56,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:25:56,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:25:56,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:56,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430551352] [2025-03-17 14:25:56,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430551352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:25:56,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:25:56,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:25:56,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700621824] [2025-03-17 14:25:56,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:56,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:25:56,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:56,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:25:56,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:25:56,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-17 14:25:56,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 296 transitions, 4164 flow. Second operand has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:56,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:56,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-17 14:25:56,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:25:57,612 INFO L124 PetriNetUnfolderBase]: 4879/7809 cut-off events. [2025-03-17 14:25:57,613 INFO L125 PetriNetUnfolderBase]: For 55678/55678 co-relation queries the response was YES. [2025-03-17 14:25:57,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44699 conditions, 7809 events. 4879/7809 cut-off events. For 55678/55678 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 46188 event pairs, 710 based on Foata normal form. 2/7791 useless extension candidates. Maximal degree in co-relation 42286. Up to 3811 conditions per place. [2025-03-17 14:25:57,660 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 184 selfloop transitions, 177 changer transitions 18/388 dead transitions. [2025-03-17 14:25:57,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 388 transitions, 5718 flow [2025-03-17 14:25:57,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:25:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:25:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 346 transitions. [2025-03-17 14:25:57,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7061224489795919 [2025-03-17 14:25:57,661 INFO L175 Difference]: Start difference. First operand has 137 places, 296 transitions, 4164 flow. Second operand 10 states and 346 transitions. [2025-03-17 14:25:57,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 388 transitions, 5718 flow [2025-03-17 14:25:57,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 388 transitions, 5613 flow, removed 37 selfloop flow, removed 3 redundant places. [2025-03-17 14:25:57,796 INFO L231 Difference]: Finished difference. Result has 145 places, 303 transitions, 4616 flow [2025-03-17 14:25:57,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4074, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4616, PETRI_PLACES=145, PETRI_TRANSITIONS=303} [2025-03-17 14:25:57,797 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 97 predicate places. [2025-03-17 14:25:57,797 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 303 transitions, 4616 flow [2025-03-17 14:25:57,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:57,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:25:57,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:25:57,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:25:57,797 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:25:57,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:25:57,798 INFO L85 PathProgramCache]: Analyzing trace with hash 427124274, now seen corresponding path program 4 times [2025-03-17 14:25:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:25:57,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182385149] [2025-03-17 14:25:57,798 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:25:57,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:25:57,803 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:25:57,810 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:25:57,810 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:25:57,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:58,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:25:58,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182385149] [2025-03-17 14:25:58,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182385149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:58,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254770834] [2025-03-17 14:25:58,219 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:25:58,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:25:58,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:25:58,221 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:25:58,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:25:58,264 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:25:58,285 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:25:58,285 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:25:58,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:25:58,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 14:25:58,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:25:58,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 14:25:58,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 14:25:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:25:58,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:25:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:25:58,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254770834] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:25:58,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:25:58,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 10] total 25 [2025-03-17 14:25:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551515095] [2025-03-17 14:25:58,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:25:58,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:25:58,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:25:58,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:25:58,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2025-03-17 14:25:58,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-17 14:25:58,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 303 transitions, 4616 flow. Second operand has 9 states, 9 states have (on average 23.444444444444443) internal successors, (211), 9 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:25:58,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:25:58,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-17 14:25:58,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:00,227 INFO L124 PetriNetUnfolderBase]: 6065/9521 cut-off events. [2025-03-17 14:26:00,227 INFO L125 PetriNetUnfolderBase]: For 75782/75782 co-relation queries the response was YES. [2025-03-17 14:26:00,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55923 conditions, 9521 events. 6065/9521 cut-off events. For 75782/75782 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 56484 event pairs, 819 based on Foata normal form. 2/9513 useless extension candidates. Maximal degree in co-relation 55025. Up to 5506 conditions per place. [2025-03-17 14:26:00,302 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 287 selfloop transitions, 157 changer transitions 9/460 dead transitions. [2025-03-17 14:26:00,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 460 transitions, 7074 flow [2025-03-17 14:26:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:26:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:26:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 381 transitions. [2025-03-17 14:26:00,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7068645640074211 [2025-03-17 14:26:00,303 INFO L175 Difference]: Start difference. First operand has 145 places, 303 transitions, 4616 flow. Second operand 11 states and 381 transitions. [2025-03-17 14:26:00,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 460 transitions, 7074 flow [2025-03-17 14:26:00,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 460 transitions, 6845 flow, removed 34 selfloop flow, removed 6 redundant places. [2025-03-17 14:26:00,544 INFO L231 Difference]: Finished difference. Result has 154 places, 343 transitions, 5500 flow [2025-03-17 14:26:00,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4426, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5500, PETRI_PLACES=154, PETRI_TRANSITIONS=343} [2025-03-17 14:26:00,544 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 106 predicate places. [2025-03-17 14:26:00,544 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 343 transitions, 5500 flow [2025-03-17 14:26:00,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.444444444444443) internal successors, (211), 9 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:00,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:00,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:00,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 14:26:00,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 14:26:00,745 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:26:00,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:00,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1710109524, now seen corresponding path program 3 times [2025-03-17 14:26:00,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:00,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102722684] [2025-03-17 14:26:00,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:26:00,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:00,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-17 14:26:00,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-03-17 14:26:00,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:26:00,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:26:01,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:01,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102722684] [2025-03-17 14:26:01,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102722684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:01,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:01,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:26:01,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762759910] [2025-03-17 14:26:01,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:01,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:26:01,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:01,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:26:01,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:26:01,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-17 14:26:01,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 343 transitions, 5500 flow. Second operand has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:01,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:01,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-17 14:26:01,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:02,298 INFO L124 PetriNetUnfolderBase]: 5730/9244 cut-off events. [2025-03-17 14:26:02,298 INFO L125 PetriNetUnfolderBase]: For 98827/98827 co-relation queries the response was YES. [2025-03-17 14:26:02,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59232 conditions, 9244 events. 5730/9244 cut-off events. For 98827/98827 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 57456 event pairs, 917 based on Foata normal form. 2/9230 useless extension candidates. Maximal degree in co-relation 58352. Up to 5952 conditions per place. [2025-03-17 14:26:02,373 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 312 selfloop transitions, 120 changer transitions 7/448 dead transitions. [2025-03-17 14:26:02,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 448 transitions, 7538 flow [2025-03-17 14:26:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:26:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:26:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 343 transitions. [2025-03-17 14:26:02,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-17 14:26:02,374 INFO L175 Difference]: Start difference. First operand has 154 places, 343 transitions, 5500 flow. Second operand 10 states and 343 transitions. [2025-03-17 14:26:02,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 448 transitions, 7538 flow [2025-03-17 14:26:02,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 448 transitions, 7252 flow, removed 126 selfloop flow, removed 4 redundant places. [2025-03-17 14:26:02,733 INFO L231 Difference]: Finished difference. Result has 164 places, 372 transitions, 6176 flow [2025-03-17 14:26:02,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5241, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6176, PETRI_PLACES=164, PETRI_TRANSITIONS=372} [2025-03-17 14:26:02,733 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 116 predicate places. [2025-03-17 14:26:02,733 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 372 transitions, 6176 flow [2025-03-17 14:26:02,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:02,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:02,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:02,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 14:26:02,734 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:26:02,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:02,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1052782756, now seen corresponding path program 4 times [2025-03-17 14:26:02,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:02,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744186530] [2025-03-17 14:26:02,734 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:26:02,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:02,739 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:26:02,750 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:26:02,750 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:26:02,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:26:02,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:02,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744186530] [2025-03-17 14:26:02,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744186530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:02,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702355791] [2025-03-17 14:26:02,991 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:26:02,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:02,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:02,993 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:26:02,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:26:03,034 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:26:03,051 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:26:03,051 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:26:03,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:03,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 14:26:03,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:03,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 14:26:03,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 14:26:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:26:03,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:26:03,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702355791] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:03,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:26:03,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 16 [2025-03-17 14:26:03,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774138103] [2025-03-17 14:26:03,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:03,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:26:03,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:03,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:26:03,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:26:03,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-17 14:26:03,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 372 transitions, 6176 flow. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:03,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:03,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-17 14:26:03,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:04,678 INFO L124 PetriNetUnfolderBase]: 6236/10022 cut-off events. [2025-03-17 14:26:04,679 INFO L125 PetriNetUnfolderBase]: For 127956/127956 co-relation queries the response was YES. [2025-03-17 14:26:04,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67510 conditions, 10022 events. 6236/10022 cut-off events. For 127956/127956 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 63040 event pairs, 1020 based on Foata normal form. 2/10008 useless extension candidates. Maximal degree in co-relation 66591. Up to 6526 conditions per place. [2025-03-17 14:26:04,760 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 318 selfloop transitions, 125 changer transitions 9/461 dead transitions. [2025-03-17 14:26:04,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 461 transitions, 8184 flow [2025-03-17 14:26:04,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:26:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:26:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 285 transitions. [2025-03-17 14:26:04,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7270408163265306 [2025-03-17 14:26:04,761 INFO L175 Difference]: Start difference. First operand has 164 places, 372 transitions, 6176 flow. Second operand 8 states and 285 transitions. [2025-03-17 14:26:04,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 461 transitions, 8184 flow [2025-03-17 14:26:05,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 461 transitions, 7990 flow, removed 77 selfloop flow, removed 3 redundant places. [2025-03-17 14:26:05,068 INFO L231 Difference]: Finished difference. Result has 171 places, 394 transitions, 6885 flow [2025-03-17 14:26:05,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5982, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6885, PETRI_PLACES=171, PETRI_TRANSITIONS=394} [2025-03-17 14:26:05,069 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 123 predicate places. [2025-03-17 14:26:05,069 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 394 transitions, 6885 flow [2025-03-17 14:26:05,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:05,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:05,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:05,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 14:26:05,269 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,SelfDestructingSolverStorable22 [2025-03-17 14:26:05,269 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:26:05,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:05,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1452280066, now seen corresponding path program 5 times [2025-03-17 14:26:05,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:05,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836513397] [2025-03-17 14:26:05,270 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:26:05,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:05,278 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-03-17 14:26:05,284 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:26:05,284 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 14:26:05,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:26:05,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:05,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836513397] [2025-03-17 14:26:05,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836513397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:05,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:05,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 14:26:05,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268515409] [2025-03-17 14:26:05,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:05,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:26:05,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:05,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:26:05,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:26:05,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-17 14:26:05,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 394 transitions, 6885 flow. Second operand has 12 states, 12 states have (on average 23.75) internal successors, (285), 12 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-17 14:26:05,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:05,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-17 14:26:05,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:07,772 INFO L124 PetriNetUnfolderBase]: 6731/10797 cut-off events. [2025-03-17 14:26:07,773 INFO L125 PetriNetUnfolderBase]: For 156510/156510 co-relation queries the response was YES. [2025-03-17 14:26:07,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75300 conditions, 10797 events. 6731/10797 cut-off events. For 156510/156510 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 68407 event pairs, 947 based on Foata normal form. 2/10793 useless extension candidates. Maximal degree in co-relation 74359. Up to 6660 conditions per place. [2025-03-17 14:26:07,882 INFO L140 encePairwiseOnDemand]: 33/49 looper letters, 342 selfloop transitions, 180 changer transitions 9/540 dead transitions. [2025-03-17 14:26:07,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 540 transitions, 9832 flow [2025-03-17 14:26:07,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:26:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:26:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 447 transitions. [2025-03-17 14:26:07,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6516034985422741 [2025-03-17 14:26:07,883 INFO L175 Difference]: Start difference. First operand has 171 places, 394 transitions, 6885 flow. Second operand 14 states and 447 transitions. [2025-03-17 14:26:07,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 540 transitions, 9832 flow [2025-03-17 14:26:08,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 540 transitions, 9534 flow, removed 91 selfloop flow, removed 4 redundant places. [2025-03-17 14:26:08,407 INFO L231 Difference]: Finished difference. Result has 189 places, 442 transitions, 8125 flow [2025-03-17 14:26:08,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6670, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8125, PETRI_PLACES=189, PETRI_TRANSITIONS=442} [2025-03-17 14:26:08,407 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 141 predicate places. [2025-03-17 14:26:08,407 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 442 transitions, 8125 flow [2025-03-17 14:26:08,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.75) internal successors, (285), 12 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-17 14:26:08,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:08,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:08,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 14:26:08,408 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:26:08,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:08,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1296615190, now seen corresponding path program 1 times [2025-03-17 14:26:08,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:08,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561271069] [2025-03-17 14:26:08,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:08,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:08,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:26:08,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:26:08,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:08,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:26:08,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:08,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561271069] [2025-03-17 14:26:08,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561271069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:08,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937570924] [2025-03-17 14:26:08,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:08,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:08,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:08,679 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:26:08,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 14:26:08,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:26:08,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:26:08,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:08,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:08,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 14:26:08,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:08,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 14:26:08,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 14:26:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:26:08,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:26:08,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937570924] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:26:08,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:26:08,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 19 [2025-03-17 14:26:08,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680228353] [2025-03-17 14:26:08,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:26:08,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 14:26:08,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:08,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 14:26:08,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-17 14:26:09,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-17 14:26:09,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 442 transitions, 8125 flow. Second operand has 19 states, 19 states have (on average 23.842105263157894) internal successors, (453), 19 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:09,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:09,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-17 14:26:09,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:11,238 INFO L124 PetriNetUnfolderBase]: 8272/12910 cut-off events. [2025-03-17 14:26:11,238 INFO L125 PetriNetUnfolderBase]: For 200669/200669 co-relation queries the response was YES. [2025-03-17 14:26:11,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91782 conditions, 12910 events. 8272/12910 cut-off events. For 200669/200669 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 79392 event pairs, 1036 based on Foata normal form. 2/12907 useless extension candidates. Maximal degree in co-relation 90727. Up to 6541 conditions per place. [2025-03-17 14:26:11,349 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 328 selfloop transitions, 238 changer transitions 14/587 dead transitions. [2025-03-17 14:26:11,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 587 transitions, 10933 flow [2025-03-17 14:26:11,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:26:11,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 14:26:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 427 transitions. [2025-03-17 14:26:11,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6703296703296703 [2025-03-17 14:26:11,350 INFO L175 Difference]: Start difference. First operand has 189 places, 442 transitions, 8125 flow. Second operand 13 states and 427 transitions. [2025-03-17 14:26:11,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 587 transitions, 10933 flow [2025-03-17 14:26:11,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 587 transitions, 10770 flow, removed 55 selfloop flow, removed 2 redundant places. [2025-03-17 14:26:11,924 INFO L231 Difference]: Finished difference. Result has 202 places, 463 transitions, 9149 flow [2025-03-17 14:26:11,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=7976, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9149, PETRI_PLACES=202, PETRI_TRANSITIONS=463} [2025-03-17 14:26:11,924 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 154 predicate places. [2025-03-17 14:26:11,925 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 463 transitions, 9149 flow [2025-03-17 14:26:11,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.842105263157894) internal successors, (453), 19 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:11,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:11,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:11,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 14:26:12,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:12,125 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:26:12,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1233741544, now seen corresponding path program 2 times [2025-03-17 14:26:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:12,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323020215] [2025-03-17 14:26:12,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:26:12,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:12,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:26:12,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-03-17 14:26:12,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:26:12,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:26:12,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323020215] [2025-03-17 14:26:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323020215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:12,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:12,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 14:26:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91323863] [2025-03-17 14:26:12,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:12,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:26:12,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:12,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:26:12,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:26:12,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-17 14:26:12,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 463 transitions, 9149 flow. Second operand has 12 states, 12 states have (on average 23.75) internal successors, (285), 12 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-17 14:26:12,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:12,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-17 14:26:12,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:14,355 INFO L124 PetriNetUnfolderBase]: 7299/11699 cut-off events. [2025-03-17 14:26:14,355 INFO L125 PetriNetUnfolderBase]: For 218383/218383 co-relation queries the response was YES. [2025-03-17 14:26:14,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88418 conditions, 11699 events. 7299/11699 cut-off events. For 218383/218383 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 75424 event pairs, 1137 based on Foata normal form. 2/11685 useless extension candidates. Maximal degree in co-relation 87449. Up to 7660 conditions per place. [2025-03-17 14:26:14,491 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 349 selfloop transitions, 234 changer transitions 13/605 dead transitions. [2025-03-17 14:26:14,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 605 transitions, 12358 flow [2025-03-17 14:26:14,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:26:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:26:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 452 transitions. [2025-03-17 14:26:14,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6588921282798834 [2025-03-17 14:26:14,492 INFO L175 Difference]: Start difference. First operand has 202 places, 463 transitions, 9149 flow. Second operand 14 states and 452 transitions. [2025-03-17 14:26:14,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 605 transitions, 12358 flow [2025-03-17 14:26:15,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 605 transitions, 12119 flow, removed 79 selfloop flow, removed 7 redundant places. [2025-03-17 14:26:15,114 INFO L231 Difference]: Finished difference. Result has 219 places, 513 transitions, 10879 flow [2025-03-17 14:26:15,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8938, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10879, PETRI_PLACES=219, PETRI_TRANSITIONS=513} [2025-03-17 14:26:15,115 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 171 predicate places. [2025-03-17 14:26:15,115 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 513 transitions, 10879 flow [2025-03-17 14:26:15,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.75) internal successors, (285), 12 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-17 14:26:15,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:15,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:15,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 14:26:15,115 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:26:15,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:15,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1155675492, now seen corresponding path program 3 times [2025-03-17 14:26:15,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:15,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901715014] [2025-03-17 14:26:15,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:26:15,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:15,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-17 14:26:15,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-03-17 14:26:15,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:26:15,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:26:15,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:15,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901715014] [2025-03-17 14:26:15,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901715014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:26:15,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:26:15,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 14:26:15,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233847462] [2025-03-17 14:26:15,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:15,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:26:15,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:15,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:26:15,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:26:15,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-17 14:26:15,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 513 transitions, 10879 flow. Second operand has 11 states, 11 states have (on average 23.90909090909091) internal successors, (263), 11 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:15,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:15,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-17 14:26:15,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:17,352 INFO L124 PetriNetUnfolderBase]: 7754/12411 cut-off events. [2025-03-17 14:26:17,352 INFO L125 PetriNetUnfolderBase]: For 246904/246904 co-relation queries the response was YES. [2025-03-17 14:26:17,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97495 conditions, 12411 events. 7754/12411 cut-off events. For 246904/246904 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 80509 event pairs, 1090 based on Foata normal form. 2/12397 useless extension candidates. Maximal degree in co-relation 96415. Up to 6883 conditions per place. [2025-03-17 14:26:17,499 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 308 selfloop transitions, 269 changer transitions 26/611 dead transitions. [2025-03-17 14:26:17,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 611 transitions, 13351 flow [2025-03-17 14:26:17,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:26:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:26:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 396 transitions. [2025-03-17 14:26:17,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2025-03-17 14:26:17,500 INFO L175 Difference]: Start difference. First operand has 219 places, 513 transitions, 10879 flow. Second operand 12 states and 396 transitions. [2025-03-17 14:26:17,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 611 transitions, 13351 flow [2025-03-17 14:26:18,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 611 transitions, 13095 flow, removed 90 selfloop flow, removed 3 redundant places. [2025-03-17 14:26:18,318 INFO L231 Difference]: Finished difference. Result has 231 places, 515 transitions, 11513 flow [2025-03-17 14:26:18,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=10637, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11513, PETRI_PLACES=231, PETRI_TRANSITIONS=515} [2025-03-17 14:26:18,319 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 183 predicate places. [2025-03-17 14:26:18,319 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 515 transitions, 11513 flow [2025-03-17 14:26:18,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.90909090909091) internal successors, (263), 11 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:18,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:18,319 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:18,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 14:26:18,319 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:26:18,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:18,320 INFO L85 PathProgramCache]: Analyzing trace with hash 567817884, now seen corresponding path program 1 times [2025-03-17 14:26:18,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:18,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070875603] [2025-03-17 14:26:18,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:18,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:18,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 14:26:18,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:26:18,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:18,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:26:18,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070875603] [2025-03-17 14:26:18,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070875603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:18,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519997381] [2025-03-17 14:26:18,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:26:18,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:18,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:18,400 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:26:18,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 14:26:18,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 14:26:18,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:26:18,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:26:18,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:18,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:26:18,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:26:18,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:26:18,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519997381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:26:18,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:26:18,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 14:26:18,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751560620] [2025-03-17 14:26:18,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:26:18,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:26:18,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:18,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:26:18,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:26:18,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-17 14:26:18,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 515 transitions, 11513 flow. Second operand has 14 states, 14 states have (on average 24.571428571428573) internal successors, (344), 14 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:18,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:18,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-17 14:26:18,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:20,800 INFO L124 PetriNetUnfolderBase]: 8245/12626 cut-off events. [2025-03-17 14:26:20,800 INFO L125 PetriNetUnfolderBase]: For 277360/277368 co-relation queries the response was YES. [2025-03-17 14:26:20,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100490 conditions, 12626 events. 8245/12626 cut-off events. For 277360/277368 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 77541 event pairs, 945 based on Foata normal form. 228/12850 useless extension candidates. Maximal degree in co-relation 100358. Up to 4658 conditions per place. [2025-03-17 14:26:20,926 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 695 selfloop transitions, 30 changer transitions 0/730 dead transitions. [2025-03-17 14:26:20,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 730 transitions, 17228 flow [2025-03-17 14:26:20,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:26:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:26:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 263 transitions. [2025-03-17 14:26:20,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5963718820861678 [2025-03-17 14:26:20,928 INFO L175 Difference]: Start difference. First operand has 231 places, 515 transitions, 11513 flow. Second operand 9 states and 263 transitions. [2025-03-17 14:26:20,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 730 transitions, 17228 flow [2025-03-17 14:26:21,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 730 transitions, 16443 flow, removed 168 selfloop flow, removed 14 redundant places. [2025-03-17 14:26:21,731 INFO L231 Difference]: Finished difference. Result has 220 places, 486 transitions, 10074 flow [2025-03-17 14:26:21,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9974, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10074, PETRI_PLACES=220, PETRI_TRANSITIONS=486} [2025-03-17 14:26:21,731 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 172 predicate places. [2025-03-17 14:26:21,731 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 486 transitions, 10074 flow [2025-03-17 14:26:21,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 24.571428571428573) internal successors, (344), 14 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:21,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:21,732 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:21,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 14:26:21,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 14:26:21,932 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:26:21,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:21,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1491094811, now seen corresponding path program 5 times [2025-03-17 14:26:21,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:21,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848976432] [2025-03-17 14:26:21,933 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:26:21,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:21,937 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-03-17 14:26:21,943 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:26:21,943 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 14:26:21,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:22,021 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:26:22,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:22,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848976432] [2025-03-17 14:26:22,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848976432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:22,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428982685] [2025-03-17 14:26:22,022 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:26:22,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:22,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:22,026 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:26:22,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 14:26:22,072 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-03-17 14:26:22,091 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 14:26:22,091 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 14:26:22,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:22,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:26:22,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:26:22,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:26:22,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428982685] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:22,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:26:22,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-17 14:26:22,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629667288] [2025-03-17 14:26:22,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:26:22,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:26:22,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:22,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:26:22,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:26:22,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-17 14:26:22,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 486 transitions, 10074 flow. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:22,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:22,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-17 14:26:22,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:24,576 INFO L124 PetriNetUnfolderBase]: 7986/12146 cut-off events. [2025-03-17 14:26:24,576 INFO L125 PetriNetUnfolderBase]: For 250241/250241 co-relation queries the response was YES. [2025-03-17 14:26:24,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91084 conditions, 12146 events. 7986/12146 cut-off events. For 250241/250241 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 72220 event pairs, 1156 based on Foata normal form. 293/12435 useless extension candidates. Maximal degree in co-relation 90955. Up to 8198 conditions per place. [2025-03-17 14:26:24,723 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 490 selfloop transitions, 36 changer transitions 0/532 dead transitions. [2025-03-17 14:26:24,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 532 transitions, 11971 flow [2025-03-17 14:26:24,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:26:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:26:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2025-03-17 14:26:24,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5918367346938775 [2025-03-17 14:26:24,724 INFO L175 Difference]: Start difference. First operand has 220 places, 486 transitions, 10074 flow. Second operand 7 states and 203 transitions. [2025-03-17 14:26:24,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 532 transitions, 11971 flow [2025-03-17 14:26:25,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 532 transitions, 11588 flow, removed 44 selfloop flow, removed 11 redundant places. [2025-03-17 14:26:25,543 INFO L231 Difference]: Finished difference. Result has 216 places, 423 transitions, 8328 flow [2025-03-17 14:26:25,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8196, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=8328, PETRI_PLACES=216, PETRI_TRANSITIONS=423} [2025-03-17 14:26:25,544 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 168 predicate places. [2025-03-17 14:26:25,544 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 423 transitions, 8328 flow [2025-03-17 14:26:25,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:25,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:25,545 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:25,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 14:26:25,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 14:26:25,745 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:26:25,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:25,746 INFO L85 PathProgramCache]: Analyzing trace with hash 290317602, now seen corresponding path program 2 times [2025-03-17 14:26:25,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:25,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583245726] [2025-03-17 14:26:25,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:26:25,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:25,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:26:25,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:26:25,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:26:25,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:26:26,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:26,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583245726] [2025-03-17 14:26:26,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583245726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:26,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755177271] [2025-03-17 14:26:26,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:26:26,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:26,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:26,135 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:26:26,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 14:26:26,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:26:26,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:26:26,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:26:26,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:26,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 14:26:26,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:26,248 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 19 treesize of output 1 [2025-03-17 14:26:26,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:26:26,660 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 31 treesize of output 11 [2025-03-17 14:26:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:26:26,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:27,062 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 31 treesize of output 27 [2025-03-17 14:26:27,073 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:26:27,073 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 58 treesize of output 41 [2025-03-17 14:26:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:26:27,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755177271] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:26:27,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:26:27,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 38 [2025-03-17 14:26:27,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298775123] [2025-03-17 14:26:27,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:26:27,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-17 14:26:27,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:27,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 14:26:27,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1241, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 14:26:29,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2025-03-17 14:26:29,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 423 transitions, 8328 flow. Second operand has 38 states, 38 states have (on average 22.44736842105263) internal successors, (853), 38 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:29,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:26:29,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2025-03-17 14:26:29,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:26:34,185 INFO L124 PetriNetUnfolderBase]: 14473/21682 cut-off events. [2025-03-17 14:26:34,185 INFO L125 PetriNetUnfolderBase]: For 405858/405858 co-relation queries the response was YES. [2025-03-17 14:26:34,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155835 conditions, 21682 events. 14473/21682 cut-off events. For 405858/405858 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 131496 event pairs, 718 based on Foata normal form. 1/21680 useless extension candidates. Maximal degree in co-relation 155706. Up to 9663 conditions per place. [2025-03-17 14:26:34,573 INFO L140 encePairwiseOnDemand]: 33/49 looper letters, 439 selfloop transitions, 492 changer transitions 1/935 dead transitions. [2025-03-17 14:26:34,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 935 transitions, 17813 flow [2025-03-17 14:26:34,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 14:26:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-17 14:26:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1066 transitions. [2025-03-17 14:26:34,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6215743440233236 [2025-03-17 14:26:34,575 INFO L175 Difference]: Start difference. First operand has 216 places, 423 transitions, 8328 flow. Second operand 35 states and 1066 transitions. [2025-03-17 14:26:34,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 935 transitions, 17813 flow [2025-03-17 14:26:35,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 935 transitions, 17686 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 14:26:35,910 INFO L231 Difference]: Finished difference. Result has 262 places, 713 transitions, 16363 flow [2025-03-17 14:26:35,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=8260, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=16363, PETRI_PLACES=262, PETRI_TRANSITIONS=713} [2025-03-17 14:26:35,911 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 214 predicate places. [2025-03-17 14:26:35,911 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 713 transitions, 16363 flow [2025-03-17 14:26:35,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 22.44736842105263) internal successors, (853), 38 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:26:35,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:26:35,912 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:26:35,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-17 14:26:36,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:36,112 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-17 14:26:36,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:26:36,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1141807134, now seen corresponding path program 6 times [2025-03-17 14:26:36,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:26:36,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598583245] [2025-03-17 14:26:36,113 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:26:36,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:26:36,119 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-03-17 14:26:36,130 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 36 of 38 statements. [2025-03-17 14:26:36,130 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 14:26:36,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:26:36,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:26:36,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598583245] [2025-03-17 14:26:36,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598583245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:26:36,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035895759] [2025-03-17 14:26:36,491 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:26:36,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:26:36,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:26:36,493 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:26:36,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 14:26:36,692 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-03-17 14:26:36,714 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 36 of 38 statements. [2025-03-17 14:26:36,714 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 14:26:36,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:26:36,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-17 14:26:36,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:26:36,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 14:26:37,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:26:37,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 28 [2025-03-17 14:26:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:26:37,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:26:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:26:42,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035895759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:26:42,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:26:42,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 15] total 41 [2025-03-17 14:26:42,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914603747] [2025-03-17 14:26:42,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:26:42,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-17 14:26:42,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:26:42,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-17 14:26:42,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1467, Unknown=1, NotChecked=0, Total=1640 [2025-03-17 14:26:46,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:26:48,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:26:53,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:26:57,590 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 [1] [2025-03-17 14:27:01,796 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 [1] [2025-03-17 14:27:05,988 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 [1]