./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 798a7b37 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-?-798a7b3-m [2025-03-04 10:09:29,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:09:29,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:09:29,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:09:29,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:09:29,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:09:29,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:09:29,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:09:29,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:09:29,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:09:29,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:09:29,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:09:29,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:09:29,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:09:29,975 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:09:29,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:09:29,975 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:09:29,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:09:29,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:09:29,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:09:29,975 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:09:29,975 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:09:29,975 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:09:29,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:09:29,975 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:09:29,975 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:09:29,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:09:29,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:09:29,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:09:29,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:09:29,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:09:29,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:09:29,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:09:29,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:09:29,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:09:29,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:09:29,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:09:29,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:09:29,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:09:29,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:09:29,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:09:29,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:09:29,978 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-04 10:09:30,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:09:30,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:09:30,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:09:30,212 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:09:30,213 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:09:30,213 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-04 10:09:31,377 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac230115c/a9caa9e5463d420a944f707110532765/FLAG9c0bcb690 [2025-03-04 10:09:31,578 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:09:31,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-03-04 10:09:31,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac230115c/a9caa9e5463d420a944f707110532765/FLAG9c0bcb690 [2025-03-04 10:09:31,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac230115c/a9caa9e5463d420a944f707110532765 [2025-03-04 10:09:31,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:09:31,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:09:31,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:09:31,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:09:31,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:09:31,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:09:31" (1/1) ... [2025-03-04 10:09:31,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b84aff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:31, skipping insertion in model container [2025-03-04 10:09:31,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:09:31" (1/1) ... [2025-03-04 10:09:31,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:09:32,092 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-04 10:09:32,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:09:32,106 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:09:32,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:09:32,131 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:09:32,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:32 WrapperNode [2025-03-04 10:09:32,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:09:32,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:09:32,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:09:32,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:09:32,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:32" (1/1) ... [2025-03-04 10:09:32,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:32" (1/1) ... [2025-03-04 10:09:32,162 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 18, calls inlined = 32, statements flattened = 270 [2025-03-04 10:09:32,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:09:32,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:09:32,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:09:32,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:09:32,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:32" (1/1) ... [2025-03-04 10:09:32,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:32" (1/1) ... [2025-03-04 10:09:32,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:32" (1/1) ... [2025-03-04 10:09:32,183 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-04 10:09:32,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:32" (1/1) ... [2025-03-04 10:09:32,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:32" (1/1) ... [2025-03-04 10:09:32,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:32" (1/1) ... [2025-03-04 10:09:32,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:32" (1/1) ... [2025-03-04 10:09:32,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:32" (1/1) ... [2025-03-04 10:09:32,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:32" (1/1) ... [2025-03-04 10:09:32,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:09:32,193 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:09:32,193 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:09:32,193 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:09:32,194 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:32" (1/1) ... [2025-03-04 10:09:32,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:09:32,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:32,223 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-04 10:09:32,226 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-04 10:09:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:09:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:09:32,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:09:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:09:32,244 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:09:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:09:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:09:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:09:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:09:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:09:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:09:32,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:09:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:09:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:09:32,246 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:09:32,312 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:09:32,314 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:09:32,636 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:09:32,636 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:09:32,908 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:09:32,909 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:09:32,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:09:32 BoogieIcfgContainer [2025-03-04 10:09:32,910 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:09:32,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:09:32,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:09:32,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:09:32,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:09:31" (1/3) ... [2025-03-04 10:09:32,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270b536a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:09:32, skipping insertion in model container [2025-03-04 10:09:32,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:09:32" (2/3) ... [2025-03-04 10:09:32,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270b536a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:09:32, skipping insertion in model container [2025-03-04 10:09:32,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:09:32" (3/3) ... [2025-03-04 10:09:32,918 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-03-04 10:09:32,929 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:09:32,931 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-04 10:09:32,931 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:09:32,984 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:09:33,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 112 flow [2025-03-04 10:09:33,035 INFO L124 PetriNetUnfolderBase]: 5/47 cut-off events. [2025-03-04 10:09:33,038 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:09:33,042 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 113 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-04 10:09:33,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 49 transitions, 112 flow [2025-03-04 10:09:33,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 46 transitions, 104 flow [2025-03-04 10:09:33,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:09:33,065 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;@1072f9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:09:33,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-04 10:09:33,070 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:09:33,071 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:09:33,071 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:09:33,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:33,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:09:33,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:33,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:33,075 INFO L85 PathProgramCache]: Analyzing trace with hash 830906, now seen corresponding path program 1 times [2025-03-04 10:09:33,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:33,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062854518] [2025-03-04 10:09:33,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:33,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:33,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:09:33,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:09:33,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:33,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:33,290 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-04 10:09:33,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:33,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062854518] [2025-03-04 10:09:33,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062854518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:33,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:33,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:09:33,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144618966] [2025-03-04 10:09:33,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:33,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:09:33,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:33,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:09:33,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:09:33,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-04 10:09:33,335 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-04 10:09:33,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:33,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-04 10:09:33,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:33,482 INFO L124 PetriNetUnfolderBase]: 220/507 cut-off events. [2025-03-04 10:09:33,483 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 10:09:33,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 507 events. 220/507 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2751 event pairs, 130 based on Foata normal form. 1/396 useless extension candidates. Maximal degree in co-relation 806. Up to 338 conditions per place. [2025-03-04 10:09:33,489 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 23 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-03-04 10:09:33,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 148 flow [2025-03-04 10:09:33,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:09:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:09:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-04 10:09:33,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6122448979591837 [2025-03-04 10:09:33,502 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 104 flow. Second operand 3 states and 90 transitions. [2025-03-04 10:09:33,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 148 flow [2025-03-04 10:09:33,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 140 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:09:33,510 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 94 flow [2025-03-04 10:09:33,513 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-04 10:09:33,515 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2025-03-04 10:09:33,516 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 94 flow [2025-03-04 10:09:33,517 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-04 10:09:33,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:33,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:09:33,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:09:33,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:33,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:33,518 INFO L85 PathProgramCache]: Analyzing trace with hash 830907, now seen corresponding path program 1 times [2025-03-04 10:09:33,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:33,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247731393] [2025-03-04 10:09:33,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:33,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:09:33,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:09:33,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:33,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:33,793 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-04 10:09:33,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:33,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247731393] [2025-03-04 10:09:33,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247731393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:33,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:33,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:09:33,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972485997] [2025-03-04 10:09:33,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:33,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:33,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:33,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:33,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:09:33,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-04 10:09:33,828 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-04 10:09:33,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:33,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-04 10:09:33,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:33,974 INFO L124 PetriNetUnfolderBase]: 221/510 cut-off events. [2025-03-04 10:09:33,975 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:09:33,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 510 events. 221/510 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2769 event pairs, 130 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 846. Up to 343 conditions per place. [2025-03-04 10:09:33,981 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 25 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2025-03-04 10:09:33,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 160 flow [2025-03-04 10:09:33,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:09:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:09:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-04 10:09:33,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5816326530612245 [2025-03-04 10:09:33,984 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 94 flow. Second operand 4 states and 114 transitions. [2025-03-04 10:09:33,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 160 flow [2025-03-04 10:09:33,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:33,985 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 117 flow [2025-03-04 10:09:33,985 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-04 10:09:33,986 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2025-03-04 10:09:33,986 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 117 flow [2025-03-04 10:09:33,986 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-04 10:09:33,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:33,986 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:09:33,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:09:33,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:33,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:33,988 INFO L85 PathProgramCache]: Analyzing trace with hash 798528177, now seen corresponding path program 1 times [2025-03-04 10:09:33,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:33,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723398295] [2025-03-04 10:09:33,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:33,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:33,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:09:34,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:09:34,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:34,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:34,282 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-04 10:09:34,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:34,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723398295] [2025-03-04 10:09:34,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723398295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:34,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307598400] [2025-03-04 10:09:34,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:34,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:34,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:34,285 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-04 10:09:34,287 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-04 10:09:34,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:09:34,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:09:34,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:34,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:34,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:09:34,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:34,384 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-04 10:09:34,562 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-04 10:09:34,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:34,650 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-04 10:09:34,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307598400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:34,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:34,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:09:34,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080711184] [2025-03-04 10:09:34,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:34,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:09:34,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:34,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:09:34,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:09:34,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-04 10:09:34,803 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-04 10:09:34,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:34,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-04 10:09:34,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:35,093 INFO L124 PetriNetUnfolderBase]: 222/512 cut-off events. [2025-03-04 10:09:35,094 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:09:35,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 512 events. 222/512 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2782 event pairs, 130 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 853. Up to 340 conditions per place. [2025-03-04 10:09:35,097 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 21 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2025-03-04 10:09:35,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 187 flow [2025-03-04 10:09:35,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:09:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:09:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2025-03-04 10:09:35,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5127551020408163 [2025-03-04 10:09:35,101 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 117 flow. Second operand 8 states and 201 transitions. [2025-03-04 10:09:35,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 187 flow [2025-03-04 10:09:35,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:09:35,102 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 142 flow [2025-03-04 10:09:35,103 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=8, PETRI_FLOW=142, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-03-04 10:09:35,104 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2025-03-04 10:09:35,104 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 142 flow [2025-03-04 10:09:35,104 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-04 10:09:35,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:35,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:09:35,111 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-04 10:09:35,309 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-04 10:09:35,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:35,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:35,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1013039877, now seen corresponding path program 1 times [2025-03-04 10:09:35,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:35,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212638487] [2025-03-04 10:09:35,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:35,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:35,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:09:35,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:09:35,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:35,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:35,372 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-04 10:09:35,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:35,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212638487] [2025-03-04 10:09:35,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212638487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:35,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:35,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:09:35,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963655766] [2025-03-04 10:09:35,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:35,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:35,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:35,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:35,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:09:35,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-03-04 10:09:35,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:35,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:35,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-03-04 10:09:35,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:35,511 INFO L124 PetriNetUnfolderBase]: 222/443 cut-off events. [2025-03-04 10:09:35,511 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:09:35,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 443 events. 222/443 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2067 event pairs, 130 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 785. Up to 339 conditions per place. [2025-03-04 10:09:35,514 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 27 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2025-03-04 10:09:35,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 192 flow [2025-03-04 10:09:35,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:09:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:09:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-04 10:09:35,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-04 10:09:35,516 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 142 flow. Second operand 4 states and 91 transitions. [2025-03-04 10:09:35,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 192 flow [2025-03-04 10:09:35,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 150 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-04 10:09:35,518 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 96 flow [2025-03-04 10:09:35,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2025-03-04 10:09:35,520 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2025-03-04 10:09:35,520 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 96 flow [2025-03-04 10:09:35,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:35,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:35,520 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:09:35,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:09:35,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:35,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:35,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1013039876, now seen corresponding path program 1 times [2025-03-04 10:09:35,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:35,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064257212] [2025-03-04 10:09:35,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:35,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:35,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:09:35,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:09:35,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:35,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:35,596 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-04 10:09:35,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:35,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064257212] [2025-03-04 10:09:35,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064257212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:35,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:35,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:09:35,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342259257] [2025-03-04 10:09:35,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:35,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:35,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:35,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:35,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:09:35,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-04 10:09:35,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 96 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-04 10:09:35,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:35,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-04 10:09:35,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:35,732 INFO L124 PetriNetUnfolderBase]: 274/530 cut-off events. [2025-03-04 10:09:35,732 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:09:35,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 530 events. 274/530 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2367 event pairs, 157 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 760. Up to 316 conditions per place. [2025-03-04 10:09:35,734 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 40 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2025-03-04 10:09:35,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 210 flow [2025-03-04 10:09:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:09:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:09:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-03-04 10:09:35,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-04 10:09:35,735 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 96 flow. Second operand 4 states and 126 transitions. [2025-03-04 10:09:35,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 210 flow [2025-03-04 10:09:35,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:35,736 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 110 flow [2025-03-04 10:09:35,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2025-03-04 10:09:35,737 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2025-03-04 10:09:35,737 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 110 flow [2025-03-04 10:09:35,737 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-04 10:09:35,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:35,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:35,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:09:35,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:35,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:35,737 INFO L85 PathProgramCache]: Analyzing trace with hash -867718074, now seen corresponding path program 1 times [2025-03-04 10:09:35,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:35,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716566533] [2025-03-04 10:09:35,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:35,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:35,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:09:35,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:09:35,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:35,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:35,855 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-04 10:09:35,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:35,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716566533] [2025-03-04 10:09:35,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716566533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:35,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700594323] [2025-03-04 10:09:35,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:35,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:35,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:35,857 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-04 10:09:35,859 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-04 10:09:35,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:09:35,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:09:35,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:35,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:35,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:09:35,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:35,961 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-04 10:09:35,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:36,007 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-04 10:09:36,018 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-04 10:09:36,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700594323] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:36,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:36,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-04 10:09:36,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194417232] [2025-03-04 10:09:36,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:36,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:09:36,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:36,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:09:36,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:09:36,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2025-03-04 10:09:36,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 110 flow. Second operand has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:36,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:36,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2025-03-04 10:09:36,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:36,370 INFO L124 PetriNetUnfolderBase]: 410/762 cut-off events. [2025-03-04 10:09:36,371 INFO L125 PetriNetUnfolderBase]: For 112/138 co-relation queries the response was YES. [2025-03-04 10:09:36,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519 conditions, 762 events. 410/762 cut-off events. For 112/138 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3641 event pairs, 167 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 1282. Up to 266 conditions per place. [2025-03-04 10:09:36,374 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 56 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2025-03-04 10:09:36,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 305 flow [2025-03-04 10:09:36,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:09:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:09:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2025-03-04 10:09:36,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.608843537414966 [2025-03-04 10:09:36,376 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 110 flow. Second operand 6 states and 179 transitions. [2025-03-04 10:09:36,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 305 flow [2025-03-04 10:09:36,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:09:36,377 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 135 flow [2025-03-04 10:09:36,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2025-03-04 10:09:36,378 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2025-03-04 10:09:36,378 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 135 flow [2025-03-04 10:09:36,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:36,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:36,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:36,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:36,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:09:36,582 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:36,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1397634252, now seen corresponding path program 1 times [2025-03-04 10:09:36,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:36,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961625005] [2025-03-04 10:09:36,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:36,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:36,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:09:36,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:09:36,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:36,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:36,640 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-04 10:09:36,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:36,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961625005] [2025-03-04 10:09:36,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961625005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:36,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:36,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:09:36,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631130933] [2025-03-04 10:09:36,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:36,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:36,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:36,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:36,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:09:36,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-04 10:09:36,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 135 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-04 10:09:36,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:36,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-04 10:09:36,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:36,744 INFO L124 PetriNetUnfolderBase]: 418/751 cut-off events. [2025-03-04 10:09:36,744 INFO L125 PetriNetUnfolderBase]: For 221/246 co-relation queries the response was YES. [2025-03-04 10:09:36,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 751 events. 418/751 cut-off events. For 221/246 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3361 event pairs, 250 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 1556. Up to 553 conditions per place. [2025-03-04 10:09:36,747 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 46 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-03-04 10:09:36,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 284 flow [2025-03-04 10:09:36,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:09:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:09:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2025-03-04 10:09:36,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6479591836734694 [2025-03-04 10:09:36,748 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 135 flow. Second operand 4 states and 127 transitions. [2025-03-04 10:09:36,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 284 flow [2025-03-04 10:09:36,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:36,750 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 148 flow [2025-03-04 10:09:36,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-03-04 10:09:36,751 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2025-03-04 10:09:36,751 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 148 flow [2025-03-04 10:09:36,751 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-04 10:09:36,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:36,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:36,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:09:36,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:36,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:36,751 INFO L85 PathProgramCache]: Analyzing trace with hash -682034794, now seen corresponding path program 1 times [2025-03-04 10:09:36,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:36,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950448797] [2025-03-04 10:09:36,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:36,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:36,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:09:36,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:09:36,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:36,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:36,847 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-04 10:09:36,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950448797] [2025-03-04 10:09:36,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950448797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:36,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261065763] [2025-03-04 10:09:36,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:36,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:36,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:36,850 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-04 10:09:36,851 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-04 10:09:36,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:09:36,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:09:36,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:36,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:36,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:09:36,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:36,963 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-04 10:09:36,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:37,000 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-04 10:09:37,008 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-04 10:09:37,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261065763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:37,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:37,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 10:09:37,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090496466] [2025-03-04 10:09:37,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:37,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:09:37,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:37,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:09:37,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:09:37,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2025-03-04 10:09:37,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:37,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:37,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2025-03-04 10:09:37,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:37,267 INFO L124 PetriNetUnfolderBase]: 638/1070 cut-off events. [2025-03-04 10:09:37,267 INFO L125 PetriNetUnfolderBase]: For 526/592 co-relation queries the response was YES. [2025-03-04 10:09:37,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2562 conditions, 1070 events. 638/1070 cut-off events. For 526/592 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4796 event pairs, 247 based on Foata normal form. 0/916 useless extension candidates. Maximal degree in co-relation 2454. Up to 467 conditions per place. [2025-03-04 10:09:37,275 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 62 selfloop transitions, 8 changer transitions 0/76 dead transitions. [2025-03-04 10:09:37,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 393 flow [2025-03-04 10:09:37,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:09:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:09:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2025-03-04 10:09:37,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2025-03-04 10:09:37,278 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 148 flow. Second operand 6 states and 178 transitions. [2025-03-04 10:09:37,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 393 flow [2025-03-04 10:09:37,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:09:37,280 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 173 flow [2025-03-04 10:09:37,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2025-03-04 10:09:37,281 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2025-03-04 10:09:37,281 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 173 flow [2025-03-04 10:09:37,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:37,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:37,281 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:37,287 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-04 10:09:37,482 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-04 10:09:37,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:37,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:37,482 INFO L85 PathProgramCache]: Analyzing trace with hash -223172662, now seen corresponding path program 1 times [2025-03-04 10:09:37,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:37,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53343035] [2025-03-04 10:09:37,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:37,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:37,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:09:37,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:09:37,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:37,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:37,598 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-04 10:09:37,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:37,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53343035] [2025-03-04 10:09:37,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53343035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:37,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361167397] [2025-03-04 10:09:37,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:37,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:37,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:37,601 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-04 10:09:37,607 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-04 10:09:37,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:09:37,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:09:37,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:37,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:37,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:09:37,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:37,728 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-04 10:09:37,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:37,785 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-04 10:09:37,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361167397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:37,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:37,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2025-03-04 10:09:37,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667484888] [2025-03-04 10:09:37,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:37,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:09:37,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:37,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:09:37,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:09:37,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-04 10:09:37,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 173 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-04 10:09:37,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:37,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-04 10:09:37,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:38,344 INFO L124 PetriNetUnfolderBase]: 1085/1882 cut-off events. [2025-03-04 10:09:38,344 INFO L125 PetriNetUnfolderBase]: For 1113/1160 co-relation queries the response was YES. [2025-03-04 10:09:38,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4833 conditions, 1882 events. 1085/1882 cut-off events. For 1113/1160 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9799 event pairs, 628 based on Foata normal form. 26/1719 useless extension candidates. Maximal degree in co-relation 3904. Up to 873 conditions per place. [2025-03-04 10:09:38,354 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 93 selfloop transitions, 10 changer transitions 0/109 dead transitions. [2025-03-04 10:09:38,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 109 transitions, 599 flow [2025-03-04 10:09:38,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:09:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:09:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 280 transitions. [2025-03-04 10:09:38,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2025-03-04 10:09:38,355 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 173 flow. Second operand 9 states and 280 transitions. [2025-03-04 10:09:38,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 109 transitions, 599 flow [2025-03-04 10:09:38,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:38,359 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 215 flow [2025-03-04 10:09:38,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=215, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2025-03-04 10:09:38,360 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2025-03-04 10:09:38,360 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 215 flow [2025-03-04 10:09:38,360 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-04 10:09:38,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:38,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:38,366 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-04 10:09:38,561 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-04 10:09:38,561 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:38,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:38,561 INFO L85 PathProgramCache]: Analyzing trace with hash -469901029, now seen corresponding path program 1 times [2025-03-04 10:09:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:38,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487363406] [2025-03-04 10:09:38,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:38,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:38,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:09:38,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:09:38,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:38,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:38,641 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-04 10:09:38,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:38,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487363406] [2025-03-04 10:09:38,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487363406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:38,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:38,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:09:38,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066155223] [2025-03-04 10:09:38,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:38,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:09:38,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:38,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:09:38,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:09:38,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:09:38,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 215 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-04 10:09:38,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:38,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:09:38,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:38,876 INFO L124 PetriNetUnfolderBase]: 1410/2415 cut-off events. [2025-03-04 10:09:38,876 INFO L125 PetriNetUnfolderBase]: For 2129/2272 co-relation queries the response was YES. [2025-03-04 10:09:38,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6570 conditions, 2415 events. 1410/2415 cut-off events. For 2129/2272 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13271 event pairs, 169 based on Foata normal form. 3/2144 useless extension candidates. Maximal degree in co-relation 5474. Up to 1227 conditions per place. [2025-03-04 10:09:38,889 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 76 selfloop transitions, 17 changer transitions 4/104 dead transitions. [2025-03-04 10:09:38,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 104 transitions, 642 flow [2025-03-04 10:09:38,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:09:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:09:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2025-03-04 10:09:38,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746938775510204 [2025-03-04 10:09:38,892 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 215 flow. Second operand 5 states and 183 transitions. [2025-03-04 10:09:38,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 104 transitions, 642 flow [2025-03-04 10:09:38,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 634 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:09:38,898 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 337 flow [2025-03-04 10:09:38,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=60, 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=337, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2025-03-04 10:09:38,899 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2025-03-04 10:09:38,899 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 337 flow [2025-03-04 10:09:38,899 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-04 10:09:38,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:38,899 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:38,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:09:38,899 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:38,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash 863326528, now seen corresponding path program 2 times [2025-03-04 10:09:38,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:38,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999198621] [2025-03-04 10:09:38,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:38,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:38,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:38,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:38,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:38,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:09:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999198621] [2025-03-04 10:09:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999198621] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529395423] [2025-03-04 10:09:39,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:39,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:39,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:39,112 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-04 10:09:39,114 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-04 10:09:39,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:09:39,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:39,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:39,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:39,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:09:39,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:39,175 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-04 10:09:39,382 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-04 10:09:39,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:39,518 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-04 10:09:39,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529395423] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:39,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:39,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2025-03-04 10:09:39,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53304178] [2025-03-04 10:09:39,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:39,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:09:39,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:39,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:09:39,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:09:39,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2025-03-04 10:09:39,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 337 flow. Second operand has 15 states, 15 states have (on average 20.4) internal successors, (306), 15 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:39,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:39,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2025-03-04 10:09:39,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:40,373 INFO L124 PetriNetUnfolderBase]: 1598/2640 cut-off events. [2025-03-04 10:09:40,373 INFO L125 PetriNetUnfolderBase]: For 4053/4141 co-relation queries the response was YES. [2025-03-04 10:09:40,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8920 conditions, 2640 events. 1598/2640 cut-off events. For 4053/4141 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 14047 event pairs, 327 based on Foata normal form. 48/2678 useless extension candidates. Maximal degree in co-relation 7471. Up to 1004 conditions per place. [2025-03-04 10:09:40,387 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 104 selfloop transitions, 8 changer transitions 0/117 dead transitions. [2025-03-04 10:09:40,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 117 transitions, 848 flow [2025-03-04 10:09:40,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:09:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:09:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2025-03-04 10:09:40,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.565597667638484 [2025-03-04 10:09:40,390 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 337 flow. Second operand 7 states and 194 transitions. [2025-03-04 10:09:40,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 117 transitions, 848 flow [2025-03-04 10:09:40,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 117 transitions, 776 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-04 10:09:40,399 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 307 flow [2025-03-04 10:09:40,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=307, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2025-03-04 10:09:40,400 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2025-03-04 10:09:40,400 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 307 flow [2025-03-04 10:09:40,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 20.4) internal successors, (306), 15 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:40,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:40,401 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:40,407 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-04 10:09:40,605 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-04 10:09:40,605 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:40,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:40,606 INFO L85 PathProgramCache]: Analyzing trace with hash 416746855, now seen corresponding path program 1 times [2025-03-04 10:09:40,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:40,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389235275] [2025-03-04 10:09:40,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:40,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:09:40,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:40,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:40,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:40,679 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-04 10:09:40,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:40,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389235275] [2025-03-04 10:09:40,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389235275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:40,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228319000] [2025-03-04 10:09:40,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:40,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:40,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:40,682 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-04 10:09:40,683 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-04 10:09:40,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:09:40,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:09:40,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:40,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:40,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:09:40,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:40,813 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-04 10:09:40,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:40,865 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-04 10:09:40,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228319000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:40,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:40,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2025-03-04 10:09:40,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679697180] [2025-03-04 10:09:40,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:40,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:09:40,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:40,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:09:40,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:09:40,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-04 10:09:40,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 307 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-04 10:09:40,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:40,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-04 10:09:40,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:41,373 INFO L124 PetriNetUnfolderBase]: 1310/2172 cut-off events. [2025-03-04 10:09:41,374 INFO L125 PetriNetUnfolderBase]: For 2342/2342 co-relation queries the response was YES. [2025-03-04 10:09:41,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7036 conditions, 2172 events. 1310/2172 cut-off events. For 2342/2342 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10971 event pairs, 720 based on Foata normal form. 27/2187 useless extension candidates. Maximal degree in co-relation 5349. Up to 1423 conditions per place. [2025-03-04 10:09:41,386 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 111 selfloop transitions, 10 changer transitions 1/128 dead transitions. [2025-03-04 10:09:41,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 128 transitions, 892 flow [2025-03-04 10:09:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:09:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:09:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 273 transitions. [2025-03-04 10:09:41,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-04 10:09:41,387 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 307 flow. Second operand 9 states and 273 transitions. [2025-03-04 10:09:41,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 128 transitions, 892 flow [2025-03-04 10:09:41,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 128 transitions, 876 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 10:09:41,392 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 355 flow [2025-03-04 10:09:41,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=61, 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=355, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2025-03-04 10:09:41,393 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 24 predicate places. [2025-03-04 10:09:41,393 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 355 flow [2025-03-04 10:09:41,393 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-04 10:09:41,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:41,393 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:41,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:41,594 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-04 10:09:41,594 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:41,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:41,594 INFO L85 PathProgramCache]: Analyzing trace with hash 865415517, now seen corresponding path program 2 times [2025-03-04 10:09:41,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:41,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897513962] [2025-03-04 10:09:41,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:41,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:41,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 10:09:41,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:09:41,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:41,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:41,908 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-04 10:09:41,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:41,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897513962] [2025-03-04 10:09:41,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897513962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:41,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177926954] [2025-03-04 10:09:41,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:41,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:41,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:41,911 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-04 10:09:41,913 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-04 10:09:41,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 10:09:41,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:09:41,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:41,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:41,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:09:41,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:42,076 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-04 10:09:42,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:42,163 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 18 treesize of output 14 [2025-03-04 10:09:42,192 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-04 10:09:42,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177926954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:42,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:42,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 6] total 15 [2025-03-04 10:09:42,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776252492] [2025-03-04 10:09:42,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:42,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:09:42,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:42,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:09:42,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:09:42,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2025-03-04 10:09:42,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 355 flow. Second operand has 17 states, 17 states have (on average 20.705882352941178) internal successors, (352), 17 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:42,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:42,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2025-03-04 10:09:42,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:43,208 INFO L124 PetriNetUnfolderBase]: 1793/2886 cut-off events. [2025-03-04 10:09:43,209 INFO L125 PetriNetUnfolderBase]: For 3080/3080 co-relation queries the response was YES. [2025-03-04 10:09:43,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9885 conditions, 2886 events. 1793/2886 cut-off events. For 3080/3080 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 14255 event pairs, 364 based on Foata normal form. 88/2962 useless extension candidates. Maximal degree in co-relation 8057. Up to 744 conditions per place. [2025-03-04 10:09:43,224 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 145 selfloop transitions, 11 changer transitions 0/161 dead transitions. [2025-03-04 10:09:43,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 161 transitions, 1157 flow [2025-03-04 10:09:43,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:09:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:09:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 308 transitions. [2025-03-04 10:09:43,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 10:09:43,226 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 355 flow. Second operand 11 states and 308 transitions. [2025-03-04 10:09:43,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 161 transitions, 1157 flow [2025-03-04 10:09:43,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 161 transitions, 1146 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:09:43,231 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 385 flow [2025-03-04 10:09:43,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=67, 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=385, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2025-03-04 10:09:43,233 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2025-03-04 10:09:43,233 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 385 flow [2025-03-04 10:09:43,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 20.705882352941178) internal successors, (352), 17 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:43,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:43,234 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-04 10:09:43,240 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-04 10:09:43,434 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-04 10:09:43,434 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:43,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:43,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1874864134, now seen corresponding path program 1 times [2025-03-04 10:09:43,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:43,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688673814] [2025-03-04 10:09:43,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:43,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:43,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:09:43,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:09:43,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:43,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:43,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:43,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688673814] [2025-03-04 10:09:43,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688673814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:43,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850552141] [2025-03-04 10:09:43,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:43,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:43,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:43,526 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-04 10:09:43,528 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-04 10:09:43,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:09:43,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:09:43,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:43,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:43,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:09:43,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:43,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:43,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:09:43,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850552141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:43,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:09:43,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 10:09:43,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618903028] [2025-03-04 10:09:43,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:43,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:43,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:43,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:43,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:09:43,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-04 10:09:43,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 385 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:43,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:43,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-04 10:09:43,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:43,905 INFO L124 PetriNetUnfolderBase]: 1803/2934 cut-off events. [2025-03-04 10:09:43,905 INFO L125 PetriNetUnfolderBase]: For 4369/4369 co-relation queries the response was YES. [2025-03-04 10:09:43,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10397 conditions, 2934 events. 1803/2934 cut-off events. For 4369/4369 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 14717 event pairs, 340 based on Foata normal form. 6/2930 useless extension candidates. Maximal degree in co-relation 8521. Up to 2325 conditions per place. [2025-03-04 10:09:43,921 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 100 selfloop transitions, 16 changer transitions 7/128 dead transitions. [2025-03-04 10:09:43,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 128 transitions, 989 flow [2025-03-04 10:09:43,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:09:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:09:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2025-03-04 10:09:43,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7346938775510204 [2025-03-04 10:09:43,926 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 385 flow. Second operand 5 states and 180 transitions. [2025-03-04 10:09:43,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 128 transitions, 989 flow [2025-03-04 10:09:43,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 128 transitions, 956 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-04 10:09:43,933 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 561 flow [2025-03-04 10:09:43,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=561, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2025-03-04 10:09:43,934 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2025-03-04 10:09:43,934 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 561 flow [2025-03-04 10:09:43,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:43,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:43,934 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-04 10:09:43,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:09:44,138 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-04 10:09:44,138 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:44,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash 567145530, now seen corresponding path program 2 times [2025-03-04 10:09:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:44,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084749358] [2025-03-04 10:09:44,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:44,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:09:44,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 21 statements. [2025-03-04 10:09:44,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:09:44,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:44,192 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-04 10:09:44,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:44,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084749358] [2025-03-04 10:09:44,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084749358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:44,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:44,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:09:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765427345] [2025-03-04 10:09:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:44,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:44,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:44,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:09:44,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2025-03-04 10:09:44,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 561 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:44,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:44,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2025-03-04 10:09:44,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:44,414 INFO L124 PetriNetUnfolderBase]: 1957/3143 cut-off events. [2025-03-04 10:09:44,414 INFO L125 PetriNetUnfolderBase]: For 5893/5893 co-relation queries the response was YES. [2025-03-04 10:09:44,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11446 conditions, 3143 events. 1957/3143 cut-off events. For 5893/5893 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 15141 event pairs, 341 based on Foata normal form. 40/3177 useless extension candidates. Maximal degree in co-relation 9591. Up to 2636 conditions per place. [2025-03-04 10:09:44,429 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 82 selfloop transitions, 11 changer transitions 8/104 dead transitions. [2025-03-04 10:09:44,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 104 transitions, 865 flow [2025-03-04 10:09:44,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:09:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:09:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-03-04 10:09:44,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6887755102040817 [2025-03-04 10:09:44,430 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 561 flow. Second operand 4 states and 135 transitions. [2025-03-04 10:09:44,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 104 transitions, 865 flow [2025-03-04 10:09:44,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 104 transitions, 859 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 10:09:44,437 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 552 flow [2025-03-04 10:09:44,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=552, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2025-03-04 10:09:44,437 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 36 predicate places. [2025-03-04 10:09:44,437 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 552 flow [2025-03-04 10:09:44,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:44,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:44,438 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-04 10:09:44,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:09:44,438 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:44,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1408791737, now seen corresponding path program 1 times [2025-03-04 10:09:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:44,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421110838] [2025-03-04 10:09:44,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:44,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:44,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:09:44,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:09:44,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:44,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:44,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:44,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421110838] [2025-03-04 10:09:44,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421110838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270314963] [2025-03-04 10:09:44,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:44,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:44,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:44,502 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-04 10:09:44,503 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-04 10:09:44,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:09:44,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:09:44,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:44,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:44,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:09:44,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:09:44,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:09:44,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270314963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:44,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:09:44,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 10:09:44,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195231853] [2025-03-04 10:09:44,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:44,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:09:44,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:44,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:09:44,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:09:44,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2025-03-04 10:09:44,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 552 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:44,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:44,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2025-03-04 10:09:44,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:44,816 INFO L124 PetriNetUnfolderBase]: 1695/2786 cut-off events. [2025-03-04 10:09:44,817 INFO L125 PetriNetUnfolderBase]: For 5140/5140 co-relation queries the response was YES. [2025-03-04 10:09:44,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10219 conditions, 2786 events. 1695/2786 cut-off events. For 5140/5140 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 13802 event pairs, 361 based on Foata normal form. 4/2774 useless extension candidates. Maximal degree in co-relation 8519. Up to 2278 conditions per place. [2025-03-04 10:09:44,829 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 73 selfloop transitions, 6 changer transitions 7/94 dead transitions. [2025-03-04 10:09:44,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 94 transitions, 783 flow [2025-03-04 10:09:44,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:09:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:09:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-03-04 10:09:44,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2025-03-04 10:09:44,830 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 552 flow. Second operand 4 states and 132 transitions. [2025-03-04 10:09:44,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 94 transitions, 783 flow [2025-03-04 10:09:44,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 94 transitions, 765 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:44,837 INFO L231 Difference]: Finished difference. Result has 85 places, 72 transitions, 493 flow [2025-03-04 10:09:44,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=493, PETRI_PLACES=85, PETRI_TRANSITIONS=72} [2025-03-04 10:09:44,838 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 37 predicate places. [2025-03-04 10:09:44,838 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 72 transitions, 493 flow [2025-03-04 10:09:44,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:44,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:44,838 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-04 10:09:44,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:45,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:09:45,039 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:45,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:45,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1727552075, now seen corresponding path program 2 times [2025-03-04 10:09:45,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:45,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815437365] [2025-03-04 10:09:45,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:45,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:45,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:09:45,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 21 statements. [2025-03-04 10:09:45,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:09:45,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:45,101 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-04 10:09:45,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815437365] [2025-03-04 10:09:45,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815437365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:45,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:45,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:09:45,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898042001] [2025-03-04 10:09:45,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:45,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:09:45,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:45,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:09:45,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:09:45,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2025-03-04 10:09:45,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 72 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:45,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:45,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2025-03-04 10:09:45,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:45,393 INFO L124 PetriNetUnfolderBase]: 1857/2927 cut-off events. [2025-03-04 10:09:45,394 INFO L125 PetriNetUnfolderBase]: For 5781/5781 co-relation queries the response was YES. [2025-03-04 10:09:45,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10722 conditions, 2927 events. 1857/2927 cut-off events. For 5781/5781 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 13344 event pairs, 228 based on Foata normal form. 30/2955 useless extension candidates. Maximal degree in co-relation 9008. Up to 1863 conditions per place. [2025-03-04 10:09:45,404 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 95 selfloop transitions, 21 changer transitions 0/119 dead transitions. [2025-03-04 10:09:45,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 119 transitions, 966 flow [2025-03-04 10:09:45,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:09:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:09:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2025-03-04 10:09:45,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6496598639455783 [2025-03-04 10:09:45,405 INFO L175 Difference]: Start difference. First operand has 85 places, 72 transitions, 493 flow. Second operand 6 states and 191 transitions. [2025-03-04 10:09:45,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 119 transitions, 966 flow [2025-03-04 10:09:45,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 119 transitions, 925 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 10:09:45,413 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 568 flow [2025-03-04 10:09:45,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=568, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2025-03-04 10:09:45,413 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 36 predicate places. [2025-03-04 10:09:45,413 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 568 flow [2025-03-04 10:09:45,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:45,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:45,414 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-04 10:09:45,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:09:45,414 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:45,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:45,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1786413354, now seen corresponding path program 3 times [2025-03-04 10:09:45,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:45,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863105508] [2025-03-04 10:09:45,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:45,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:45,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-04 10:09:45,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 21 statements. [2025-03-04 10:09:45,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:09:45,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:45,503 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-04 10:09:45,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:45,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863105508] [2025-03-04 10:09:45,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863105508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:45,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311625321] [2025-03-04 10:09:45,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:45,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:45,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:45,505 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-04 10:09:45,507 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-04 10:09:45,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-04 10:09:45,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 21 statements. [2025-03-04 10:09:45,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:09:45,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:45,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:09:45,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:09:45,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:45,684 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-04 10:09:45,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311625321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:45,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:45,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:09:45,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334468093] [2025-03-04 10:09:45,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:45,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:09:45,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:45,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:09:45,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:09:45,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2025-03-04 10:09:45,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 568 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-04 10:09:45,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:45,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2025-03-04 10:09:45,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:46,130 INFO L124 PetriNetUnfolderBase]: 1792/2825 cut-off events. [2025-03-04 10:09:46,130 INFO L125 PetriNetUnfolderBase]: For 7544/7544 co-relation queries the response was YES. [2025-03-04 10:09:46,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11048 conditions, 2825 events. 1792/2825 cut-off events. For 7544/7544 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 12998 event pairs, 84 based on Foata normal form. 44/2867 useless extension candidates. Maximal degree in co-relation 9329. Up to 966 conditions per place. [2025-03-04 10:09:46,143 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 151 selfloop transitions, 34 changer transitions 0/188 dead transitions. [2025-03-04 10:09:46,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 188 transitions, 1589 flow [2025-03-04 10:09:46,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:09:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:09:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 369 transitions. [2025-03-04 10:09:46,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6275510204081632 [2025-03-04 10:09:46,145 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 568 flow. Second operand 12 states and 369 transitions. [2025-03-04 10:09:46,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 188 transitions, 1589 flow [2025-03-04 10:09:46,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 188 transitions, 1559 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:46,155 INFO L231 Difference]: Finished difference. Result has 97 places, 88 transitions, 787 flow [2025-03-04 10:09:46,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=787, PETRI_PLACES=97, PETRI_TRANSITIONS=88} [2025-03-04 10:09:46,156 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 49 predicate places. [2025-03-04 10:09:46,156 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 88 transitions, 787 flow [2025-03-04 10:09:46,156 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-04 10:09:46,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:46,156 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-04 10:09:46,162 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-04 10:09:46,357 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,SelfDestructingSolverStorable17 [2025-03-04 10:09:46,357 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:46,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:46,357 INFO L85 PathProgramCache]: Analyzing trace with hash -635743260, now seen corresponding path program 1 times [2025-03-04 10:09:46,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:46,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870951165] [2025-03-04 10:09:46,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:46,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:46,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:09:46,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:09:46,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:46,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:46,749 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-04 10:09:46,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:46,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870951165] [2025-03-04 10:09:46,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870951165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:46,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 10:09:46,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339463524] [2025-03-04 10:09:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:46,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:09:46,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:46,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:09:46,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:09:47,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:09:47,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 88 transitions, 787 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-04 10:09:47,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:47,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:09:47,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:47,882 INFO L124 PetriNetUnfolderBase]: 1909/3173 cut-off events. [2025-03-04 10:09:47,882 INFO L125 PetriNetUnfolderBase]: For 11691/11691 co-relation queries the response was YES. [2025-03-04 10:09:47,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13886 conditions, 3173 events. 1909/3173 cut-off events. For 11691/11691 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 16179 event pairs, 22 based on Foata normal form. 2/3163 useless extension candidates. Maximal degree in co-relation 12511. Up to 1397 conditions per place. [2025-03-04 10:09:47,897 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 155 selfloop transitions, 75 changer transitions 3/245 dead transitions. [2025-03-04 10:09:47,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 245 transitions, 2416 flow [2025-03-04 10:09:47,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:09:47,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:09:47,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 514 transitions. [2025-03-04 10:09:47,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6556122448979592 [2025-03-04 10:09:47,899 INFO L175 Difference]: Start difference. First operand has 97 places, 88 transitions, 787 flow. Second operand 16 states and 514 transitions. [2025-03-04 10:09:47,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 245 transitions, 2416 flow [2025-03-04 10:09:47,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 245 transitions, 2287 flow, removed 21 selfloop flow, removed 6 redundant places. [2025-03-04 10:09:47,918 INFO L231 Difference]: Finished difference. Result has 114 places, 144 transitions, 1606 flow [2025-03-04 10:09:47,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1606, PETRI_PLACES=114, PETRI_TRANSITIONS=144} [2025-03-04 10:09:47,918 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 66 predicate places. [2025-03-04 10:09:47,918 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 144 transitions, 1606 flow [2025-03-04 10:09:47,919 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-04 10:09:47,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:47,919 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-04 10:09:47,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:09:47,919 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:47,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:47,919 INFO L85 PathProgramCache]: Analyzing trace with hash -144484950, now seen corresponding path program 2 times [2025-03-04 10:09:47,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:47,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714084567] [2025-03-04 10:09:47,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:47,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:47,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:09:47,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-03-04 10:09:47,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:09:47,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:48,128 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-04 10:09:48,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:48,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714084567] [2025-03-04 10:09:48,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714084567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:48,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:48,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 10:09:48,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664013742] [2025-03-04 10:09:48,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:48,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:09:48,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:48,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:09:48,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:09:48,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:09:48,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 144 transitions, 1606 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-04 10:09:48,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:48,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:09:48,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:48,835 INFO L124 PetriNetUnfolderBase]: 2715/4453 cut-off events. [2025-03-04 10:09:48,835 INFO L125 PetriNetUnfolderBase]: For 22634/22634 co-relation queries the response was YES. [2025-03-04 10:09:48,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22378 conditions, 4453 events. 2715/4453 cut-off events. For 22634/22634 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 24002 event pairs, 304 based on Foata normal form. 2/4439 useless extension candidates. Maximal degree in co-relation 20031. Up to 2470 conditions per place. [2025-03-04 10:09:48,861 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 181 selfloop transitions, 112 changer transitions 5/310 dead transitions. [2025-03-04 10:09:48,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 310 transitions, 3786 flow [2025-03-04 10:09:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:09:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:09:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 401 transitions. [2025-03-04 10:09:48,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6819727891156463 [2025-03-04 10:09:48,862 INFO L175 Difference]: Start difference. First operand has 114 places, 144 transitions, 1606 flow. Second operand 12 states and 401 transitions. [2025-03-04 10:09:48,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 310 transitions, 3786 flow [2025-03-04 10:09:48,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 310 transitions, 3564 flow, removed 78 selfloop flow, removed 4 redundant places. [2025-03-04 10:09:48,912 INFO L231 Difference]: Finished difference. Result has 126 places, 230 transitions, 2957 flow [2025-03-04 10:09:48,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2957, PETRI_PLACES=126, PETRI_TRANSITIONS=230} [2025-03-04 10:09:48,913 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 78 predicate places. [2025-03-04 10:09:48,913 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 230 transitions, 2957 flow [2025-03-04 10:09:48,913 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-04 10:09:48,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:48,913 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-04 10:09:48,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:09:48,913 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:48,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:48,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1843043774, now seen corresponding path program 1 times [2025-03-04 10:09:48,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:48,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365173875] [2025-03-04 10:09:48,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:09:48,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:48,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:09:48,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:09:48,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:48,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:49,275 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-04 10:09:49,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:49,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365173875] [2025-03-04 10:09:49,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365173875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:49,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:49,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 10:09:49,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989973578] [2025-03-04 10:09:49,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:49,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:09:49,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:49,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:09:49,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:09:49,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:09:49,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 230 transitions, 2957 flow. Second operand has 13 states, 13 states have (on average 23.615384615384617) internal successors, (307), 13 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:49,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:49,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:09:49,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:50,609 INFO L124 PetriNetUnfolderBase]: 4027/6515 cut-off events. [2025-03-04 10:09:50,609 INFO L125 PetriNetUnfolderBase]: For 39456/39456 co-relation queries the response was YES. [2025-03-04 10:09:50,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35452 conditions, 6515 events. 4027/6515 cut-off events. For 39456/39456 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 37337 event pairs, 616 based on Foata normal form. 2/6503 useless extension candidates. Maximal degree in co-relation 32870. Up to 4145 conditions per place. [2025-03-04 10:09:50,654 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 318 selfloop transitions, 117 changer transitions 3/450 dead transitions. [2025-03-04 10:09:50,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 450 transitions, 6302 flow [2025-03-04 10:09:50,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:09:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:09:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 468 transitions. [2025-03-04 10:09:50,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.636734693877551 [2025-03-04 10:09:50,655 INFO L175 Difference]: Start difference. First operand has 126 places, 230 transitions, 2957 flow. Second operand 15 states and 468 transitions. [2025-03-04 10:09:50,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 450 transitions, 6302 flow [2025-03-04 10:09:50,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 450 transitions, 6011 flow, removed 103 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:50,784 INFO L231 Difference]: Finished difference. Result has 149 places, 332 transitions, 4573 flow [2025-03-04 10:09:50,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2784, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4573, PETRI_PLACES=149, PETRI_TRANSITIONS=332} [2025-03-04 10:09:50,785 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 101 predicate places. [2025-03-04 10:09:50,785 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 332 transitions, 4573 flow [2025-03-04 10:09:50,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 23.615384615384617) internal successors, (307), 13 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:09:50,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:50,785 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-04 10:09:50,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:09:50,785 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:50,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1685128178, now seen corresponding path program 2 times [2025-03-04 10:09:50,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:50,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479786578] [2025-03-04 10:09:50,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:09:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:50,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:09:50,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-03-04 10:09:50,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:09:50,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:51,004 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-04 10:09:51,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:51,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479786578] [2025-03-04 10:09:51,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479786578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:51,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:51,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:09:51,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912554555] [2025-03-04 10:09:51,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:51,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:09:51,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:51,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:09:51,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:09:51,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:09:51,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 332 transitions, 4573 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-04 10:09:51,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:51,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:09:51,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:52,055 INFO L124 PetriNetUnfolderBase]: 4308/6983 cut-off events. [2025-03-04 10:09:52,055 INFO L125 PetriNetUnfolderBase]: For 49639/49683 co-relation queries the response was YES. [2025-03-04 10:09:52,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41321 conditions, 6983 events. 4308/6983 cut-off events. For 49639/49683 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 40520 event pairs, 307 based on Foata normal form. 4/6973 useless extension candidates. Maximal degree in co-relation 38141. Up to 3044 conditions per place. [2025-03-04 10:09:52,100 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 226 selfloop transitions, 183 changer transitions 3/424 dead transitions. [2025-03-04 10:09:52,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 424 transitions, 6209 flow [2025-03-04 10:09:52,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:09:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:09:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 321 transitions. [2025-03-04 10:09:52,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7278911564625851 [2025-03-04 10:09:52,101 INFO L175 Difference]: Start difference. First operand has 149 places, 332 transitions, 4573 flow. Second operand 9 states and 321 transitions. [2025-03-04 10:09:52,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 424 transitions, 6209 flow [2025-03-04 10:09:52,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 424 transitions, 6133 flow, removed 29 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:52,270 INFO L231 Difference]: Finished difference. Result has 158 places, 348 transitions, 5303 flow [2025-03-04 10:09:52,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4497, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5303, PETRI_PLACES=158, PETRI_TRANSITIONS=348} [2025-03-04 10:09:52,270 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 110 predicate places. [2025-03-04 10:09:52,270 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 348 transitions, 5303 flow [2025-03-04 10:09:52,271 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-04 10:09:52,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:52,271 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-04 10:09:52,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:09:52,271 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:52,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:52,271 INFO L85 PathProgramCache]: Analyzing trace with hash -265443468, now seen corresponding path program 3 times [2025-03-04 10:09:52,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:52,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15921242] [2025-03-04 10:09:52,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:52,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:52,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-04 10:09:52,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-03-04 10:09:52,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:09:52,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:52,524 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-04 10:09:52,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:52,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15921242] [2025-03-04 10:09:52,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15921242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:52,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:52,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:09:52,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058832012] [2025-03-04 10:09:52,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:52,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:09:52,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:52,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:09:52,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:09:52,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:09:52,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 348 transitions, 5303 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-04 10:09:52,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:52,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:09:52,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:53,993 INFO L124 PetriNetUnfolderBase]: 4610/7488 cut-off events. [2025-03-04 10:09:53,993 INFO L125 PetriNetUnfolderBase]: For 65358/65402 co-relation queries the response was YES. [2025-03-04 10:09:54,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47049 conditions, 7488 events. 4610/7488 cut-off events. For 65358/65402 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 44108 event pairs, 317 based on Foata normal form. 4/7474 useless extension candidates. Maximal degree in co-relation 43724. Up to 2719 conditions per place. [2025-03-04 10:09:54,051 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 220 selfloop transitions, 210 changer transitions 7/449 dead transitions. [2025-03-04 10:09:54,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 449 transitions, 7116 flow [2025-03-04 10:09:54,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:09:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:09:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 352 transitions. [2025-03-04 10:09:54,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7183673469387755 [2025-03-04 10:09:54,054 INFO L175 Difference]: Start difference. First operand has 158 places, 348 transitions, 5303 flow. Second operand 10 states and 352 transitions. [2025-03-04 10:09:54,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 449 transitions, 7116 flow [2025-03-04 10:09:54,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 449 transitions, 6963 flow, removed 30 selfloop flow, removed 4 redundant places. [2025-03-04 10:09:54,304 INFO L231 Difference]: Finished difference. Result has 167 places, 363 transitions, 6067 flow [2025-03-04 10:09:54,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5156, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6067, PETRI_PLACES=167, PETRI_TRANSITIONS=363} [2025-03-04 10:09:54,304 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 119 predicate places. [2025-03-04 10:09:54,304 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 363 transitions, 6067 flow [2025-03-04 10:09:54,305 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-04 10:09:54,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:54,305 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-04 10:09:54,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:09:54,305 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:54,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:54,305 INFO L85 PathProgramCache]: Analyzing trace with hash -221476458, now seen corresponding path program 4 times [2025-03-04 10:09:54,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:54,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613799960] [2025-03-04 10:09:54,305 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:09:54,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:54,312 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:09:54,321 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:09:54,321 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:09:54,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:54,798 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-04 10:09:54,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:54,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613799960] [2025-03-04 10:09:54,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613799960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:54,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702716302] [2025-03-04 10:09:54,799 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:09:54,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:54,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:54,801 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-04 10:09:54,802 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-04 10:09:54,848 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:09:54,871 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:09:54,871 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:09:54,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:54,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 10:09:54,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:54,886 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-04 10:09:55,043 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-04 10:09:55,076 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-04 10:09:55,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:55,168 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-04 10:09:55,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702716302] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:55,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:09:55,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 10] total 22 [2025-03-04 10:09:55,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197502292] [2025-03-04 10:09:55,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:55,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:09:55,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:55,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:09:55,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:09:55,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:09:55,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 363 transitions, 6067 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-04 10:09:55,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:55,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:09:55,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:56,657 INFO L124 PetriNetUnfolderBase]: 5125/8275 cut-off events. [2025-03-04 10:09:56,657 INFO L125 PetriNetUnfolderBase]: For 85084/85128 co-relation queries the response was YES. [2025-03-04 10:09:56,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55606 conditions, 8275 events. 5125/8275 cut-off events. For 85084/85128 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 49283 event pairs, 624 based on Foata normal form. 4/8261 useless extension candidates. Maximal degree in co-relation 52117. Up to 4550 conditions per place. [2025-03-04 10:09:56,725 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 253 selfloop transitions, 212 changer transitions 18/495 dead transitions. [2025-03-04 10:09:56,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 495 transitions, 8669 flow [2025-03-04 10:09:56,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:09:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:09:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 455 transitions. [2025-03-04 10:09:56,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6632653061224489 [2025-03-04 10:09:56,727 INFO L175 Difference]: Start difference. First operand has 167 places, 363 transitions, 6067 flow. Second operand 14 states and 455 transitions. [2025-03-04 10:09:56,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 495 transitions, 8669 flow [2025-03-04 10:09:57,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 495 transitions, 8333 flow, removed 47 selfloop flow, removed 6 redundant places. [2025-03-04 10:09:57,031 INFO L231 Difference]: Finished difference. Result has 177 places, 397 transitions, 7089 flow [2025-03-04 10:09:57,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5777, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7089, PETRI_PLACES=177, PETRI_TRANSITIONS=397} [2025-03-04 10:09:57,031 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 129 predicate places. [2025-03-04 10:09:57,031 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 397 transitions, 7089 flow [2025-03-04 10:09:57,032 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-04 10:09:57,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:57,032 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-04 10:09:57,037 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-04 10:09:57,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 10:09:57,232 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:57,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:57,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1538682964, now seen corresponding path program 3 times [2025-03-04 10:09:57,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:57,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821800575] [2025-03-04 10:09:57,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:09:57,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:57,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-04 10:09:57,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-03-04 10:09:57,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:09:57,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:57,452 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-04 10:09:57,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:57,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821800575] [2025-03-04 10:09:57,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821800575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:09:57,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:09:57,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:09:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709224632] [2025-03-04 10:09:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:09:57,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:09:57,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:57,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:09:57,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:09:57,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:09:57,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 397 transitions, 7089 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-04 10:09:57,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:57,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:09:57,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:59,152 INFO L124 PetriNetUnfolderBase]: 6484/10399 cut-off events. [2025-03-04 10:09:59,152 INFO L125 PetriNetUnfolderBase]: For 124765/124809 co-relation queries the response was YES. [2025-03-04 10:09:59,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72726 conditions, 10399 events. 6484/10399 cut-off events. For 124765/124809 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 64487 event pairs, 833 based on Foata normal form. 4/10385 useless extension candidates. Maximal degree in co-relation 69269. Up to 5757 conditions per place. [2025-03-04 10:09:59,248 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 319 selfloop transitions, 231 changer transitions 15/577 dead transitions. [2025-03-04 10:09:59,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 577 transitions, 11095 flow [2025-03-04 10:09:59,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:09:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:09:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 317 transitions. [2025-03-04 10:09:59,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7188208616780045 [2025-03-04 10:09:59,249 INFO L175 Difference]: Start difference. First operand has 177 places, 397 transitions, 7089 flow. Second operand 9 states and 317 transitions. [2025-03-04 10:09:59,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 577 transitions, 11095 flow [2025-03-04 10:09:59,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 577 transitions, 10658 flow, removed 112 selfloop flow, removed 8 redundant places. [2025-03-04 10:09:59,741 INFO L231 Difference]: Finished difference. Result has 181 places, 487 transitions, 9465 flow [2025-03-04 10:09:59,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6774, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9465, PETRI_PLACES=181, PETRI_TRANSITIONS=487} [2025-03-04 10:09:59,742 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 133 predicate places. [2025-03-04 10:09:59,742 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 487 transitions, 9465 flow [2025-03-04 10:09:59,742 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-04 10:09:59,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:59,742 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-04 10:09:59,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 10:09:59,742 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:09:59,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash 208674164, now seen corresponding path program 5 times [2025-03-04 10:09:59,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:59,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632749331] [2025-03-04 10:09:59,743 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:09:59,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:59,748 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-03-04 10:09:59,758 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:09:59,758 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:09:59,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:00,128 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-04 10:10:00,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:00,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632749331] [2025-03-04 10:10:00,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632749331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:00,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:00,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 10:10:00,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073264738] [2025-03-04 10:10:00,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:00,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:10:00,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:00,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:10:00,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:10:00,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:10:00,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 487 transitions, 9465 flow. Second operand has 13 states, 13 states have (on average 23.615384615384617) internal successors, (307), 13 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:00,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:00,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:10:00,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:02,878 INFO L124 PetriNetUnfolderBase]: 8527/13527 cut-off events. [2025-03-04 10:10:02,879 INFO L125 PetriNetUnfolderBase]: For 187219/187263 co-relation queries the response was YES. [2025-03-04 10:10:02,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100204 conditions, 13527 events. 8527/13527 cut-off events. For 187219/187263 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 86814 event pairs, 1273 based on Foata normal form. 4/13513 useless extension candidates. Maximal degree in co-relation 96718. Up to 7576 conditions per place. [2025-03-04 10:10:03,033 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 391 selfloop transitions, 307 changer transitions 9/719 dead transitions. [2025-03-04 10:10:03,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 719 transitions, 15140 flow [2025-03-04 10:10:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:10:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:10:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 468 transitions. [2025-03-04 10:10:03,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.636734693877551 [2025-03-04 10:10:03,035 INFO L175 Difference]: Start difference. First operand has 181 places, 487 transitions, 9465 flow. Second operand 15 states and 468 transitions. [2025-03-04 10:10:03,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 719 transitions, 15140 flow [2025-03-04 10:10:03,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 719 transitions, 14894 flow, removed 88 selfloop flow, removed 3 redundant places. [2025-03-04 10:10:03,949 INFO L231 Difference]: Finished difference. Result has 200 places, 636 transitions, 13994 flow [2025-03-04 10:10:03,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=9315, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13994, PETRI_PLACES=200, PETRI_TRANSITIONS=636} [2025-03-04 10:10:03,950 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 152 predicate places. [2025-03-04 10:10:03,950 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 636 transitions, 13994 flow [2025-03-04 10:10:03,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 23.615384615384617) internal successors, (307), 13 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:03,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:03,950 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-04 10:10:03,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 10:10:03,950 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:10:03,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:03,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2086751562, now seen corresponding path program 6 times [2025-03-04 10:10:03,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:03,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831346218] [2025-03-04 10:10:03,951 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:10:03,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:03,959 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-03-04 10:10:03,966 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:10:03,967 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:10:03,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:10:04,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831346218] [2025-03-04 10:10:04,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831346218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381478207] [2025-03-04 10:10:04,428 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:10:04,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:04,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:04,430 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-04 10:10:04,431 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-04 10:10:04,474 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-03-04 10:10:04,494 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:10:04,494 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:10:04,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:04,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 10:10:04,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:04,509 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-04 10:10:04,680 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-04 10:10:04,717 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-04 10:10:04,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:04,806 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-04 10:10:04,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381478207] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:04,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:04,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 22 [2025-03-04 10:10:04,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058005375] [2025-03-04 10:10:04,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:04,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:10:04,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:04,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:10:04,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:10:05,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:10:05,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 636 transitions, 13994 flow. Second operand has 22 states, 22 states have (on average 24.454545454545453) internal successors, (538), 22 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:05,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:05,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:10:05,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:07,836 INFO L124 PetriNetUnfolderBase]: 9157/14477 cut-off events. [2025-03-04 10:10:07,836 INFO L125 PetriNetUnfolderBase]: For 231213/231257 co-relation queries the response was YES. [2025-03-04 10:10:07,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112404 conditions, 14477 events. 9157/14477 cut-off events. For 231213/231257 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 93426 event pairs, 1027 based on Foata normal form. 4/14463 useless extension candidates. Maximal degree in co-relation 108876. Up to 5932 conditions per place. [2025-03-04 10:10:07,985 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 264 selfloop transitions, 450 changer transitions 11/737 dead transitions. [2025-03-04 10:10:07,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 737 transitions, 16686 flow [2025-03-04 10:10:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:10:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:10:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 442 transitions. [2025-03-04 10:10:07,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6443148688046647 [2025-03-04 10:10:07,986 INFO L175 Difference]: Start difference. First operand has 200 places, 636 transitions, 13994 flow. Second operand 14 states and 442 transitions. [2025-03-04 10:10:07,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 737 transitions, 16686 flow [2025-03-04 10:10:09,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 737 transitions, 16485 flow, removed 65 selfloop flow, removed 4 redundant places. [2025-03-04 10:10:09,221 INFO L231 Difference]: Finished difference. Result has 212 places, 654 transitions, 15534 flow [2025-03-04 10:10:09,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=13795, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=428, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=15534, PETRI_PLACES=212, PETRI_TRANSITIONS=654} [2025-03-04 10:10:09,222 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 164 predicate places. [2025-03-04 10:10:09,222 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 654 transitions, 15534 flow [2025-03-04 10:10:09,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 24.454545454545453) internal successors, (538), 22 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:09,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:09,222 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-04 10:10:09,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:10:09,423 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,SelfDestructingSolverStorable26 [2025-03-04 10:10:09,423 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:10:09,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1590824232, now seen corresponding path program 7 times [2025-03-04 10:10:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:09,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109130282] [2025-03-04 10:10:09,424 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:10:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:09,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:10:09,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:10:09,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:09,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:09,741 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-04 10:10:09,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:09,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109130282] [2025-03-04 10:10:09,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109130282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:09,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:09,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 10:10:09,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001750467] [2025-03-04 10:10:09,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:09,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:10:09,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:09,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:10:09,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:10:10,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:10:10,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 654 transitions, 15534 flow. Second operand has 13 states, 13 states have (on average 23.615384615384617) internal successors, (307), 13 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:10,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:10,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:10:10,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:14,070 INFO L124 PetriNetUnfolderBase]: 11102/17516 cut-off events. [2025-03-04 10:10:14,070 INFO L125 PetriNetUnfolderBase]: For 320967/320991 co-relation queries the response was YES. [2025-03-04 10:10:14,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143290 conditions, 17516 events. 11102/17516 cut-off events. For 320967/320991 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 116133 event pairs, 1955 based on Foata normal form. 8/17508 useless extension candidates. Maximal degree in co-relation 139712. Up to 11466 conditions per place. [2025-03-04 10:10:14,266 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 605 selfloop transitions, 380 changer transitions 5/1002 dead transitions. [2025-03-04 10:10:14,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 1002 transitions, 24187 flow [2025-03-04 10:10:14,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:10:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 10:10:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 665 transitions. [2025-03-04 10:10:14,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6168831168831169 [2025-03-04 10:10:14,268 INFO L175 Difference]: Start difference. First operand has 212 places, 654 transitions, 15534 flow. Second operand 22 states and 665 transitions. [2025-03-04 10:10:14,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 1002 transitions, 24187 flow [2025-03-04 10:10:16,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 1002 transitions, 23508 flow, removed 87 selfloop flow, removed 9 redundant places. [2025-03-04 10:10:16,110 INFO L231 Difference]: Finished difference. Result has 237 places, 856 transitions, 21420 flow [2025-03-04 10:10:16,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=15075, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=21420, PETRI_PLACES=237, PETRI_TRANSITIONS=856} [2025-03-04 10:10:16,111 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 189 predicate places. [2025-03-04 10:10:16,111 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 856 transitions, 21420 flow [2025-03-04 10:10:16,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 23.615384615384617) internal successors, (307), 13 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:16,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:16,111 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-04 10:10:16,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 10:10:16,111 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:10:16,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:16,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1678598244, now seen corresponding path program 8 times [2025-03-04 10:10:16,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:16,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593877213] [2025-03-04 10:10:16,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:16,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:16,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:10:16,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-03-04 10:10:16,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:10:16,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:16,308 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-04 10:10:16,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:16,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593877213] [2025-03-04 10:10:16,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593877213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:16,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:16,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:10:16,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237800074] [2025-03-04 10:10:16,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:16,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:10:16,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:16,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:10:16,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:10:16,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:10:16,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 856 transitions, 21420 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-04 10:10:16,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:16,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:10:16,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:21,064 INFO L124 PetriNetUnfolderBase]: 11775/18568 cut-off events. [2025-03-04 10:10:21,064 INFO L125 PetriNetUnfolderBase]: For 360525/360569 co-relation queries the response was YES. [2025-03-04 10:10:21,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157313 conditions, 18568 events. 11775/18568 cut-off events. For 360525/360569 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 124567 event pairs, 1943 based on Foata normal form. 4/18554 useless extension candidates. Maximal degree in co-relation 155639. Up to 10856 conditions per place. [2025-03-04 10:10:21,409 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 487 selfloop transitions, 509 changer transitions 16/1024 dead transitions. [2025-03-04 10:10:21,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 1024 transitions, 26471 flow [2025-03-04 10:10:21,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:10:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:10:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 451 transitions. [2025-03-04 10:10:21,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6574344023323615 [2025-03-04 10:10:21,410 INFO L175 Difference]: Start difference. First operand has 237 places, 856 transitions, 21420 flow. Second operand 14 states and 451 transitions. [2025-03-04 10:10:21,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 1024 transitions, 26471 flow [2025-03-04 10:10:24,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 1024 transitions, 26202 flow, removed 130 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:24,015 INFO L231 Difference]: Finished difference. Result has 254 places, 923 transitions, 24597 flow [2025-03-04 10:10:24,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=21167, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=856, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=444, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=24597, PETRI_PLACES=254, PETRI_TRANSITIONS=923} [2025-03-04 10:10:24,017 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 206 predicate places. [2025-03-04 10:10:24,017 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 923 transitions, 24597 flow [2025-03-04 10:10:24,017 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-04 10:10:24,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:24,017 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-04 10:10:24,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 10:10:24,017 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:10:24,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:24,018 INFO L85 PathProgramCache]: Analyzing trace with hash -511555988, now seen corresponding path program 9 times [2025-03-04 10:10:24,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:24,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004710160] [2025-03-04 10:10:24,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:10:24,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:24,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-04 10:10:24,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-03-04 10:10:24,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:10:24,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:24,218 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-04 10:10:24,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:24,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004710160] [2025-03-04 10:10:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004710160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:24,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:24,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:10:24,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666596263] [2025-03-04 10:10:24,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:24,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:10:24,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:24,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:10:24,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:10:24,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:10:24,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 923 transitions, 24597 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-04 10:10:24,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:24,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:10:24,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:28,970 INFO L124 PetriNetUnfolderBase]: 12145/19181 cut-off events. [2025-03-04 10:10:28,970 INFO L125 PetriNetUnfolderBase]: For 428522/428566 co-relation queries the response was YES. [2025-03-04 10:10:29,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170090 conditions, 19181 events. 12145/19181 cut-off events. For 428522/428566 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 129029 event pairs, 1470 based on Foata normal form. 4/19167 useless extension candidates. Maximal degree in co-relation 168640. Up to 10649 conditions per place. [2025-03-04 10:10:29,528 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 479 selfloop transitions, 540 changer transitions 16/1047 dead transitions. [2025-03-04 10:10:29,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 1047 transitions, 28755 flow [2025-03-04 10:10:29,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:10:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:10:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 400 transitions. [2025-03-04 10:10:29,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6802721088435374 [2025-03-04 10:10:29,529 INFO L175 Difference]: Start difference. First operand has 254 places, 923 transitions, 24597 flow. Second operand 12 states and 400 transitions. [2025-03-04 10:10:29,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 1047 transitions, 28755 flow [2025-03-04 10:10:32,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 1047 transitions, 28158 flow, removed 237 selfloop flow, removed 4 redundant places. [2025-03-04 10:10:32,239 INFO L231 Difference]: Finished difference. Result has 266 places, 956 transitions, 26578 flow [2025-03-04 10:10:32,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=24152, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=506, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=26578, PETRI_PLACES=266, PETRI_TRANSITIONS=956} [2025-03-04 10:10:32,240 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 218 predicate places. [2025-03-04 10:10:32,240 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 956 transitions, 26578 flow [2025-03-04 10:10:32,241 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-04 10:10:32,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:32,241 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-04 10:10:32,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 10:10:32,241 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:10:32,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:32,241 INFO L85 PathProgramCache]: Analyzing trace with hash 653146808, now seen corresponding path program 1 times [2025-03-04 10:10:32,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:32,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241272801] [2025-03-04 10:10:32,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:32,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:32,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:10:32,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:10:32,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:32,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:32,519 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-04 10:10:32,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:32,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241272801] [2025-03-04 10:10:32,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241272801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:32,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:32,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:10:32,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7172551] [2025-03-04 10:10:32,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:32,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:10:32,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:32,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:10:32,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:10:32,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:10:32,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 956 transitions, 26578 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-04 10:10:32,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:32,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:10:32,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:38,723 INFO L124 PetriNetUnfolderBase]: 13789/21773 cut-off events. [2025-03-04 10:10:38,723 INFO L125 PetriNetUnfolderBase]: For 534662/534706 co-relation queries the response was YES. [2025-03-04 10:10:38,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199507 conditions, 21773 events. 13789/21773 cut-off events. For 534662/534706 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 150813 event pairs, 2637 based on Foata normal form. 4/21755 useless extension candidates. Maximal degree in co-relation 198036. Up to 17267 conditions per place. [2025-03-04 10:10:39,258 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 987 selfloop transitions, 205 changer transitions 4/1208 dead transitions. [2025-03-04 10:10:39,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 1208 transitions, 34854 flow [2025-03-04 10:10:39,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:10:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:10:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 334 transitions. [2025-03-04 10:10:39,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6816326530612244 [2025-03-04 10:10:39,259 INFO L175 Difference]: Start difference. First operand has 266 places, 956 transitions, 26578 flow. Second operand 10 states and 334 transitions. [2025-03-04 10:10:39,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 1208 transitions, 34854 flow [2025-03-04 10:10:42,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 1208 transitions, 34422 flow, removed 88 selfloop flow, removed 5 redundant places. [2025-03-04 10:10:42,303 INFO L231 Difference]: Finished difference. Result has 276 places, 1078 transitions, 30956 flow [2025-03-04 10:10:42,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=26201, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=956, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=759, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=30956, PETRI_PLACES=276, PETRI_TRANSITIONS=1078} [2025-03-04 10:10:42,305 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 228 predicate places. [2025-03-04 10:10:42,305 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 1078 transitions, 30956 flow [2025-03-04 10:10:42,305 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-04 10:10:42,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:42,305 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-04 10:10:42,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 10:10:42,305 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:10:42,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1822774834, now seen corresponding path program 2 times [2025-03-04 10:10:42,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:42,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875498291] [2025-03-04 10:10:42,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:10:42,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:42,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:10:42,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 26 statements. [2025-03-04 10:10:42,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:10:42,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:42,499 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-04 10:10:42,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:42,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875498291] [2025-03-04 10:10:42,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875498291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:42,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:42,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:10:42,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470539098] [2025-03-04 10:10:42,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:42,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:10:42,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:42,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:10:42,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:10:42,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:10:42,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 1078 transitions, 30956 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-04 10:10:42,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:42,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:10:42,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:48,181 INFO L124 PetriNetUnfolderBase]: 14071/22202 cut-off events. [2025-03-04 10:10:48,181 INFO L125 PetriNetUnfolderBase]: For 554187/554231 co-relation queries the response was YES. [2025-03-04 10:10:48,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205750 conditions, 22202 events. 14071/22202 cut-off events. For 554187/554231 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 153281 event pairs, 1738 based on Foata normal form. 4/22192 useless extension candidates. Maximal degree in co-relation 204254. Up to 12671 conditions per place. [2025-03-04 10:10:48,602 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 574 selfloop transitions, 566 changer transitions 16/1168 dead transitions. [2025-03-04 10:10:48,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 1168 transitions, 34403 flow [2025-03-04 10:10:48,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:10:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:10:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 371 transitions. [2025-03-04 10:10:48,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6883116883116883 [2025-03-04 10:10:48,603 INFO L175 Difference]: Start difference. First operand has 276 places, 1078 transitions, 30956 flow. Second operand 11 states and 371 transitions. [2025-03-04 10:10:48,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 1168 transitions, 34403 flow [2025-03-04 10:10:52,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 1168 transitions, 34052 flow, removed 167 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:52,342 INFO L231 Difference]: Finished difference. Result has 287 places, 1080 transitions, 32161 flow [2025-03-04 10:10:52,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=30625, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1078, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=557, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=32161, PETRI_PLACES=287, PETRI_TRANSITIONS=1080} [2025-03-04 10:10:52,343 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 239 predicate places. [2025-03-04 10:10:52,343 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 1080 transitions, 32161 flow [2025-03-04 10:10:52,343 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-04 10:10:52,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:52,343 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-04 10:10:52,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 10:10:52,344 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:10:52,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:52,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1767566812, now seen corresponding path program 1 times [2025-03-04 10:10:52,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:52,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466041041] [2025-03-04 10:10:52,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:52,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:52,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:10:52,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:10:52,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:52,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:52,611 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-04 10:10:52,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:52,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466041041] [2025-03-04 10:10:52,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466041041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:52,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894136008] [2025-03-04 10:10:52,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:52,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:52,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:52,614 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-04 10:10:52,615 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-04 10:10:52,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:10:52,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:10:52,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:52,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:52,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 10:10:52,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:52,701 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-04 10:10:52,864 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-04 10:10:52,888 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-04 10:10:52,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:52,920 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-04 10:10:52,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894136008] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:52,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:10:52,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 18 [2025-03-04 10:10:52,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942230304] [2025-03-04 10:10:52,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:52,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:10:52,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:52,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:10:52,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:10:53,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2025-03-04 10:10:53,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 1080 transitions, 32161 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-04 10:10:53,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:53,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2025-03-04 10:10:53,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:59,070 INFO L124 PetriNetUnfolderBase]: 14405/22778 cut-off events. [2025-03-04 10:10:59,070 INFO L125 PetriNetUnfolderBase]: For 616788/616832 co-relation queries the response was YES. [2025-03-04 10:10:59,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214977 conditions, 22778 events. 14405/22778 cut-off events. For 616788/616832 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 158704 event pairs, 2497 based on Foata normal form. 4/22768 useless extension candidates. Maximal degree in co-relation 212696. Up to 14612 conditions per place. [2025-03-04 10:10:59,673 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 701 selfloop transitions, 460 changer transitions 4/1177 dead transitions. [2025-03-04 10:10:59,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 1177 transitions, 35828 flow [2025-03-04 10:10:59,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:10:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:10:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 338 transitions. [2025-03-04 10:10:59,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.689795918367347 [2025-03-04 10:10:59,674 INFO L175 Difference]: Start difference. First operand has 287 places, 1080 transitions, 32161 flow. Second operand 10 states and 338 transitions. [2025-03-04 10:10:59,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 1177 transitions, 35828 flow