./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.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 b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:19:19,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:19:20,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:19:20,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:19:20,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:19:20,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:19:20,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:19:20,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:19:20,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:19:20,079 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:19:20,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:19:20,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:19:20,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:19:20,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:19:20,080 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:19:20,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:19:20,081 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:19:20,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:19:20,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:19:20,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:19:20,081 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:19:20,081 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:19:20,081 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:19:20,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:19:20,081 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:19:20,082 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:19:20,082 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:19:20,082 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:19:20,082 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:19:20,082 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:19:20,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:19:20,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:19:20,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:19:20,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:19:20,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:19:20,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:19:20,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:19:20,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:19:20,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:19:20,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:19:20,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:19:20,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:19:20,083 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 -> b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a [2025-03-09 01:19:20,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:19:20,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:19:20,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:19:20,328 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:19:20,328 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:19:20,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-03-09 01:19:21,493 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79170c663/e277cc57ee8344b1b8b1274af1db6582/FLAGce933dc61 [2025-03-09 01:19:21,736 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:19:21,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-03-09 01:19:21,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79170c663/e277cc57ee8344b1b8b1274af1db6582/FLAGce933dc61 [2025-03-09 01:19:21,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79170c663/e277cc57ee8344b1b8b1274af1db6582 [2025-03-09 01:19:21,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:19:21,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:19:21,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:19:21,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:19:21,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:19:21,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:19:21" (1/1) ... [2025-03-09 01:19:21,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4add3508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21, skipping insertion in model container [2025-03-09 01:19:21,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:19:21" (1/1) ... [2025-03-09 01:19:21,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:19:21,891 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:19:21,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:19:21,901 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:19:21,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:19:21,927 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:19:21,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21 WrapperNode [2025-03-09 01:19:21,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:19:21,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:19:21,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:19:21,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:19:21,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21" (1/1) ... [2025-03-09 01:19:21,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21" (1/1) ... [2025-03-09 01:19:21,950 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 159 [2025-03-09 01:19:21,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:19:21,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:19:21,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:19:21,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:19:21,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21" (1/1) ... [2025-03-09 01:19:21,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21" (1/1) ... [2025-03-09 01:19:21,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21" (1/1) ... [2025-03-09 01:19:21,972 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-09 01:19:21,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21" (1/1) ... [2025-03-09 01:19:21,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21" (1/1) ... [2025-03-09 01:19:21,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21" (1/1) ... [2025-03-09 01:19:21,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21" (1/1) ... [2025-03-09 01:19:21,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21" (1/1) ... [2025-03-09 01:19:21,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21" (1/1) ... [2025-03-09 01:19:21,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:19:21,985 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:19:21,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:19:21,986 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:19:21,987 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21" (1/1) ... [2025-03-09 01:19:21,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:19:21,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:22,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:19:22,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:19:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:19:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:19:22,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:19:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:19:22,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:19:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:19:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:19:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:19:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:19:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:19:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:19:22,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:19:22,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:19:22,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:19:22,034 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:19:22,110 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:19:22,112 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:19:22,424 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:19:22,424 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:19:22,572 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:19:22,573 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:19:22,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:19:22 BoogieIcfgContainer [2025-03-09 01:19:22,573 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:19:22,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:19:22,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:19:22,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:19:22,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:19:21" (1/3) ... [2025-03-09 01:19:22,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e94cefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:19:22, skipping insertion in model container [2025-03-09 01:19:22,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:21" (2/3) ... [2025-03-09 01:19:22,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e94cefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:19:22, skipping insertion in model container [2025-03-09 01:19:22,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:19:22" (3/3) ... [2025-03-09 01:19:22,583 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2025-03-09 01:19:22,595 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:19:22,596 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-opt-symm.wvr.c that has 3 procedures, 59 locations, 1 initial locations, 4 loop locations, and 22 error locations. [2025-03-09 01:19:22,597 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:19:22,656 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:19:22,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 66 transitions, 146 flow [2025-03-09 01:19:22,712 INFO L124 PetriNetUnfolderBase]: 8/64 cut-off events. [2025-03-09 01:19:22,714 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:19:22,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 8/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 191 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-03-09 01:19:22,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 66 transitions, 146 flow [2025-03-09 01:19:22,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 63 transitions, 138 flow [2025-03-09 01:19:22,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:19:22,743 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;@e64cdba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:19:22,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-09 01:19:22,749 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:19:22,749 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:19:22,749 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:19:22,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:22,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:19:22,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:22,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:22,755 INFO L85 PathProgramCache]: Analyzing trace with hash 475717, now seen corresponding path program 1 times [2025-03-09 01:19:22,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:22,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126973654] [2025-03-09 01:19:22,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:22,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:22,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:19:22,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:19:22,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:22,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:22,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:22,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126973654] [2025-03-09 01:19:22,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126973654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:22,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:22,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:19:22,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892058488] [2025-03-09 01:19:22,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:22,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:19:22,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:22,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:19:22,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:19:23,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:19:23,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:23,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:23,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:19:23,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:23,142 INFO L124 PetriNetUnfolderBase]: 167/384 cut-off events. [2025-03-09 01:19:23,142 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 01:19:23,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 384 events. 167/384 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1875 event pairs, 86 based on Foata normal form. 1/263 useless extension candidates. Maximal degree in co-relation 602. Up to 250 conditions per place. [2025-03-09 01:19:23,147 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 26 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-03-09 01:19:23,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 186 flow [2025-03-09 01:19:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:19:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:19:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2025-03-09 01:19:23,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6717171717171717 [2025-03-09 01:19:23,160 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 138 flow. Second operand 3 states and 133 transitions. [2025-03-09 01:19:23,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 186 flow [2025-03-09 01:19:23,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:19:23,165 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 126 flow [2025-03-09 01:19:23,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=59} [2025-03-09 01:19:23,170 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-03-09 01:19:23,171 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 126 flow [2025-03-09 01:19:23,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:23,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:23,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:19:23,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:19:23,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:23,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash 475718, now seen corresponding path program 1 times [2025-03-09 01:19:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:23,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804695413] [2025-03-09 01:19:23,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:23,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:23,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:19:23,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:19:23,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:23,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:23,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804695413] [2025-03-09 01:19:23,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804695413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:23,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:23,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:19:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529989814] [2025-03-09 01:19:23,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:23,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:23,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:23,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:23,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:19:23,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:23,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:23,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:19:23,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:23,506 INFO L124 PetriNetUnfolderBase]: 167/388 cut-off events. [2025-03-09 01:19:23,506 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:19:23,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 388 events. 167/388 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1882 event pairs, 86 based on Foata normal form. 1/266 useless extension candidates. Maximal degree in co-relation 630. Up to 258 conditions per place. [2025-03-09 01:19:23,509 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 30 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2025-03-09 01:19:23,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 202 flow [2025-03-09 01:19:23,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:19:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:19:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2025-03-09 01:19:23,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2025-03-09 01:19:23,514 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 126 flow. Second operand 3 states and 140 transitions. [2025-03-09 01:19:23,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 202 flow [2025-03-09 01:19:23,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:23,517 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 148 flow [2025-03-09 01:19:23,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2025-03-09 01:19:23,518 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2025-03-09 01:19:23,518 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 148 flow [2025-03-09 01:19:23,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:23,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:23,519 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:19:23,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:19:23,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:23,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:23,519 INFO L85 PathProgramCache]: Analyzing trace with hash 457179436, now seen corresponding path program 1 times [2025-03-09 01:19:23,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:23,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483627118] [2025-03-09 01:19:23,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:23,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:23,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:19:23,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:19:23,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:23,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:23,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:23,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483627118] [2025-03-09 01:19:23,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483627118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:23,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853664251] [2025-03-09 01:19:23,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:23,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:23,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:23,723 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:23,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:19:23,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:19:23,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:19:23,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:23,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:23,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:19:23,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:23,814 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 6 treesize of output 5 [2025-03-09 01:19:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:23,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:23,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853664251] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:23,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:23,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-03-09 01:19:23,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375854360] [2025-03-09 01:19:23,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:23,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:19:23,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:23,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:19:23,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:19:24,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:19:24,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 148 flow. Second operand has 9 states, 9 states have (on average 35.666666666666664) internal successors, (321), 9 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:24,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:24,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:19:24,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:24,299 INFO L124 PetriNetUnfolderBase]: 173/406 cut-off events. [2025-03-09 01:19:24,299 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:19:24,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 406 events. 173/406 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1962 event pairs, 86 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 665. Up to 261 conditions per place. [2025-03-09 01:19:24,304 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 36 selfloop transitions, 16 changer transitions 0/81 dead transitions. [2025-03-09 01:19:24,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 319 flow [2025-03-09 01:19:24,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 262 transitions. [2025-03-09 01:19:24,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6616161616161617 [2025-03-09 01:19:24,307 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 148 flow. Second operand 6 states and 262 transitions. [2025-03-09 01:19:24,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 319 flow [2025-03-09 01:19:24,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:24,309 INFO L231 Difference]: Finished difference. Result has 64 places, 73 transitions, 260 flow [2025-03-09 01:19:24,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2025-03-09 01:19:24,310 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2025-03-09 01:19:24,310 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 73 transitions, 260 flow [2025-03-09 01:19:24,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.666666666666664) internal successors, (321), 9 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:24,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:24,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:24,320 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-09 01:19:24,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:24,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:24,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:24,515 INFO L85 PathProgramCache]: Analyzing trace with hash -951041298, now seen corresponding path program 1 times [2025-03-09 01:19:24,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:24,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84384769] [2025-03-09 01:19:24,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:24,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:24,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:19:24,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:19:24,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:24,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:19:24,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:24,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84384769] [2025-03-09 01:19:24,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84384769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:24,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520471454] [2025-03-09 01:19:24,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:24,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:24,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:24,605 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:24,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:19:24,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:19:24,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:19:24,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:24,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:24,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:19:24,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:19:24,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:19:24,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520471454] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:24,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:24,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-09 01:19:24,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172042052] [2025-03-09 01:19:24,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:24,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:19:24,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:24,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:19:24,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:19:24,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-03-09 01:19:24,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 73 transitions, 260 flow. Second operand has 8 states, 8 states have (on average 38.125) internal successors, (305), 8 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:24,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:24,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-03-09 01:19:24,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:24,836 INFO L124 PetriNetUnfolderBase]: 167/400 cut-off events. [2025-03-09 01:19:24,836 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-09 01:19:24,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 400 events. 167/400 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1865 event pairs, 86 based on Foata normal form. 6/286 useless extension candidates. Maximal degree in co-relation 654. Up to 254 conditions per place. [2025-03-09 01:19:24,837 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 30 selfloop transitions, 14 changer transitions 0/75 dead transitions. [2025-03-09 01:19:24,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 75 transitions, 322 flow [2025-03-09 01:19:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 264 transitions. [2025-03-09 01:19:24,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-09 01:19:24,839 INFO L175 Difference]: Start difference. First operand has 64 places, 73 transitions, 260 flow. Second operand 6 states and 264 transitions. [2025-03-09 01:19:24,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 75 transitions, 322 flow [2025-03-09 01:19:24,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 75 transitions, 306 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:24,840 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 246 flow [2025-03-09 01:19:24,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2025-03-09 01:19:24,841 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-03-09 01:19:24,841 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 246 flow [2025-03-09 01:19:24,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.125) internal successors, (305), 8 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:24,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:24,842 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-09 01:19:24,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:25,042 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,SelfDestructingSolverStorable3 [2025-03-09 01:19:25,043 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:25,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash -995953442, now seen corresponding path program 2 times [2025-03-09 01:19:25,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:25,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738118594] [2025-03-09 01:19:25,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:25,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:25,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 01:19:25,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:19:25,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:25,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:25,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:25,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738118594] [2025-03-09 01:19:25,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738118594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:25,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956318801] [2025-03-09 01:19:25,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:25,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:25,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:25,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:25,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:19:25,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 01:19:25,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:19:25,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:25,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:25,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:19:25,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:25,365 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 6 treesize of output 5 [2025-03-09 01:19:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:25,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:25,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956318801] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:25,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:25,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-03-09 01:19:25,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171550964] [2025-03-09 01:19:25,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:25,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:19:25,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:25,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:19:25,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:19:26,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:19:26,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 246 flow. Second operand has 18 states, 18 states have (on average 35.833333333333336) internal successors, (645), 18 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:26,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:26,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:19:26,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:26,489 INFO L124 PetriNetUnfolderBase]: 169/404 cut-off events. [2025-03-09 01:19:26,490 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-03-09 01:19:26,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 404 events. 169/404 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1879 event pairs, 86 based on Foata normal form. 4/288 useless extension candidates. Maximal degree in co-relation 672. Up to 251 conditions per place. [2025-03-09 01:19:26,492 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 31 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2025-03-09 01:19:26,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 392 flow [2025-03-09 01:19:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:19:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:19:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 360 transitions. [2025-03-09 01:19:26,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-09 01:19:26,493 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 246 flow. Second operand 9 states and 360 transitions. [2025-03-09 01:19:26,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 392 flow [2025-03-09 01:19:26,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 79 transitions, 350 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-09 01:19:26,495 INFO L231 Difference]: Finished difference. Result has 69 places, 73 transitions, 276 flow [2025-03-09 01:19:26,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=276, PETRI_PLACES=69, PETRI_TRANSITIONS=73} [2025-03-09 01:19:26,495 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2025-03-09 01:19:26,495 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 73 transitions, 276 flow [2025-03-09 01:19:26,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 35.833333333333336) internal successors, (645), 18 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:26,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:26,496 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:26,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:19:26,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:26,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:26,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:26,700 INFO L85 PathProgramCache]: Analyzing trace with hash 802770748, now seen corresponding path program 2 times [2025-03-09 01:19:26,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:26,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766751272] [2025-03-09 01:19:26,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:26,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:26,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:19:26,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 23 statements. [2025-03-09 01:19:26,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:19:26,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-09 01:19:26,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:26,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766751272] [2025-03-09 01:19:26,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766751272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:26,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:26,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:19:26,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325350886] [2025-03-09 01:19:26,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:26,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:26,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:26,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:26,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:26,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 66 [2025-03-09 01:19:26,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 73 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:26,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:26,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 66 [2025-03-09 01:19:26,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:26,881 INFO L124 PetriNetUnfolderBase]: 240/532 cut-off events. [2025-03-09 01:19:26,881 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-09 01:19:26,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 532 events. 240/532 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2668 event pairs, 139 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 946. Up to 362 conditions per place. [2025-03-09 01:19:26,884 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 42 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2025-03-09 01:19:26,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 362 flow [2025-03-09 01:19:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-03-09 01:19:26,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-03-09 01:19:26,885 INFO L175 Difference]: Start difference. First operand has 69 places, 73 transitions, 276 flow. Second operand 5 states and 170 transitions. [2025-03-09 01:19:26,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 362 flow [2025-03-09 01:19:26,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 325 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-09 01:19:26,887 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 241 flow [2025-03-09 01:19:26,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2025-03-09 01:19:26,887 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2025-03-09 01:19:26,888 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 241 flow [2025-03-09 01:19:26,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:26,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:26,888 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:26,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:19:26,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:26,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:26,888 INFO L85 PathProgramCache]: Analyzing trace with hash 802770749, now seen corresponding path program 1 times [2025-03-09 01:19:26,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:26,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77416024] [2025-03-09 01:19:26,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:26,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:26,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:19:26,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:19:26,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:26,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:19:27,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:27,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77416024] [2025-03-09 01:19:27,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77416024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:27,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304132180] [2025-03-09 01:19:27,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:27,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:27,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:27,007 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:27,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:19:27,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:19:27,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:19:27,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:27,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:27,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:19:27,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:19:27,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:19:27,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304132180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:27,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:27,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-09 01:19:27,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730734319] [2025-03-09 01:19:27,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:27,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:19:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:27,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:19:27,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:19:27,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-03-09 01:19:27,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 241 flow. Second operand has 17 states, 17 states have (on average 38.05882352941177) internal successors, (647), 17 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:27,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:27,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-03-09 01:19:27,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:27,333 INFO L124 PetriNetUnfolderBase]: 167/384 cut-off events. [2025-03-09 01:19:27,333 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:19:27,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 384 events. 167/384 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1671 event pairs, 86 based on Foata normal form. 2/284 useless extension candidates. Maximal degree in co-relation 616. Up to 254 conditions per place. [2025-03-09 01:19:27,335 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 32 selfloop transitions, 16 changer transitions 0/73 dead transitions. [2025-03-09 01:19:27,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 348 flow [2025-03-09 01:19:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:19:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:19:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 338 transitions. [2025-03-09 01:19:27,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6401515151515151 [2025-03-09 01:19:27,336 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 241 flow. Second operand 8 states and 338 transitions. [2025-03-09 01:19:27,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 348 flow [2025-03-09 01:19:27,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 343 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:27,338 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 255 flow [2025-03-09 01:19:27,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=255, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2025-03-09 01:19:27,338 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2025-03-09 01:19:27,339 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 255 flow [2025-03-09 01:19:27,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 38.05882352941177) internal successors, (647), 17 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:27,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:27,339 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:27,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:27,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:27,540 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:27,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:27,541 INFO L85 PathProgramCache]: Analyzing trace with hash -138997673, now seen corresponding path program 2 times [2025-03-09 01:19:27,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:27,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943180500] [2025-03-09 01:19:27,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:27,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:27,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:19:27,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 27 statements. [2025-03-09 01:19:27,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:19:27,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:27,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943180500] [2025-03-09 01:19:27,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943180500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:27,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:27,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:19:27,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790339368] [2025-03-09 01:19:27,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:27,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:27,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:27,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:27,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:27,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:19:27,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:27,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:27,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:19:27,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:27,859 INFO L124 PetriNetUnfolderBase]: 349/805 cut-off events. [2025-03-09 01:19:27,859 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-09 01:19:27,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 805 events. 349/805 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4269 event pairs, 112 based on Foata normal form. 26/613 useless extension candidates. Maximal degree in co-relation 1317. Up to 309 conditions per place. [2025-03-09 01:19:27,862 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 58 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-03-09 01:19:27,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 86 transitions, 422 flow [2025-03-09 01:19:27,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2025-03-09 01:19:27,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-03-09 01:19:27,864 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 255 flow. Second operand 6 states and 243 transitions. [2025-03-09 01:19:27,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 86 transitions, 422 flow [2025-03-09 01:19:27,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 86 transitions, 390 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-09 01:19:27,865 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 243 flow [2025-03-09 01:19:27,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2025-03-09 01:19:27,866 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-03-09 01:19:27,866 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 243 flow [2025-03-09 01:19:27,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:27,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:27,866 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:27,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:19:27,867 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:27,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:27,867 INFO L85 PathProgramCache]: Analyzing trace with hash -13960160, now seen corresponding path program 1 times [2025-03-09 01:19:27,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:27,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083167349] [2025-03-09 01:19:27,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:27,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:27,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:19:27,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:19:27,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:27,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-09 01:19:27,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:27,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083167349] [2025-03-09 01:19:27,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083167349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:27,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:27,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:19:27,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971341726] [2025-03-09 01:19:27,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:27,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:27,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:27,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:27,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:27,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 66 [2025-03-09 01:19:27,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:27,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:27,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 66 [2025-03-09 01:19:27,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:28,092 INFO L124 PetriNetUnfolderBase]: 447/902 cut-off events. [2025-03-09 01:19:28,092 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-03-09 01:19:28,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1774 conditions, 902 events. 447/902 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4641 event pairs, 275 based on Foata normal form. 0/827 useless extension candidates. Maximal degree in co-relation 1667. Up to 677 conditions per place. [2025-03-09 01:19:28,096 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 44 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-03-09 01:19:28,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 327 flow [2025-03-09 01:19:28,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2025-03-09 01:19:28,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-09 01:19:28,098 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 243 flow. Second operand 4 states and 143 transitions. [2025-03-09 01:19:28,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 327 flow [2025-03-09 01:19:28,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 319 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:19:28,099 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 231 flow [2025-03-09 01:19:28,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2025-03-09 01:19:28,100 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2025-03-09 01:19:28,100 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 231 flow [2025-03-09 01:19:28,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:28,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:28,100 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:28,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:19:28,101 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:28,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:28,101 INFO L85 PathProgramCache]: Analyzing trace with hash -13960159, now seen corresponding path program 1 times [2025-03-09 01:19:28,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:28,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29835375] [2025-03-09 01:19:28,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:28,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:28,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:19:28,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:19:28,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:28,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 01:19:28,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:28,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29835375] [2025-03-09 01:19:28,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29835375] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:28,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979478128] [2025-03-09 01:19:28,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:28,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:28,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:28,350 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:28,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:19:28,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:19:28,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:19:28,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:28,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:28,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:19:28,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:28,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:28,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-09 01:19:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:28,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979478128] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:28,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:28,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-03-09 01:19:28,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709169925] [2025-03-09 01:19:28,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:28,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 01:19:28,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:28,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 01:19:28,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:19:29,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-03-09 01:19:29,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 231 flow. Second operand has 21 states, 21 states have (on average 34.904761904761905) internal successors, (733), 21 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:29,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:29,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-03-09 01:19:29,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:29,606 INFO L124 PetriNetUnfolderBase]: 418/894 cut-off events. [2025-03-09 01:19:29,606 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-09 01:19:29,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 894 events. 418/894 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4392 event pairs, 77 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 1596. Up to 252 conditions per place. [2025-03-09 01:19:29,611 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 70 selfloop transitions, 15 changer transitions 0/103 dead transitions. [2025-03-09 01:19:29,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 103 transitions, 497 flow [2025-03-09 01:19:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:19:29,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:19:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 415 transitions. [2025-03-09 01:19:29,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6287878787878788 [2025-03-09 01:19:29,614 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 231 flow. Second operand 10 states and 415 transitions. [2025-03-09 01:19:29,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 103 transitions, 497 flow [2025-03-09 01:19:29,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 103 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:29,616 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 273 flow [2025-03-09 01:19:29,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=273, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2025-03-09 01:19:29,618 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2025-03-09 01:19:29,618 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 273 flow [2025-03-09 01:19:29,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 34.904761904761905) internal successors, (733), 21 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:29,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:29,619 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:29,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:29,819 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,SelfDestructingSolverStorable9 [2025-03-09 01:19:29,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:29,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:29,820 INFO L85 PathProgramCache]: Analyzing trace with hash -484076634, now seen corresponding path program 1 times [2025-03-09 01:19:29,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:29,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460003804] [2025-03-09 01:19:29,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:29,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:29,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:19:29,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:19:29,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:29,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 01:19:30,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460003804] [2025-03-09 01:19:30,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460003804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551448316] [2025-03-09 01:19:30,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:30,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:30,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:30,023 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:30,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:19:30,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:19:30,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:19:30,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:30,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:30,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:19:30,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:30,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:30,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:30,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551448316] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:30,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:19:30,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 21 [2025-03-09 01:19:30,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131392171] [2025-03-09 01:19:30,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:30,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:19:30,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:30,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:19:30,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:19:30,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:19:30,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 273 flow. Second operand has 10 states, 10 states have (on average 34.0) internal successors, (340), 10 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:30,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:30,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:19:30,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:30,708 INFO L124 PetriNetUnfolderBase]: 571/1235 cut-off events. [2025-03-09 01:19:30,708 INFO L125 PetriNetUnfolderBase]: For 387/387 co-relation queries the response was YES. [2025-03-09 01:19:30,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2502 conditions, 1235 events. 571/1235 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6964 event pairs, 153 based on Foata normal form. 0/1080 useless extension candidates. Maximal degree in co-relation 2384. Up to 556 conditions per place. [2025-03-09 01:19:30,714 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 55 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2025-03-09 01:19:30,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 77 transitions, 439 flow [2025-03-09 01:19:30,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2025-03-09 01:19:30,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6242424242424243 [2025-03-09 01:19:30,715 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 273 flow. Second operand 5 states and 206 transitions. [2025-03-09 01:19:30,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 77 transitions, 439 flow [2025-03-09 01:19:30,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 77 transitions, 414 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-09 01:19:30,717 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 271 flow [2025-03-09 01:19:30,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2025-03-09 01:19:30,717 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2025-03-09 01:19:30,717 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 271 flow [2025-03-09 01:19:30,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.0) internal successors, (340), 10 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:30,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:30,718 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:30,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:30,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:30,922 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:30,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:30,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2121473337, now seen corresponding path program 1 times [2025-03-09 01:19:30,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:30,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835517798] [2025-03-09 01:19:30,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:30,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:30,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:19:30,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:19:30,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:30,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 01:19:31,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:31,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835517798] [2025-03-09 01:19:31,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835517798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:31,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308851512] [2025-03-09 01:19:31,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:31,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:31,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:31,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:31,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:19:31,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:19:31,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:19:31,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:31,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:31,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 01:19:31,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:31,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:31,262 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 6 treesize of output 5 [2025-03-09 01:19:31,329 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:31,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:19:31,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:19:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:31,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:31,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308851512] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:31,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:19:31,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 8] total 21 [2025-03-09 01:19:31,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677761976] [2025-03-09 01:19:31,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:31,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:19:31,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:31,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:19:31,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:19:32,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-03-09 01:19:32,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 271 flow. Second operand has 10 states, 10 states have (on average 35.0) internal successors, (350), 10 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:32,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:32,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-03-09 01:19:32,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:32,330 INFO L124 PetriNetUnfolderBase]: 523/1147 cut-off events. [2025-03-09 01:19:32,330 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2025-03-09 01:19:32,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 1147 events. 523/1147 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6354 event pairs, 151 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 2345. Up to 479 conditions per place. [2025-03-09 01:19:32,334 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 53 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2025-03-09 01:19:32,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 77 transitions, 433 flow [2025-03-09 01:19:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2025-03-09 01:19:32,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-03-09 01:19:32,335 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 271 flow. Second operand 6 states and 243 transitions. [2025-03-09 01:19:32,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 77 transitions, 433 flow [2025-03-09 01:19:32,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 427 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:32,337 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 288 flow [2025-03-09 01:19:32,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2025-03-09 01:19:32,338 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2025-03-09 01:19:32,338 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 288 flow [2025-03-09 01:19:32,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.0) internal successors, (350), 10 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:32,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:32,338 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:32,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:32,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:32,543 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:32,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:32,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1075034465, now seen corresponding path program 1 times [2025-03-09 01:19:32,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:32,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129059309] [2025-03-09 01:19:32,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:32,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:32,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:19:32,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:19:32,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:32,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:32,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:32,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129059309] [2025-03-09 01:19:32,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129059309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:32,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:32,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:32,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458676180] [2025-03-09 01:19:32,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:32,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:32,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:32,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:32,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:32,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-03-09 01:19:32,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:32,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:32,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-03-09 01:19:32,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:32,723 INFO L124 PetriNetUnfolderBase]: 709/1577 cut-off events. [2025-03-09 01:19:32,723 INFO L125 PetriNetUnfolderBase]: For 1039/1039 co-relation queries the response was YES. [2025-03-09 01:19:32,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3511 conditions, 1577 events. 709/1577 cut-off events. For 1039/1039 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 9411 event pairs, 283 based on Foata normal form. 36/1501 useless extension candidates. Maximal degree in co-relation 3397. Up to 700 conditions per place. [2025-03-09 01:19:32,729 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 67 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-03-09 01:19:32,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 510 flow [2025-03-09 01:19:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-03-09 01:19:32,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7537878787878788 [2025-03-09 01:19:32,731 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 288 flow. Second operand 4 states and 199 transitions. [2025-03-09 01:19:32,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 510 flow [2025-03-09 01:19:32,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 90 transitions, 498 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:19:32,734 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 295 flow [2025-03-09 01:19:32,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2025-03-09 01:19:32,735 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2025-03-09 01:19:32,735 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 295 flow [2025-03-09 01:19:32,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:32,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:32,735 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:32,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:19:32,736 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:32,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1342100486, now seen corresponding path program 1 times [2025-03-09 01:19:32,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:32,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984732588] [2025-03-09 01:19:32,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:32,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:32,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:19:32,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:19:32,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:32,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 01:19:32,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:32,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984732588] [2025-03-09 01:19:32,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984732588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:32,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99232308] [2025-03-09 01:19:32,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:32,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:32,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:32,964 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:32,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:19:33,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:19:33,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:19:33,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:33,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:33,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 01:19:33,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:33,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:33,051 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 6 treesize of output 5 [2025-03-09 01:19:33,122 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:19:33,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-09 01:19:33,140 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:33,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:19:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:33,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:33,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99232308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:33,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:33,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2025-03-09 01:19:33,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628702844] [2025-03-09 01:19:33,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:33,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:19:33,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:33,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:19:33,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:19:34,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2025-03-09 01:19:34,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 295 flow. Second operand has 26 states, 26 states have (on average 32.46153846153846) internal successors, (844), 26 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:34,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:34,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2025-03-09 01:19:34,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:35,465 INFO L124 PetriNetUnfolderBase]: 1480/2923 cut-off events. [2025-03-09 01:19:35,465 INFO L125 PetriNetUnfolderBase]: For 2285/2285 co-relation queries the response was YES. [2025-03-09 01:19:35,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7019 conditions, 2923 events. 1480/2923 cut-off events. For 2285/2285 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 16788 event pairs, 95 based on Foata normal form. 108/2925 useless extension candidates. Maximal degree in co-relation 6905. Up to 631 conditions per place. [2025-03-09 01:19:35,475 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 117 selfloop transitions, 13 changer transitions 0/147 dead transitions. [2025-03-09 01:19:35,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 147 transitions, 826 flow [2025-03-09 01:19:35,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:19:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:19:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 513 transitions. [2025-03-09 01:19:35,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5979020979020979 [2025-03-09 01:19:35,477 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 295 flow. Second operand 13 states and 513 transitions. [2025-03-09 01:19:35,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 147 transitions, 826 flow [2025-03-09 01:19:35,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 147 transitions, 816 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:35,484 INFO L231 Difference]: Finished difference. Result has 86 places, 67 transitions, 351 flow [2025-03-09 01:19:35,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=351, PETRI_PLACES=86, PETRI_TRANSITIONS=67} [2025-03-09 01:19:35,485 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 24 predicate places. [2025-03-09 01:19:35,485 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 67 transitions, 351 flow [2025-03-09 01:19:35,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 32.46153846153846) internal successors, (844), 26 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:35,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:35,486 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:35,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:35,690 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-09 01:19:35,690 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:35,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:35,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1452812015, now seen corresponding path program 1 times [2025-03-09 01:19:35,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:35,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011390257] [2025-03-09 01:19:35,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:35,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:35,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:19:35,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:19:35,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:35,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:35,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:35,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011390257] [2025-03-09 01:19:35,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011390257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:35,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:35,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:35,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116564589] [2025-03-09 01:19:35,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:35,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:35,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:35,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:35,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:35,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-03-09 01:19:35,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 67 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:35,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:35,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-03-09 01:19:35,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:36,004 INFO L124 PetriNetUnfolderBase]: 1878/3917 cut-off events. [2025-03-09 01:19:36,005 INFO L125 PetriNetUnfolderBase]: For 3381/3381 co-relation queries the response was YES. [2025-03-09 01:19:36,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9231 conditions, 3917 events. 1878/3917 cut-off events. For 3381/3381 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 26723 event pairs, 1011 based on Foata normal form. 93/3827 useless extension candidates. Maximal degree in co-relation 9107. Up to 2100 conditions per place. [2025-03-09 01:19:36,026 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 75 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2025-03-09 01:19:36,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 98 transitions, 682 flow [2025-03-09 01:19:36,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2025-03-09 01:19:36,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7424242424242424 [2025-03-09 01:19:36,028 INFO L175 Difference]: Start difference. First operand has 86 places, 67 transitions, 351 flow. Second operand 4 states and 196 transitions. [2025-03-09 01:19:36,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 98 transitions, 682 flow [2025-03-09 01:19:36,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 98 transitions, 673 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:36,035 INFO L231 Difference]: Finished difference. Result has 88 places, 68 transitions, 359 flow [2025-03-09 01:19:36,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=359, PETRI_PLACES=88, PETRI_TRANSITIONS=68} [2025-03-09 01:19:36,036 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 26 predicate places. [2025-03-09 01:19:36,036 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 68 transitions, 359 flow [2025-03-09 01:19:36,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:36,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:36,036 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:36,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:19:36,036 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:36,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:36,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1694100285, now seen corresponding path program 1 times [2025-03-09 01:19:36,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:36,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780259873] [2025-03-09 01:19:36,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:36,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:36,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 01:19:36,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:19:36,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:36,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:36,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:36,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780259873] [2025-03-09 01:19:36,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780259873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:36,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:36,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:36,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116860660] [2025-03-09 01:19:36,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:36,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:36,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:36,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:36,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:36,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:19:36,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 68 transitions, 359 flow. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:36,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:36,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:19:36,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:36,451 INFO L124 PetriNetUnfolderBase]: 2322/4627 cut-off events. [2025-03-09 01:19:36,451 INFO L125 PetriNetUnfolderBase]: For 4642/4642 co-relation queries the response was YES. [2025-03-09 01:19:36,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11604 conditions, 4627 events. 2322/4627 cut-off events. For 4642/4642 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 30628 event pairs, 1237 based on Foata normal form. 5/4376 useless extension candidates. Maximal degree in co-relation 11479. Up to 2925 conditions per place. [2025-03-09 01:19:36,465 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 78 selfloop transitions, 5 changer transitions 2/104 dead transitions. [2025-03-09 01:19:36,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 104 transitions, 655 flow [2025-03-09 01:19:36,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2025-03-09 01:19:36,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2025-03-09 01:19:36,467 INFO L175 Difference]: Start difference. First operand has 88 places, 68 transitions, 359 flow. Second operand 5 states and 235 transitions. [2025-03-09 01:19:36,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 104 transitions, 655 flow [2025-03-09 01:19:36,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 104 transitions, 652 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:36,474 INFO L231 Difference]: Finished difference. Result has 93 places, 69 transitions, 378 flow [2025-03-09 01:19:36,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=378, PETRI_PLACES=93, PETRI_TRANSITIONS=69} [2025-03-09 01:19:36,475 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 31 predicate places. [2025-03-09 01:19:36,475 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 69 transitions, 378 flow [2025-03-09 01:19:36,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:36,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:36,476 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:36,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:19:36,476 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:36,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:36,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1829923275, now seen corresponding path program 2 times [2025-03-09 01:19:36,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:36,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526408616] [2025-03-09 01:19:36,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:36,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:36,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 01:19:36,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 37 statements. [2025-03-09 01:19:36,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:19:36,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:36,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:36,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526408616] [2025-03-09 01:19:36,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526408616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:36,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:36,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:19:36,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454468467] [2025-03-09 01:19:36,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:36,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:19:36,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:36,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:19:36,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:19:36,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-03-09 01:19:36,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 69 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:36,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:36,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-03-09 01:19:36,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:36,778 INFO L124 PetriNetUnfolderBase]: 2013/4145 cut-off events. [2025-03-09 01:19:36,778 INFO L125 PetriNetUnfolderBase]: For 5104/5104 co-relation queries the response was YES. [2025-03-09 01:19:36,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10682 conditions, 4145 events. 2013/4145 cut-off events. For 5104/5104 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 28684 event pairs, 810 based on Foata normal form. 10/4017 useless extension candidates. Maximal degree in co-relation 10554. Up to 1935 conditions per place. [2025-03-09 01:19:36,792 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 67 selfloop transitions, 3 changer transitions 1/93 dead transitions. [2025-03-09 01:19:36,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 93 transitions, 655 flow [2025-03-09 01:19:36,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:19:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:19:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-03-09 01:19:36,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2025-03-09 01:19:36,794 INFO L175 Difference]: Start difference. First operand has 93 places, 69 transitions, 378 flow. Second operand 3 states and 156 transitions. [2025-03-09 01:19:36,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 93 transitions, 655 flow [2025-03-09 01:19:36,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 643 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:36,801 INFO L231 Difference]: Finished difference. Result has 93 places, 71 transitions, 389 flow [2025-03-09 01:19:36,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=93, PETRI_TRANSITIONS=71} [2025-03-09 01:19:36,801 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 31 predicate places. [2025-03-09 01:19:36,801 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 71 transitions, 389 flow [2025-03-09 01:19:36,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:36,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:36,802 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:36,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:19:36,802 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:36,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:36,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1262766442, now seen corresponding path program 1 times [2025-03-09 01:19:36,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:36,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30256800] [2025-03-09 01:19:36,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:36,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:36,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 01:19:36,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:19:36,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:36,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:36,987 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 01:19:36,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:36,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30256800] [2025-03-09 01:19:36,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30256800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:36,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310050639] [2025-03-09 01:19:36,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:36,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:36,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:36,990 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:36,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:19:37,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 01:19:37,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:19:37,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:37,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:37,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:19:37,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:37,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:37,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-09 01:19:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:37,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310050639] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:37,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:37,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 24 [2025-03-09 01:19:37,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277050874] [2025-03-09 01:19:37,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:37,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 01:19:37,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:37,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 01:19:37,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:19:37,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:19:37,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 71 transitions, 389 flow. Second operand has 25 states, 25 states have (on average 34.48) internal successors, (862), 25 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:37,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:37,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:19:37,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:39,308 INFO L124 PetriNetUnfolderBase]: 7326/14989 cut-off events. [2025-03-09 01:19:39,308 INFO L125 PetriNetUnfolderBase]: For 15570/15570 co-relation queries the response was YES. [2025-03-09 01:19:39,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40281 conditions, 14989 events. 7326/14989 cut-off events. For 15570/15570 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 120782 event pairs, 576 based on Foata normal form. 297/14860 useless extension candidates. Maximal degree in co-relation 40152. Up to 3022 conditions per place. [2025-03-09 01:19:39,369 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 136 selfloop transitions, 17 changer transitions 0/171 dead transitions. [2025-03-09 01:19:39,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 171 transitions, 1237 flow [2025-03-09 01:19:39,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:19:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:19:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 504 transitions. [2025-03-09 01:19:39,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-09 01:19:39,371 INFO L175 Difference]: Start difference. First operand has 93 places, 71 transitions, 389 flow. Second operand 12 states and 504 transitions. [2025-03-09 01:19:39,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 171 transitions, 1237 flow [2025-03-09 01:19:39,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 171 transitions, 1227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:39,391 INFO L231 Difference]: Finished difference. Result has 107 places, 75 transitions, 474 flow [2025-03-09 01:19:39,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=474, PETRI_PLACES=107, PETRI_TRANSITIONS=75} [2025-03-09 01:19:39,392 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 45 predicate places. [2025-03-09 01:19:39,392 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 75 transitions, 474 flow [2025-03-09 01:19:39,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 34.48) internal successors, (862), 25 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:39,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:39,393 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:39,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:39,597 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,SelfDestructingSolverStorable17 [2025-03-09 01:19:39,597 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:39,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:39,597 INFO L85 PathProgramCache]: Analyzing trace with hash -491053609, now seen corresponding path program 1 times [2025-03-09 01:19:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:39,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634460581] [2025-03-09 01:19:39,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:39,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:39,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 01:19:39,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:19:39,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:39,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 01:19:39,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:39,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634460581] [2025-03-09 01:19:39,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634460581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:39,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536716543] [2025-03-09 01:19:39,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:39,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:39,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:39,859 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:39,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:19:39,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 01:19:39,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:19:39,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:39,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:39,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 01:19:39,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:39,955 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 6 treesize of output 5 [2025-03-09 01:19:39,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:40,018 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:19:40,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-09 01:19:40,032 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:40,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:19:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:40,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:40,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536716543] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:40,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:40,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2025-03-09 01:19:40,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360407383] [2025-03-09 01:19:40,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:40,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:19:40,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:40,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:19:40,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:19:41,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2025-03-09 01:19:41,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 75 transitions, 474 flow. Second operand has 26 states, 26 states have (on average 33.57692307692308) internal successors, (873), 26 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:41,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:41,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2025-03-09 01:19:41,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:43,013 INFO L124 PetriNetUnfolderBase]: 6805/14466 cut-off events. [2025-03-09 01:19:43,013 INFO L125 PetriNetUnfolderBase]: For 18583/18583 co-relation queries the response was YES. [2025-03-09 01:19:43,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38847 conditions, 14466 events. 6805/14466 cut-off events. For 18583/18583 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 118252 event pairs, 959 based on Foata normal form. 297/14345 useless extension candidates. Maximal degree in co-relation 38704. Up to 2783 conditions per place. [2025-03-09 01:19:43,158 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 133 selfloop transitions, 13 changer transitions 0/166 dead transitions. [2025-03-09 01:19:43,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 166 transitions, 1253 flow [2025-03-09 01:19:43,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:19:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:19:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 511 transitions. [2025-03-09 01:19:43,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5955710955710956 [2025-03-09 01:19:43,159 INFO L175 Difference]: Start difference. First operand has 107 places, 75 transitions, 474 flow. Second operand 13 states and 511 transitions. [2025-03-09 01:19:43,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 166 transitions, 1253 flow [2025-03-09 01:19:43,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 166 transitions, 1232 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:19:43,183 INFO L231 Difference]: Finished difference. Result has 117 places, 76 transitions, 503 flow [2025-03-09 01:19:43,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=503, PETRI_PLACES=117, PETRI_TRANSITIONS=76} [2025-03-09 01:19:43,184 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 55 predicate places. [2025-03-09 01:19:43,184 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 76 transitions, 503 flow [2025-03-09 01:19:43,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 33.57692307692308) internal successors, (873), 26 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:43,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:43,184 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:43,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:19:43,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:43,385 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:43,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:43,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1412828195, now seen corresponding path program 1 times [2025-03-09 01:19:43,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:43,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363697262] [2025-03-09 01:19:43,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:43,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:43,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:19:43,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:19:43,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:43,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:43,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:43,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363697262] [2025-03-09 01:19:43,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363697262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:43,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:43,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:43,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235501472] [2025-03-09 01:19:43,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:43,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:43,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:43,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:43,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:43,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:19:43,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 76 transitions, 503 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:43,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:43,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:19:43,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:44,808 INFO L124 PetriNetUnfolderBase]: 8969/18712 cut-off events. [2025-03-09 01:19:44,808 INFO L125 PetriNetUnfolderBase]: For 31080/31080 co-relation queries the response was YES. [2025-03-09 01:19:44,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52232 conditions, 18712 events. 8969/18712 cut-off events. For 31080/31080 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 159218 event pairs, 4333 based on Foata normal form. 0/18076 useless extension candidates. Maximal degree in co-relation 52089. Up to 12905 conditions per place. [2025-03-09 01:19:44,885 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 82 selfloop transitions, 4 changer transitions 0/108 dead transitions. [2025-03-09 01:19:44,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 108 transitions, 844 flow [2025-03-09 01:19:44,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2025-03-09 01:19:44,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-03-09 01:19:44,886 INFO L175 Difference]: Start difference. First operand has 117 places, 76 transitions, 503 flow. Second operand 4 states and 192 transitions. [2025-03-09 01:19:44,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 108 transitions, 844 flow [2025-03-09 01:19:44,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 108 transitions, 819 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-03-09 01:19:44,926 INFO L231 Difference]: Finished difference. Result has 112 places, 80 transitions, 548 flow [2025-03-09 01:19:44,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=548, PETRI_PLACES=112, PETRI_TRANSITIONS=80} [2025-03-09 01:19:44,927 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 50 predicate places. [2025-03-09 01:19:44,927 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 80 transitions, 548 flow [2025-03-09 01:19:44,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:44,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:44,927 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:44,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:19:44,927 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:44,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:44,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1501104955, now seen corresponding path program 2 times [2025-03-09 01:19:44,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:44,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392563797] [2025-03-09 01:19:44,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:44,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:44,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 01:19:44,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 42 statements. [2025-03-09 01:19:44,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:19:44,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:44,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:44,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392563797] [2025-03-09 01:19:44,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392563797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:44,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:44,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:44,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466254094] [2025-03-09 01:19:44,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:44,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:44,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:44,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:44,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:44,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:19:44,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 80 transitions, 548 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:44,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:44,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:19:44,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:46,760 INFO L124 PetriNetUnfolderBase]: 8993/18700 cut-off events. [2025-03-09 01:19:46,760 INFO L125 PetriNetUnfolderBase]: For 32670/32670 co-relation queries the response was YES. [2025-03-09 01:19:46,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53281 conditions, 18700 events. 8993/18700 cut-off events. For 32670/32670 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 158472 event pairs, 6195 based on Foata normal form. 4/18546 useless extension candidates. Maximal degree in co-relation 53142. Up to 10230 conditions per place. [2025-03-09 01:19:46,880 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 92 selfloop transitions, 7 changer transitions 0/121 dead transitions. [2025-03-09 01:19:46,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 121 transitions, 976 flow [2025-03-09 01:19:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2025-03-09 01:19:46,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-09 01:19:46,881 INFO L175 Difference]: Start difference. First operand has 112 places, 80 transitions, 548 flow. Second operand 5 states and 231 transitions. [2025-03-09 01:19:46,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 121 transitions, 976 flow [2025-03-09 01:19:46,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 121 transitions, 976 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:19:46,938 INFO L231 Difference]: Finished difference. Result has 118 places, 81 transitions, 576 flow [2025-03-09 01:19:46,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=576, PETRI_PLACES=118, PETRI_TRANSITIONS=81} [2025-03-09 01:19:46,939 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 56 predicate places. [2025-03-09 01:19:46,939 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 81 transitions, 576 flow [2025-03-09 01:19:46,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:46,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:46,939 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:46,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:19:46,939 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:46,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:46,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2001791527, now seen corresponding path program 1 times [2025-03-09 01:19:46,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:46,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533182593] [2025-03-09 01:19:46,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:46,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:47,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:19:47,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:19:47,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:47,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:47,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:47,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533182593] [2025-03-09 01:19:47,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533182593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:47,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:47,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:47,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888360630] [2025-03-09 01:19:47,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:47,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:47,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:47,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:47,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:47,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:19:47,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 81 transitions, 576 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:47,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:47,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:19:47,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:48,621 INFO L124 PetriNetUnfolderBase]: 9045/18960 cut-off events. [2025-03-09 01:19:48,622 INFO L125 PetriNetUnfolderBase]: For 40077/40077 co-relation queries the response was YES. [2025-03-09 01:19:48,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55431 conditions, 18960 events. 9045/18960 cut-off events. For 40077/40077 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 161819 event pairs, 7149 based on Foata normal form. 82/18883 useless extension candidates. Maximal degree in co-relation 55288. Up to 11844 conditions per place. [2025-03-09 01:19:48,715 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 99 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2025-03-09 01:19:48,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 127 transitions, 1099 flow [2025-03-09 01:19:48,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2025-03-09 01:19:48,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7689393939393939 [2025-03-09 01:19:48,716 INFO L175 Difference]: Start difference. First operand has 118 places, 81 transitions, 576 flow. Second operand 4 states and 203 transitions. [2025-03-09 01:19:48,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 127 transitions, 1099 flow [2025-03-09 01:19:48,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 127 transitions, 1073 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:48,763 INFO L231 Difference]: Finished difference. Result has 120 places, 83 transitions, 605 flow [2025-03-09 01:19:48,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=605, PETRI_PLACES=120, PETRI_TRANSITIONS=83} [2025-03-09 01:19:48,764 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 58 predicate places. [2025-03-09 01:19:48,764 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 83 transitions, 605 flow [2025-03-09 01:19:48,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:48,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:48,764 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:48,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:19:48,764 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:48,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:48,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1271464999, now seen corresponding path program 3 times [2025-03-09 01:19:48,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:48,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323837813] [2025-03-09 01:19:48,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:19:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:48,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 6 equivalence classes. [2025-03-09 01:19:48,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 42 statements. [2025-03-09 01:19:48,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:19:48,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:48,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:48,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323837813] [2025-03-09 01:19:48,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323837813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:48,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:48,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:48,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777796924] [2025-03-09 01:19:48,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:48,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:48,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:48,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:48,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:48,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:19:48,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 83 transitions, 605 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:48,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:48,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:19:48,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:50,505 INFO L124 PetriNetUnfolderBase]: 8943/18667 cut-off events. [2025-03-09 01:19:50,506 INFO L125 PetriNetUnfolderBase]: For 38035/38037 co-relation queries the response was YES. [2025-03-09 01:19:50,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54232 conditions, 18667 events. 8943/18667 cut-off events. For 38035/38037 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 158286 event pairs, 6256 based on Foata normal form. 97/18632 useless extension candidates. Maximal degree in co-relation 54088. Up to 10651 conditions per place. [2025-03-09 01:19:50,609 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 89 selfloop transitions, 8 changer transitions 2/122 dead transitions. [2025-03-09 01:19:50,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 122 transitions, 1040 flow [2025-03-09 01:19:50,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2025-03-09 01:19:50,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7462121212121212 [2025-03-09 01:19:50,610 INFO L175 Difference]: Start difference. First operand has 120 places, 83 transitions, 605 flow. Second operand 4 states and 197 transitions. [2025-03-09 01:19:50,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 122 transitions, 1040 flow [2025-03-09 01:19:50,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 1031 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:19:50,665 INFO L231 Difference]: Finished difference. Result has 123 places, 84 transitions, 640 flow [2025-03-09 01:19:50,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=640, PETRI_PLACES=123, PETRI_TRANSITIONS=84} [2025-03-09 01:19:50,665 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 61 predicate places. [2025-03-09 01:19:50,665 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 84 transitions, 640 flow [2025-03-09 01:19:50,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:50,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:50,666 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:50,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 01:19:50,666 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:50,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:50,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1682710503, now seen corresponding path program 2 times [2025-03-09 01:19:50,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:50,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533459872] [2025-03-09 01:19:50,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:50,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:50,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-09 01:19:50,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 42 statements. [2025-03-09 01:19:50,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:19:50,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:50,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:50,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533459872] [2025-03-09 01:19:50,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533459872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:50,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:50,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:50,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317270004] [2025-03-09 01:19:50,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:50,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:50,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:50,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:50,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:50,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-03-09 01:19:50,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 84 transitions, 640 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:50,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:50,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-03-09 01:19:50,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:52,697 INFO L124 PetriNetUnfolderBase]: 9516/20105 cut-off events. [2025-03-09 01:19:52,697 INFO L125 PetriNetUnfolderBase]: For 45749/45749 co-relation queries the response was YES. [2025-03-09 01:19:52,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59981 conditions, 20105 events. 9516/20105 cut-off events. For 45749/45749 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 175580 event pairs, 5513 based on Foata normal form. 82/20035 useless extension candidates. Maximal degree in co-relation 59836. Up to 13882 conditions per place. [2025-03-09 01:19:52,788 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 81 selfloop transitions, 6 changer transitions 3/113 dead transitions. [2025-03-09 01:19:52,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 113 transitions, 984 flow [2025-03-09 01:19:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2025-03-09 01:19:52,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7310606060606061 [2025-03-09 01:19:52,789 INFO L175 Difference]: Start difference. First operand has 123 places, 84 transitions, 640 flow. Second operand 4 states and 193 transitions. [2025-03-09 01:19:52,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 113 transitions, 984 flow [2025-03-09 01:19:52,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 113 transitions, 968 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:52,837 INFO L231 Difference]: Finished difference. Result has 124 places, 85 transitions, 660 flow [2025-03-09 01:19:52,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=660, PETRI_PLACES=124, PETRI_TRANSITIONS=85} [2025-03-09 01:19:52,837 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 62 predicate places. [2025-03-09 01:19:52,838 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 85 transitions, 660 flow [2025-03-09 01:19:52,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:52,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:52,838 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:52,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 01:19:52,838 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:52,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:52,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1496080509, now seen corresponding path program 1 times [2025-03-09 01:19:52,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:52,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870865064] [2025-03-09 01:19:52,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:52,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:52,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 01:19:52,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:19:52,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:52,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 01:19:53,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870865064] [2025-03-09 01:19:53,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870865064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956315049] [2025-03-09 01:19:53,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:53,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:53,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:53,019 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:53,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:19:53,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 01:19:53,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:19:53,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:53,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:53,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 01:19:53,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:53,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:53,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-09 01:19:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:53,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956315049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:53,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:53,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 27 [2025-03-09 01:19:53,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835320838] [2025-03-09 01:19:53,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:53,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:19:53,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:53,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:19:53,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:19:54,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-03-09 01:19:54,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 85 transitions, 660 flow. Second operand has 28 states, 28 states have (on average 35.32142857142857) internal successors, (989), 28 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:54,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:54,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-03-09 01:19:54,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:56,670 INFO L124 PetriNetUnfolderBase]: 10810/22814 cut-off events. [2025-03-09 01:19:56,670 INFO L125 PetriNetUnfolderBase]: For 49494/49494 co-relation queries the response was YES. [2025-03-09 01:19:56,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67045 conditions, 22814 events. 10810/22814 cut-off events. For 49494/49494 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 199727 event pairs, 1805 based on Foata normal form. 318/22993 useless extension candidates. Maximal degree in co-relation 66900. Up to 4655 conditions per place. [2025-03-09 01:19:56,857 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 174 selfloop transitions, 21 changer transitions 0/219 dead transitions. [2025-03-09 01:19:56,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 219 transitions, 1955 flow [2025-03-09 01:19:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:19:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:19:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 573 transitions. [2025-03-09 01:19:56,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6678321678321678 [2025-03-09 01:19:56,859 INFO L175 Difference]: Start difference. First operand has 124 places, 85 transitions, 660 flow. Second operand 13 states and 573 transitions. [2025-03-09 01:19:56,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 219 transitions, 1955 flow [2025-03-09 01:19:56,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 219 transitions, 1943 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:56,918 INFO L231 Difference]: Finished difference. Result has 136 places, 87 transitions, 729 flow [2025-03-09 01:19:56,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=729, PETRI_PLACES=136, PETRI_TRANSITIONS=87} [2025-03-09 01:19:56,918 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 74 predicate places. [2025-03-09 01:19:56,918 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 87 transitions, 729 flow [2025-03-09 01:19:56,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 35.32142857142857) internal successors, (989), 28 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:56,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:56,919 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:56,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:57,120 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,SelfDestructingSolverStorable24 [2025-03-09 01:19:57,121 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:19:57,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:57,121 INFO L85 PathProgramCache]: Analyzing trace with hash 336668893, now seen corresponding path program 1 times [2025-03-09 01:19:57,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:57,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259081142] [2025-03-09 01:19:57,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:57,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:57,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:19:57,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:19:57,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:57,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:57,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:57,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259081142] [2025-03-09 01:19:57,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259081142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:57,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:57,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:19:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773840706] [2025-03-09 01:19:57,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:57,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:19:57,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:57,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:19:57,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:19:57,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:19:57,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 87 transitions, 729 flow. Second operand has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:57,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:57,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:19:57,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:00,469 INFO L124 PetriNetUnfolderBase]: 14400/29215 cut-off events. [2025-03-09 01:20:00,469 INFO L125 PetriNetUnfolderBase]: For 72470/72546 co-relation queries the response was YES. [2025-03-09 01:20:00,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89217 conditions, 29215 events. 14400/29215 cut-off events. For 72470/72546 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 247577 event pairs, 10535 based on Foata normal form. 8/29187 useless extension candidates. Maximal degree in co-relation 89059. Up to 18519 conditions per place. [2025-03-09 01:20:00,794 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 152 selfloop transitions, 28 changer transitions 0/197 dead transitions. [2025-03-09 01:20:00,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 197 transitions, 1796 flow [2025-03-09 01:20:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:20:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:20:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 494 transitions. [2025-03-09 01:20:00,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6237373737373737 [2025-03-09 01:20:00,795 INFO L175 Difference]: Start difference. First operand has 136 places, 87 transitions, 729 flow. Second operand 12 states and 494 transitions. [2025-03-09 01:20:00,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 197 transitions, 1796 flow [2025-03-09 01:20:00,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 197 transitions, 1765 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-09 01:20:00,912 INFO L231 Difference]: Finished difference. Result has 146 places, 108 transitions, 957 flow [2025-03-09 01:20:00,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=957, PETRI_PLACES=146, PETRI_TRANSITIONS=108} [2025-03-09 01:20:00,913 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 84 predicate places. [2025-03-09 01:20:00,913 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 108 transitions, 957 flow [2025-03-09 01:20:00,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:00,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:00,913 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:00,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 01:20:00,913 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:00,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:00,914 INFO L85 PathProgramCache]: Analyzing trace with hash -252039171, now seen corresponding path program 2 times [2025-03-09 01:20:00,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:00,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510645674] [2025-03-09 01:20:00,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:00,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:00,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-09 01:20:00,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 47 statements. [2025-03-09 01:20:00,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:20:00,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:01,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:01,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510645674] [2025-03-09 01:20:01,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510645674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:01,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:01,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:20:01,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874605012] [2025-03-09 01:20:01,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:01,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:20:01,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:01,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:20:01,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:20:01,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:20:01,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 108 transitions, 957 flow. Second operand has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:01,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:01,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:20:01,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:04,315 INFO L124 PetriNetUnfolderBase]: 14477/29149 cut-off events. [2025-03-09 01:20:04,315 INFO L125 PetriNetUnfolderBase]: For 90550/90682 co-relation queries the response was YES. [2025-03-09 01:20:04,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97418 conditions, 29149 events. 14477/29149 cut-off events. For 90550/90682 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 246169 event pairs, 10126 based on Foata normal form. 9/29125 useless extension candidates. Maximal degree in co-relation 97261. Up to 18519 conditions per place. [2025-03-09 01:20:04,563 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 218 selfloop transitions, 35 changer transitions 0/270 dead transitions. [2025-03-09 01:20:04,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 270 transitions, 2691 flow [2025-03-09 01:20:04,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:20:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 01:20:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 625 transitions. [2025-03-09 01:20:04,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6313131313131313 [2025-03-09 01:20:04,565 INFO L175 Difference]: Start difference. First operand has 146 places, 108 transitions, 957 flow. Second operand 15 states and 625 transitions. [2025-03-09 01:20:04,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 270 transitions, 2691 flow [2025-03-09 01:20:04,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 270 transitions, 2656 flow, removed 16 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:04,722 INFO L231 Difference]: Finished difference. Result has 167 places, 122 transitions, 1245 flow [2025-03-09 01:20:04,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1245, PETRI_PLACES=167, PETRI_TRANSITIONS=122} [2025-03-09 01:20:04,723 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 105 predicate places. [2025-03-09 01:20:04,723 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 122 transitions, 1245 flow [2025-03-09 01:20:04,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:04,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:04,723 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:04,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 01:20:04,723 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:04,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:04,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1968092553, now seen corresponding path program 3 times [2025-03-09 01:20:04,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:04,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690415147] [2025-03-09 01:20:04,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:04,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:04,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 6 equivalence classes. [2025-03-09 01:20:04,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 47 statements. [2025-03-09 01:20:04,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:20:04,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:04,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690415147] [2025-03-09 01:20:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690415147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:04,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:04,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:20:04,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887029640] [2025-03-09 01:20:04,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:04,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:20:04,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:04,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:20:04,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:20:05,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:20:05,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 122 transitions, 1245 flow. Second operand has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:05,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:05,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:20:05,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:08,121 INFO L124 PetriNetUnfolderBase]: 14443/29061 cut-off events. [2025-03-09 01:20:08,121 INFO L125 PetriNetUnfolderBase]: For 111849/111877 co-relation queries the response was YES. [2025-03-09 01:20:08,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102094 conditions, 29061 events. 14443/29061 cut-off events. For 111849/111877 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 243800 event pairs, 11377 based on Foata normal form. 8/29026 useless extension candidates. Maximal degree in co-relation 101928. Up to 18351 conditions per place. [2025-03-09 01:20:08,424 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 178 selfloop transitions, 45 changer transitions 0/240 dead transitions. [2025-03-09 01:20:08,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 240 transitions, 2511 flow [2025-03-09 01:20:08,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:20:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:20:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 586 transitions. [2025-03-09 01:20:08,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341991341991342 [2025-03-09 01:20:08,425 INFO L175 Difference]: Start difference. First operand has 167 places, 122 transitions, 1245 flow. Second operand 14 states and 586 transitions. [2025-03-09 01:20:08,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 240 transitions, 2511 flow [2025-03-09 01:20:08,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 240 transitions, 2380 flow, removed 30 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:08,610 INFO L231 Difference]: Finished difference. Result has 185 places, 143 transitions, 1606 flow [2025-03-09 01:20:08,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1606, PETRI_PLACES=185, PETRI_TRANSITIONS=143} [2025-03-09 01:20:08,610 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 123 predicate places. [2025-03-09 01:20:08,610 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 143 transitions, 1606 flow [2025-03-09 01:20:08,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:08,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:08,611 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:08,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 01:20:08,611 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:08,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:08,611 INFO L85 PathProgramCache]: Analyzing trace with hash 15538207, now seen corresponding path program 4 times [2025-03-09 01:20:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:08,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20817874] [2025-03-09 01:20:08,611 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:20:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:08,622 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-09 01:20:08,626 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 47 statements. [2025-03-09 01:20:08,626 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:20:08,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:08,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:08,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20817874] [2025-03-09 01:20:08,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20817874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:08,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:08,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:20:08,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888722921] [2025-03-09 01:20:08,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:08,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:20:08,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:08,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:20:08,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:20:09,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:20:09,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 143 transitions, 1606 flow. Second operand has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:09,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:09,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:20:09,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:12,201 INFO L124 PetriNetUnfolderBase]: 14564/29396 cut-off events. [2025-03-09 01:20:12,202 INFO L125 PetriNetUnfolderBase]: For 127223/127299 co-relation queries the response was YES. [2025-03-09 01:20:12,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107076 conditions, 29396 events. 14564/29396 cut-off events. For 127223/127299 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 248199 event pairs, 10819 based on Foata normal form. 9/29366 useless extension candidates. Maximal degree in co-relation 106900. Up to 18378 conditions per place. [2025-03-09 01:20:12,544 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 206 selfloop transitions, 48 changer transitions 0/271 dead transitions. [2025-03-09 01:20:12,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 271 transitions, 3173 flow [2025-03-09 01:20:12,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:20:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:20:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 519 transitions. [2025-03-09 01:20:12,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6553030303030303 [2025-03-09 01:20:12,545 INFO L175 Difference]: Start difference. First operand has 185 places, 143 transitions, 1606 flow. Second operand 12 states and 519 transitions. [2025-03-09 01:20:12,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 271 transitions, 3173 flow [2025-03-09 01:20:12,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 271 transitions, 3052 flow, removed 59 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:12,871 INFO L231 Difference]: Finished difference. Result has 201 places, 154 transitions, 1879 flow [2025-03-09 01:20:12,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1879, PETRI_PLACES=201, PETRI_TRANSITIONS=154} [2025-03-09 01:20:12,871 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 139 predicate places. [2025-03-09 01:20:12,871 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 154 transitions, 1879 flow [2025-03-09 01:20:12,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:12,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:12,871 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:12,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 01:20:12,872 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:12,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:12,872 INFO L85 PathProgramCache]: Analyzing trace with hash -598850835, now seen corresponding path program 5 times [2025-03-09 01:20:12,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:12,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885387647] [2025-03-09 01:20:12,872 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:20:12,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:12,879 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 6 equivalence classes. [2025-03-09 01:20:12,900 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:20:12,902 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 01:20:12,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-09 01:20:13,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:13,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885387647] [2025-03-09 01:20:13,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885387647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:13,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260727543] [2025-03-09 01:20:13,339 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:20:13,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:13,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:13,341 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:13,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:20:13,411 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 6 equivalence classes. [2025-03-09 01:20:13,480 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:20:13,481 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 01:20:13,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:13,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:20:13,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:13,607 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-09 01:20:13,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2025-03-09 01:20:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:13,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:13,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260727543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:13,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:13,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2025-03-09 01:20:13,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342089711] [2025-03-09 01:20:13,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:13,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:20:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:13,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:20:13,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:20:13,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:20:13,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 154 transitions, 1879 flow. Second operand has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:13,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:13,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:20:13,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:17,142 INFO L124 PetriNetUnfolderBase]: 14753/29864 cut-off events. [2025-03-09 01:20:17,142 INFO L125 PetriNetUnfolderBase]: For 128890/128918 co-relation queries the response was YES. [2025-03-09 01:20:17,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106587 conditions, 29864 events. 14753/29864 cut-off events. For 128890/128918 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 252397 event pairs, 11108 based on Foata normal form. 9/29826 useless extension candidates. Maximal degree in co-relation 106405. Up to 18546 conditions per place. [2025-03-09 01:20:17,618 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 175 selfloop transitions, 58 changer transitions 0/250 dead transitions. [2025-03-09 01:20:17,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 250 transitions, 3066 flow [2025-03-09 01:20:17,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:20:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:20:17,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 477 transitions. [2025-03-09 01:20:17,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6570247933884298 [2025-03-09 01:20:17,619 INFO L175 Difference]: Start difference. First operand has 201 places, 154 transitions, 1879 flow. Second operand 11 states and 477 transitions. [2025-03-09 01:20:17,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 250 transitions, 3066 flow [2025-03-09 01:20:17,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 250 transitions, 2978 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:17,923 INFO L231 Difference]: Finished difference. Result has 215 places, 172 transitions, 2222 flow [2025-03-09 01:20:17,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2222, PETRI_PLACES=215, PETRI_TRANSITIONS=172} [2025-03-09 01:20:17,924 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 153 predicate places. [2025-03-09 01:20:17,924 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 172 transitions, 2222 flow [2025-03-09 01:20:17,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:17,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:17,924 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:17,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:18,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:18,124 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:18,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:18,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1774283903, now seen corresponding path program 6 times [2025-03-09 01:20:18,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:18,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717034561] [2025-03-09 01:20:18,125 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:20:18,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:18,132 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 6 equivalence classes. [2025-03-09 01:20:18,136 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 27 of 47 statements. [2025-03-09 01:20:18,136 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 01:20:18,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:18,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:18,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717034561] [2025-03-09 01:20:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717034561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:18,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:20:18,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57675169] [2025-03-09 01:20:18,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:18,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:20:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:18,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:20:18,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:20:18,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:20:18,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 172 transitions, 2222 flow. Second operand has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:18,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:18,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:20:18,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:22,274 INFO L124 PetriNetUnfolderBase]: 14775/29954 cut-off events. [2025-03-09 01:20:22,275 INFO L125 PetriNetUnfolderBase]: For 131196/131276 co-relation queries the response was YES. [2025-03-09 01:20:22,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107676 conditions, 29954 events. 14775/29954 cut-off events. For 131196/131276 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 253989 event pairs, 10621 based on Foata normal form. 9/29922 useless extension candidates. Maximal degree in co-relation 107487. Up to 18519 conditions per place. [2025-03-09 01:20:22,831 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 201 selfloop transitions, 64 changer transitions 0/282 dead transitions. [2025-03-09 01:20:22,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 282 transitions, 3696 flow [2025-03-09 01:20:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:20:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:20:22,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 537 transitions. [2025-03-09 01:20:22,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6258741258741258 [2025-03-09 01:20:22,833 INFO L175 Difference]: Start difference. First operand has 215 places, 172 transitions, 2222 flow. Second operand 13 states and 537 transitions. [2025-03-09 01:20:22,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 282 transitions, 3696 flow [2025-03-09 01:20:23,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 282 transitions, 3561 flow, removed 26 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:23,255 INFO L231 Difference]: Finished difference. Result has 229 places, 182 transitions, 2436 flow [2025-03-09 01:20:23,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2105, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2436, PETRI_PLACES=229, PETRI_TRANSITIONS=182} [2025-03-09 01:20:23,256 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 167 predicate places. [2025-03-09 01:20:23,256 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 182 transitions, 2436 flow [2025-03-09 01:20:23,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:23,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:23,256 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:23,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-09 01:20:23,256 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:23,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:23,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1202504685, now seen corresponding path program 7 times [2025-03-09 01:20:23,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:23,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772660985] [2025-03-09 01:20:23,257 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:20:23,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:23,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:20:23,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:20:23,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:23,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:23,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:23,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772660985] [2025-03-09 01:20:23,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772660985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:23,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:23,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:20:23,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146911253] [2025-03-09 01:20:23,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:23,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:20:23,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:23,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:20:23,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:20:23,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:20:23,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 182 transitions, 2436 flow. Second operand has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:23,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:23,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:20:23,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:28,017 INFO L124 PetriNetUnfolderBase]: 15050/30453 cut-off events. [2025-03-09 01:20:28,017 INFO L125 PetriNetUnfolderBase]: For 146530/146558 co-relation queries the response was YES. [2025-03-09 01:20:28,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110907 conditions, 30453 events. 15050/30453 cut-off events. For 146530/146558 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 257628 event pairs, 11184 based on Foata normal form. 9/30416 useless extension candidates. Maximal degree in co-relation 110712. Up to 18519 conditions per place. [2025-03-09 01:20:28,334 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 226 selfloop transitions, 52 changer transitions 0/295 dead transitions. [2025-03-09 01:20:28,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 295 transitions, 4000 flow [2025-03-09 01:20:28,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:20:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:20:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 589 transitions. [2025-03-09 01:20:28,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6374458874458875 [2025-03-09 01:20:28,336 INFO L175 Difference]: Start difference. First operand has 229 places, 182 transitions, 2436 flow. Second operand 14 states and 589 transitions. [2025-03-09 01:20:28,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 295 transitions, 4000 flow [2025-03-09 01:20:28,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 295 transitions, 3836 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-03-09 01:20:28,665 INFO L231 Difference]: Finished difference. Result has 243 places, 200 transitions, 2830 flow [2025-03-09 01:20:28,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2298, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2830, PETRI_PLACES=243, PETRI_TRANSITIONS=200} [2025-03-09 01:20:28,666 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 181 predicate places. [2025-03-09 01:20:28,666 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 200 transitions, 2830 flow [2025-03-09 01:20:28,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:28,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:28,666 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:28,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-09 01:20:28,666 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:28,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:28,667 INFO L85 PathProgramCache]: Analyzing trace with hash 839983899, now seen corresponding path program 8 times [2025-03-09 01:20:28,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:28,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732989901] [2025-03-09 01:20:28,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:28,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:28,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-09 01:20:28,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 47 statements. [2025-03-09 01:20:28,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:20:28,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:28,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:28,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732989901] [2025-03-09 01:20:28,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732989901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:28,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:28,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:20:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352082621] [2025-03-09 01:20:28,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:28,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:20:28,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:28,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:20:28,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:20:29,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:20:29,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 200 transitions, 2830 flow. Second operand has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:29,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:29,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:20:29,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:33,787 INFO L124 PetriNetUnfolderBase]: 15006/30416 cut-off events. [2025-03-09 01:20:33,788 INFO L125 PetriNetUnfolderBase]: For 141960/142036 co-relation queries the response was YES. [2025-03-09 01:20:33,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110823 conditions, 30416 events. 15006/30416 cut-off events. For 141960/142036 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 258154 event pairs, 10640 based on Foata normal form. 9/30378 useless extension candidates. Maximal degree in co-relation 110619. Up to 18519 conditions per place. [2025-03-09 01:20:34,065 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 205 selfloop transitions, 68 changer transitions 0/290 dead transitions. [2025-03-09 01:20:34,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 290 transitions, 4111 flow [2025-03-09 01:20:34,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:20:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:20:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 495 transitions. [2025-03-09 01:20:34,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-09 01:20:34,066 INFO L175 Difference]: Start difference. First operand has 243 places, 200 transitions, 2830 flow. Second operand 12 states and 495 transitions. [2025-03-09 01:20:34,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 290 transitions, 4111 flow [2025-03-09 01:20:34,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 290 transitions, 3983 flow, removed 57 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:34,519 INFO L231 Difference]: Finished difference. Result has 254 places, 197 transitions, 2816 flow [2025-03-09 01:20:34,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2636, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2816, PETRI_PLACES=254, PETRI_TRANSITIONS=197} [2025-03-09 01:20:34,520 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 192 predicate places. [2025-03-09 01:20:34,520 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 197 transitions, 2816 flow [2025-03-09 01:20:34,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:34,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:34,520 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:34,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-09 01:20:34,520 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:34,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash -462521125, now seen corresponding path program 9 times [2025-03-09 01:20:34,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:34,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043777584] [2025-03-09 01:20:34,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:34,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:34,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 6 equivalence classes. [2025-03-09 01:20:34,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 47 statements. [2025-03-09 01:20:34,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:20:34,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:34,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:34,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043777584] [2025-03-09 01:20:34,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043777584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:34,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:34,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-09 01:20:34,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018687470] [2025-03-09 01:20:34,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:34,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:20:34,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:34,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:20:34,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:20:35,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:20:35,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 197 transitions, 2816 flow. Second operand has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:35,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:35,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:20:35,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:40,057 INFO L124 PetriNetUnfolderBase]: 14975/30185 cut-off events. [2025-03-09 01:20:40,057 INFO L125 PetriNetUnfolderBase]: For 138993/139069 co-relation queries the response was YES. [2025-03-09 01:20:40,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109147 conditions, 30185 events. 14975/30185 cut-off events. For 138993/139069 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 254756 event pairs, 10898 based on Foata normal form. 9/30143 useless extension candidates. Maximal degree in co-relation 108940. Up to 18351 conditions per place. [2025-03-09 01:20:40,386 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 237 selfloop transitions, 64 changer transitions 0/318 dead transitions. [2025-03-09 01:20:40,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 318 transitions, 4656 flow [2025-03-09 01:20:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:20:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:20:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 584 transitions. [2025-03-09 01:20:40,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6320346320346321 [2025-03-09 01:20:40,387 INFO L175 Difference]: Start difference. First operand has 254 places, 197 transitions, 2816 flow. Second operand 14 states and 584 transitions. [2025-03-09 01:20:40,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 318 transitions, 4656 flow [2025-03-09 01:20:40,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 318 transitions, 4528 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-03-09 01:20:40,816 INFO L231 Difference]: Finished difference. Result has 268 places, 213 transitions, 3270 flow [2025-03-09 01:20:40,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=2698, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3270, PETRI_PLACES=268, PETRI_TRANSITIONS=213} [2025-03-09 01:20:40,817 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 206 predicate places. [2025-03-09 01:20:40,817 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 213 transitions, 3270 flow [2025-03-09 01:20:40,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:40,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:40,817 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:40,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-09 01:20:40,817 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:40,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:40,818 INFO L85 PathProgramCache]: Analyzing trace with hash -466313897, now seen corresponding path program 10 times [2025-03-09 01:20:40,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:40,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489997576] [2025-03-09 01:20:40,818 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:20:40,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:40,826 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-09 01:20:40,830 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 47 statements. [2025-03-09 01:20:40,830 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:20:40,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:40,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:40,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489997576] [2025-03-09 01:20:40,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489997576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:40,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:40,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:20:40,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911020495] [2025-03-09 01:20:40,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:40,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:20:40,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:40,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:20:40,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:20:41,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:20:41,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 213 transitions, 3270 flow. Second operand has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:41,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:41,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:20:41,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:46,070 INFO L124 PetriNetUnfolderBase]: 15059/30512 cut-off events. [2025-03-09 01:20:46,071 INFO L125 PetriNetUnfolderBase]: For 146359/146435 co-relation queries the response was YES. [2025-03-09 01:20:46,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111223 conditions, 30512 events. 15059/30512 cut-off events. For 146359/146435 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 258689 event pairs, 10719 based on Foata normal form. 8/30465 useless extension candidates. Maximal degree in co-relation 111007. Up to 18546 conditions per place. [2025-03-09 01:20:46,367 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 203 selfloop transitions, 88 changer transitions 0/308 dead transitions. [2025-03-09 01:20:46,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 308 transitions, 4756 flow [2025-03-09 01:20:46,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:20:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:20:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 466 transitions. [2025-03-09 01:20:46,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6418732782369146 [2025-03-09 01:20:46,368 INFO L175 Difference]: Start difference. First operand has 268 places, 213 transitions, 3270 flow. Second operand 11 states and 466 transitions. [2025-03-09 01:20:46,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 308 transitions, 4756 flow [2025-03-09 01:20:46,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 308 transitions, 4580 flow, removed 81 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:46,936 INFO L231 Difference]: Finished difference. Result has 282 places, 231 transitions, 3727 flow [2025-03-09 01:20:46,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=3138, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3727, PETRI_PLACES=282, PETRI_TRANSITIONS=231} [2025-03-09 01:20:46,937 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 220 predicate places. [2025-03-09 01:20:46,937 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 231 transitions, 3727 flow [2025-03-09 01:20:46,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:46,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:46,937 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:46,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-09 01:20:46,937 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-09 01:20:46,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:46,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1773537617, now seen corresponding path program 11 times [2025-03-09 01:20:46,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:46,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181828020] [2025-03-09 01:20:46,938 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:20:46,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:46,946 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 6 equivalence classes. [2025-03-09 01:20:46,962 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:20:46,962 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 01:20:46,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-09 01:20:47,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:47,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181828020] [2025-03-09 01:20:47,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181828020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:47,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001142986] [2025-03-09 01:20:47,381 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:20:47,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:47,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:47,384 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:47,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:20:47,462 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 6 equivalence classes. [2025-03-09 01:20:47,511 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:20:47,511 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-09 01:20:47,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:47,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:20:47,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:47,647 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-03-09 01:20:47,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2025-03-09 01:20:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:47,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:47,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001142986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:47,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:47,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2025-03-09 01:20:47,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155078370] [2025-03-09 01:20:47,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:47,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:20:47,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:47,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:20:47,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:20:47,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-03-09 01:20:47,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 231 transitions, 3727 flow. Second operand has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:47,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:47,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-03-09 01:20:47,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand