./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult.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/popl20-more-buffer-mult.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 e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:25:53,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:25:53,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:25:53,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:25:53,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:25:53,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:25:53,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:25:53,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:25:53,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:25:53,246 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:25:53,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:25:53,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:25:53,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:25:53,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:25:53,248 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:25:53,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:25:53,248 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:25:53,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:25:53,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:25:53,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:25:53,248 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:25:53,248 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:25:53,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:25:53,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:25:53,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:25:53,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:25:53,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:25:53,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:25:53,250 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 -> e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe [2025-03-09 01:25:53,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:25:53,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:25:53,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:25:53,454 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:25:53,455 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:25:53,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2025-03-09 01:25:54,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b24882d56/8f14d9fa9eda4b25a65c2d4273f78fea/FLAG6730faacd [2025-03-09 01:25:54,792 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:25:54,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2025-03-09 01:25:54,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b24882d56/8f14d9fa9eda4b25a65c2d4273f78fea/FLAG6730faacd [2025-03-09 01:25:55,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b24882d56/8f14d9fa9eda4b25a65c2d4273f78fea [2025-03-09 01:25:55,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:25:55,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:25:55,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:25:55,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:25:55,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:25:55,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:25:55" (1/1) ... [2025-03-09 01:25:55,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b8eea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:55, skipping insertion in model container [2025-03-09 01:25:55,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:25:55" (1/1) ... [2025-03-09 01:25:55,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:25:55,274 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:25:55,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:25:55,290 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:25:55,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:25:55,333 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:25:55,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:55 WrapperNode [2025-03-09 01:25:55,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:25:55,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:25:55,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:25:55,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:25:55,338 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:25:55" (1/1) ... [2025-03-09 01:25:55,343 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:25:55" (1/1) ... [2025-03-09 01:25:55,359 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 280 [2025-03-09 01:25:55,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:25:55,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:25:55,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:25:55,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:25:55,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:55" (1/1) ... [2025-03-09 01:25:55,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:55" (1/1) ... [2025-03-09 01:25:55,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:55" (1/1) ... [2025-03-09 01:25:55,391 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 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:25:55,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:55" (1/1) ... [2025-03-09 01:25:55,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:55" (1/1) ... [2025-03-09 01:25:55,398 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:55" (1/1) ... [2025-03-09 01:25:55,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:55" (1/1) ... [2025-03-09 01:25:55,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:55" (1/1) ... [2025-03-09 01:25:55,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:55" (1/1) ... [2025-03-09 01:25:55,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:25:55,403 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:25:55,403 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:25:55,403 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:25:55,404 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:55" (1/1) ... [2025-03-09 01:25:55,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:25:55,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:55,426 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:25:55,428 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:25:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:25:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:25:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:25:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:25:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:25:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:25:55,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:25:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:25:55,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:25:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:25:55,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:25:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-09 01:25:55,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-09 01:25:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:25:55,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:25:55,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:25:55,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:25:55,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:25:55,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:25:55,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:25:55,446 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:25:55,535 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:25:55,537 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:25:55,877 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:25:55,877 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:25:56,091 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:25:56,092 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:25:56,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:25:56 BoogieIcfgContainer [2025-03-09 01:25:56,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:25:56,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:25:56,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:25:56,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:25:56,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:25:55" (1/3) ... [2025-03-09 01:25:56,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387af292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:25:56, skipping insertion in model container [2025-03-09 01:25:56,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:55" (2/3) ... [2025-03-09 01:25:56,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387af292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:25:56, skipping insertion in model container [2025-03-09 01:25:56,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:25:56" (3/3) ... [2025-03-09 01:25:56,099 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2025-03-09 01:25:56,111 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:25:56,112 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-03-09 01:25:56,113 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:25:56,196 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 01:25:56,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2025-03-09 01:25:56,253 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2025-03-09 01:25:56,255 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:25:56,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 146 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-03-09 01:25:56,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2025-03-09 01:25:56,262 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2025-03-09 01:25:56,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:25:56,278 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;@400895af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:25:56,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-09 01:25:56,282 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:25:56,282 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:25:56,282 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:25:56,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:56,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:25:56,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:25:56,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash 771190, now seen corresponding path program 1 times [2025-03-09 01:25:56,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:56,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193355530] [2025-03-09 01:25:56,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:56,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:56,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:25:56,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:25:56,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:56,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:56,487 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:25:56,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:56,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193355530] [2025-03-09 01:25:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193355530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:56,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:56,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:25:56,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491705622] [2025-03-09 01:25:56,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:56,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:25:56,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:56,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:25:56,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:25:56,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:25:56,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:25:56,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:56,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:25:56,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:58,053 INFO L124 PetriNetUnfolderBase]: 15159/20183 cut-off events. [2025-03-09 01:25:58,054 INFO L125 PetriNetUnfolderBase]: For 579/579 co-relation queries the response was YES. [2025-03-09 01:25:58,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40874 conditions, 20183 events. 15159/20183 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 116350 event pairs, 12544 based on Foata normal form. 1/14567 useless extension candidates. Maximal degree in co-relation 38292. Up to 19683 conditions per place. [2025-03-09 01:25:58,194 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 44 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-03-09 01:25:58,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 230 flow [2025-03-09 01:25:58,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:25:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:25:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-09 01:25:58,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2025-03-09 01:25:58,207 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 97 transitions. [2025-03-09 01:25:58,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 230 flow [2025-03-09 01:25:58,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 214 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 01:25:58,238 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2025-03-09 01:25:58,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-03-09 01:25:58,242 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2025-03-09 01:25:58,243 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2025-03-09 01:25:58,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:25:58,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:58,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:25:58,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:25:58,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:25:58,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:58,245 INFO L85 PathProgramCache]: Analyzing trace with hash 771191, now seen corresponding path program 1 times [2025-03-09 01:25:58,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:58,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717471135] [2025-03-09 01:25:58,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:58,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:58,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:25:58,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:25:58,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:58,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:58,491 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:25:58,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717471135] [2025-03-09 01:25:58,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717471135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:58,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:58,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:25:58,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956195176] [2025-03-09 01:25:58,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:58,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:25:58,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:58,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:25:58,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:25:58,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:25:58,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:25:58,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:58,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:25:58,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:59,716 INFO L124 PetriNetUnfolderBase]: 15160/20186 cut-off events. [2025-03-09 01:25:59,716 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-09 01:25:59,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40235 conditions, 20186 events. 15160/20186 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 116362 event pairs, 12544 based on Foata normal form. 0/14567 useless extension candidates. Maximal degree in co-relation 40206. Up to 19692 conditions per place. [2025-03-09 01:25:59,807 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 47 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-03-09 01:25:59,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 234 flow [2025-03-09 01:25:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:25:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:25:59,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-09 01:25:59,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-09 01:25:59,810 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 116 transitions. [2025-03-09 01:25:59,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 234 flow [2025-03-09 01:25:59,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:25:59,813 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow [2025-03-09 01:25:59,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2025-03-09 01:25:59,813 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2025-03-09 01:25:59,813 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow [2025-03-09 01:25:59,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:25:59,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:59,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:25:59,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:25:59,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:25:59,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash 23909056, now seen corresponding path program 1 times [2025-03-09 01:25:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:59,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453697526] [2025-03-09 01:25:59,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:59,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:59,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:25:59,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:25:59,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:59,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:00,033 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:26:00,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:00,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453697526] [2025-03-09 01:26:00,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453697526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:00,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:00,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:26:00,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443476045] [2025-03-09 01:26:00,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:00,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:26:00,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:00,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:26:00,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:26:00,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:26:00,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:00,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:00,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:26:00,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:01,014 INFO L124 PetriNetUnfolderBase]: 15161/20189 cut-off events. [2025-03-09 01:26:01,014 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-09 01:26:01,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40252 conditions, 20189 events. 15161/20189 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 116310 event pairs, 12544 based on Foata normal form. 0/14569 useless extension candidates. Maximal degree in co-relation 40227. Up to 19691 conditions per place. [2025-03-09 01:26:01,100 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 47 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-09 01:26:01,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 263 flow [2025-03-09 01:26:01,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:26:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:26:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-09 01:26:01,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-09 01:26:01,102 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 149 flow. Second operand 5 states and 135 transitions. [2025-03-09 01:26:01,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 263 flow [2025-03-09 01:26:01,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:26:01,103 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow [2025-03-09 01:26:01,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-03-09 01:26:01,104 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-03-09 01:26:01,104 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow [2025-03-09 01:26:01,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:01,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:01,104 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:26:01,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:26:01,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:01,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:01,105 INFO L85 PathProgramCache]: Analyzing trace with hash 741139045, now seen corresponding path program 1 times [2025-03-09 01:26:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:01,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480302016] [2025-03-09 01:26:01,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:01,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:01,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:26:01,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:26:01,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:01,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:01,314 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:26:01,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:01,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480302016] [2025-03-09 01:26:01,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480302016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:01,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017646306] [2025-03-09 01:26:01,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:01,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:01,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:01,318 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:26:01,320 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:26:01,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:26:01,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:26:01,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:01,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:01,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:26:01,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:01,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-09 01:26:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:01,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:01,675 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:26:01,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017646306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:01,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:01,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:26:01,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982544375] [2025-03-09 01:26:01,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:01,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:26:01,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:01,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:26:01,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:26:01,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:26:01,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 183 flow. Second operand has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 0 states 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:26:01,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:01,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:26:01,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:03,211 INFO L124 PetriNetUnfolderBase]: 15161/20188 cut-off events. [2025-03-09 01:26:03,211 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-09 01:26:03,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40265 conditions, 20188 events. 15161/20188 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 116385 event pairs, 12544 based on Foata normal form. 0/14571 useless extension candidates. Maximal degree in co-relation 40237. Up to 19691 conditions per place. [2025-03-09 01:26:03,347 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 46 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2025-03-09 01:26:03,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 285 flow [2025-03-09 01:26:03,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:26:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:26:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-03-09 01:26:03,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3712121212121212 [2025-03-09 01:26:03,349 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 6 states and 147 transitions. [2025-03-09 01:26:03,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 285 flow [2025-03-09 01:26:03,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:26:03,350 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 192 flow [2025-03-09 01:26:03,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2025-03-09 01:26:03,351 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-09 01:26:03,351 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 192 flow [2025-03-09 01:26:03,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 0 states 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:26:03,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:03,351 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 01:26:03,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:26:03,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:03,554 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:03,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:03,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1501790698, now seen corresponding path program 1 times [2025-03-09 01:26:03,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:03,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894943284] [2025-03-09 01:26:03,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:03,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:03,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:26:03,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:26:03,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:03,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:03,734 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:26:03,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894943284] [2025-03-09 01:26:03,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894943284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640076868] [2025-03-09 01:26:03,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:03,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:03,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:03,741 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:26:03,748 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:26:03,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:26:03,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:26:03,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:03,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:03,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:26:03,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:03,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-09 01:26:03,943 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:26:03,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:04,055 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:26:04,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640076868] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:26:04,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:26:04,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:26:04,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844199256] [2025-03-09 01:26:04,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:26:04,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:26:04,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:04,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:26:04,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:26:04,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:26:04,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 192 flow. Second operand has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 0 states have call successors, (0), 0 states 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:26:04,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:04,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:26:04,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:05,105 INFO L124 PetriNetUnfolderBase]: 15163/20193 cut-off events. [2025-03-09 01:26:05,106 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-09 01:26:05,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40291 conditions, 20193 events. 15163/20193 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 116203 event pairs, 12544 based on Foata normal form. 0/14576 useless extension candidates. Maximal degree in co-relation 40245. Up to 19684 conditions per place. [2025-03-09 01:26:05,253 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 40 selfloop transitions, 18 changer transitions 0/67 dead transitions. [2025-03-09 01:26:05,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 337 flow [2025-03-09 01:26:05,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:26:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:26:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2025-03-09 01:26:05,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2025-03-09 01:26:05,255 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 192 flow. Second operand 9 states and 204 transitions. [2025-03-09 01:26:05,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 337 flow [2025-03-09 01:26:05,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 290 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-09 01:26:05,256 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 210 flow [2025-03-09 01:26:05,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2025-03-09 01:26:05,257 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-03-09 01:26:05,257 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 210 flow [2025-03-09 01:26:05,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 0 states have call successors, (0), 0 states 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:26:05,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:05,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:05,264 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:26:05,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:05,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:05,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash 218870391, now seen corresponding path program 1 times [2025-03-09 01:26:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:05,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646893168] [2025-03-09 01:26:05,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:05,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:05,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:26:05,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:26:05,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:05,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:05,520 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:26:05,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:05,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646893168] [2025-03-09 01:26:05,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646893168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:05,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:05,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:05,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418177776] [2025-03-09 01:26:05,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:05,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:05,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:05,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:05,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:05,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:26:05,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:26:05,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:05,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:26:05,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:06,484 INFO L124 PetriNetUnfolderBase]: 18048/24276 cut-off events. [2025-03-09 01:26:06,484 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-09 01:26:06,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48447 conditions, 24276 events. 18048/24276 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 1243. Compared 145004 event pairs, 15126 based on Foata normal form. 633/18658 useless extension candidates. Maximal degree in co-relation 40230. Up to 19698 conditions per place. [2025-03-09 01:26:06,618 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 94 selfloop transitions, 3 changer transitions 0/106 dead transitions. [2025-03-09 01:26:06,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 528 flow [2025-03-09 01:26:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-03-09 01:26:06,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-09 01:26:06,619 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 210 flow. Second operand 4 states and 160 transitions. [2025-03-09 01:26:06,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 528 flow [2025-03-09 01:26:06,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 106 transitions, 475 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-09 01:26:06,621 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 196 flow [2025-03-09 01:26:06,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2025-03-09 01:26:06,622 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-03-09 01:26:06,622 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 196 flow [2025-03-09 01:26:06,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:26:06,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:06,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:06,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:26:06,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:06,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:06,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1614158153, now seen corresponding path program 1 times [2025-03-09 01:26:06,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:06,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000567635] [2025-03-09 01:26:06,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:06,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:06,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:26:06,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:26:06,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:06,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:06,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:26:06,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:06,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000567635] [2025-03-09 01:26:06,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000567635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:06,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:06,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:06,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577962286] [2025-03-09 01:26:06,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:06,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:06,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:06,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:06,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:06,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:26:06,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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:26:06,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:06,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:26:06,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:07,408 INFO L124 PetriNetUnfolderBase]: 13848/18644 cut-off events. [2025-03-09 01:26:07,408 INFO L125 PetriNetUnfolderBase]: For 1228/1228 co-relation queries the response was YES. [2025-03-09 01:26:07,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39543 conditions, 18644 events. 13848/18644 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 107310 event pairs, 11474 based on Foata normal form. 0/14697 useless extension candidates. Maximal degree in co-relation 31371. Up to 18212 conditions per place. [2025-03-09 01:26:07,510 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 49 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2025-03-09 01:26:07,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 300 flow [2025-03-09 01:26:07,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:26:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:26:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-09 01:26:07,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-03-09 01:26:07,512 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 196 flow. Second operand 5 states and 126 transitions. [2025-03-09 01:26:07,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 300 flow [2025-03-09 01:26:07,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:07,514 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 197 flow [2025-03-09 01:26:07,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2025-03-09 01:26:07,515 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-03-09 01:26:07,515 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 197 flow [2025-03-09 01:26:07,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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:26:07,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:07,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:07,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:26:07,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:07,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:07,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1742262789, now seen corresponding path program 1 times [2025-03-09 01:26:07,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:07,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050127567] [2025-03-09 01:26:07,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:07,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:07,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:26:07,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:26:07,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:07,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:07,569 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:26:07,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:07,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050127567] [2025-03-09 01:26:07,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050127567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:07,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:07,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:26:07,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497677144] [2025-03-09 01:26:07,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:07,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:07,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:07,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:07,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:07,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:26:07,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:07,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:07,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:26:07,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:08,446 INFO L124 PetriNetUnfolderBase]: 16617/22735 cut-off events. [2025-03-09 01:26:08,446 INFO L125 PetriNetUnfolderBase]: For 1492/1492 co-relation queries the response was YES. [2025-03-09 01:26:08,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48250 conditions, 22735 events. 16617/22735 cut-off events. For 1492/1492 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 137348 event pairs, 13961 based on Foata normal form. 500/19275 useless extension candidates. Maximal degree in co-relation 31326. Up to 18228 conditions per place. [2025-03-09 01:26:08,551 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 79 selfloop transitions, 5 changer transitions 0/93 dead transitions. [2025-03-09 01:26:08,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 93 transitions, 437 flow [2025-03-09 01:26:08,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2025-03-09 01:26:08,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5795454545454546 [2025-03-09 01:26:08,553 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 197 flow. Second operand 4 states and 153 transitions. [2025-03-09 01:26:08,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 93 transitions, 437 flow [2025-03-09 01:26:08,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 93 transitions, 426 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:26:08,555 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 209 flow [2025-03-09 01:26:08,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-03-09 01:26:08,559 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-03-09 01:26:08,560 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 209 flow [2025-03-09 01:26:08,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:08,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:08,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:08,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:26:08,561 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:08,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:08,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1614158154, now seen corresponding path program 1 times [2025-03-09 01:26:08,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:08,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838524008] [2025-03-09 01:26:08,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:08,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:08,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:26:08,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:26:08,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:08,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:08,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:08,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838524008] [2025-03-09 01:26:08,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838524008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:08,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:08,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:26:08,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163690714] [2025-03-09 01:26:08,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:08,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:26:08,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:08,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:26:08,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:26:08,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:26:08,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:08,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:08,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:26:08,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:09,654 INFO L124 PetriNetUnfolderBase]: 12381/17033 cut-off events. [2025-03-09 01:26:09,655 INFO L125 PetriNetUnfolderBase]: For 2156/2156 co-relation queries the response was YES. [2025-03-09 01:26:09,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38014 conditions, 17033 events. 12381/17033 cut-off events. For 2156/2156 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 99681 event pairs, 10265 based on Foata normal form. 0/14883 useless extension candidates. Maximal degree in co-relation 22559. Up to 16572 conditions per place. [2025-03-09 01:26:09,720 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 50 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2025-03-09 01:26:09,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 309 flow [2025-03-09 01:26:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-09 01:26:09,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-09 01:26:09,721 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 209 flow. Second operand 4 states and 108 transitions. [2025-03-09 01:26:09,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 309 flow [2025-03-09 01:26:09,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:26:09,725 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 205 flow [2025-03-09 01:26:09,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2025-03-09 01:26:09,725 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-03-09 01:26:09,726 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 205 flow [2025-03-09 01:26:09,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:09,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:09,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:09,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:26:09,726 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:09,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:09,726 INFO L85 PathProgramCache]: Analyzing trace with hash 402937253, now seen corresponding path program 1 times [2025-03-09 01:26:09,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:09,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489466059] [2025-03-09 01:26:09,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:09,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:09,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:26:09,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:26:09,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:09,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:09,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:09,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489466059] [2025-03-09 01:26:09,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489466059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:09,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949674791] [2025-03-09 01:26:09,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:09,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:09,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:09,859 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:26:09,860 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:26:09,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:26:09,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:26:09,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:09,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:09,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:26:09,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:09,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:26:09,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949674791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:09,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:26:09,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-09 01:26:09,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109516672] [2025-03-09 01:26:09,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:09,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:26:09,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:09,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:26:09,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:26:09,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:26:09,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:26:09,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:09,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:26:10,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:10,490 INFO L124 PetriNetUnfolderBase]: 9642/13381 cut-off events. [2025-03-09 01:26:10,490 INFO L125 PetriNetUnfolderBase]: For 1781/1781 co-relation queries the response was YES. [2025-03-09 01:26:10,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29288 conditions, 13381 events. 9642/13381 cut-off events. For 1781/1781 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 76650 event pairs, 7905 based on Foata normal form. 0/12298 useless extension candidates. Maximal degree in co-relation 20923. Up to 12955 conditions per place. [2025-03-09 01:26:10,536 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 46 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2025-03-09 01:26:10,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 301 flow [2025-03-09 01:26:10,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:10,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-09 01:26:10,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-03-09 01:26:10,537 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 205 flow. Second operand 4 states and 114 transitions. [2025-03-09 01:26:10,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 301 flow [2025-03-09 01:26:10,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:10,539 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 204 flow [2025-03-09 01:26:10,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-03-09 01:26:10,540 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-03-09 01:26:10,540 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 204 flow [2025-03-09 01:26:10,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:26:10,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:10,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:10,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:26:10,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:10,741 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:10,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:10,741 INFO L85 PathProgramCache]: Analyzing trace with hash 402937252, now seen corresponding path program 1 times [2025-03-09 01:26:10,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:10,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111271124] [2025-03-09 01:26:10,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:10,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:10,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:26:10,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:26:10,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:10,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:26:10,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:10,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111271124] [2025-03-09 01:26:10,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111271124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:10,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:10,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:26:10,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27363229] [2025-03-09 01:26:10,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:10,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:26:10,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:10,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:26:10,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:26:10,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:26:10,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:26:10,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:10,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:26:10,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:11,201 INFO L124 PetriNetUnfolderBase]: 7325/10281 cut-off events. [2025-03-09 01:26:11,201 INFO L125 PetriNetUnfolderBase]: For 1446/1446 co-relation queries the response was YES. [2025-03-09 01:26:11,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21970 conditions, 10281 events. 7325/10281 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 57308 event pairs, 5929 based on Foata normal form. 0/10069 useless extension candidates. Maximal degree in co-relation 15703. Up to 9905 conditions per place. [2025-03-09 01:26:11,235 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 46 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2025-03-09 01:26:11,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 59 transitions, 296 flow [2025-03-09 01:26:11,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:26:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:26:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-03-09 01:26:11,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-03-09 01:26:11,236 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 204 flow. Second operand 4 states and 104 transitions. [2025-03-09 01:26:11,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 59 transitions, 296 flow [2025-03-09 01:26:11,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:11,238 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 195 flow [2025-03-09 01:26:11,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2025-03-09 01:26:11,239 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-03-09 01:26:11,239 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 195 flow [2025-03-09 01:26:11,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:26:11,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:11,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:11,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:26:11,239 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:11,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:11,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1237469583, now seen corresponding path program 1 times [2025-03-09 01:26:11,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:11,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702132456] [2025-03-09 01:26:11,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:11,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:11,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:26:11,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:26:11,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:11,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:11,274 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:26:11,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:11,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702132456] [2025-03-09 01:26:11,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702132456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:11,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:11,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:11,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960420087] [2025-03-09 01:26:11,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:11,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:26:11,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:11,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:26:11,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:26:11,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:26:11,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:26:11,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:11,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:26:11,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:11,848 INFO L124 PetriNetUnfolderBase]: 10490/14942 cut-off events. [2025-03-09 01:26:11,848 INFO L125 PetriNetUnfolderBase]: For 2435/2435 co-relation queries the response was YES. [2025-03-09 01:26:11,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31844 conditions, 14942 events. 10490/14942 cut-off events. For 2435/2435 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 87892 event pairs, 4096 based on Foata normal form. 4/14752 useless extension candidates. Maximal degree in co-relation 23677. Up to 7677 conditions per place. [2025-03-09 01:26:11,921 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 69 selfloop transitions, 3 changer transitions 1/82 dead transitions. [2025-03-09 01:26:11,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 400 flow [2025-03-09 01:26:11,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:26:11,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:26:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-09 01:26:11,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5858585858585859 [2025-03-09 01:26:11,922 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 195 flow. Second operand 3 states and 116 transitions. [2025-03-09 01:26:11,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 400 flow [2025-03-09 01:26:11,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 82 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:11,925 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 213 flow [2025-03-09 01:26:11,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-03-09 01:26:11,926 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-03-09 01:26:11,926 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 213 flow [2025-03-09 01:26:11,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:26:11,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:11,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:11,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:26:11,926 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:11,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:11,927 INFO L85 PathProgramCache]: Analyzing trace with hash -400618239, now seen corresponding path program 1 times [2025-03-09 01:26:11,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:11,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307062242] [2025-03-09 01:26:11,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:11,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:11,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:26:11,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:26:11,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:11,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:11,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:11,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307062242] [2025-03-09 01:26:11,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307062242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:11,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:11,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:11,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038032062] [2025-03-09 01:26:11,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:11,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:26:11,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:11,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:26:11,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:26:11,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:26:11,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:11,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:11,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:26:11,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:12,725 INFO L124 PetriNetUnfolderBase]: 12098/17404 cut-off events. [2025-03-09 01:26:12,725 INFO L125 PetriNetUnfolderBase]: For 6401/6401 co-relation queries the response was YES. [2025-03-09 01:26:12,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39204 conditions, 17404 events. 12098/17404 cut-off events. For 6401/6401 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 105752 event pairs, 5412 based on Foata normal form. 189/17498 useless extension candidates. Maximal degree in co-relation 29946. Up to 8516 conditions per place. [2025-03-09 01:26:12,794 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 74 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-03-09 01:26:12,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 434 flow [2025-03-09 01:26:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:26:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:26:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-09 01:26:12,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5858585858585859 [2025-03-09 01:26:12,795 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 213 flow. Second operand 3 states and 116 transitions. [2025-03-09 01:26:12,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 434 flow [2025-03-09 01:26:12,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 430 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:26:12,799 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 226 flow [2025-03-09 01:26:12,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2025-03-09 01:26:12,799 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-09 01:26:12,800 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 226 flow [2025-03-09 01:26:12,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:12,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:12,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:12,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:26:12,800 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:12,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash 204797277, now seen corresponding path program 1 times [2025-03-09 01:26:12,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:12,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932459434] [2025-03-09 01:26:12,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:12,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:12,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:26:12,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:26:12,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:12,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:26:12,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:12,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932459434] [2025-03-09 01:26:12,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932459434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:12,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:12,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:26:12,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769638686] [2025-03-09 01:26:12,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:12,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:26:12,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:12,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:26:12,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:26:12,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-09 01:26:12,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:12,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:12,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-09 01:26:12,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:13,815 INFO L124 PetriNetUnfolderBase]: 13581/19724 cut-off events. [2025-03-09 01:26:13,816 INFO L125 PetriNetUnfolderBase]: For 10710/10710 co-relation queries the response was YES. [2025-03-09 01:26:13,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45370 conditions, 19724 events. 13581/19724 cut-off events. For 10710/10710 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 122203 event pairs, 6108 based on Foata normal form. 345/19983 useless extension candidates. Maximal degree in co-relation 35668. Up to 10358 conditions per place. [2025-03-09 01:26:13,882 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 78 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-03-09 01:26:13,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 89 transitions, 472 flow [2025-03-09 01:26:13,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:26:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:26:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-03-09 01:26:13,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5959595959595959 [2025-03-09 01:26:13,883 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 226 flow. Second operand 3 states and 118 transitions. [2025-03-09 01:26:13,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 89 transitions, 472 flow [2025-03-09 01:26:13,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 89 transitions, 457 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-09 01:26:13,886 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 234 flow [2025-03-09 01:26:13,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2025-03-09 01:26:13,886 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-09 01:26:13,886 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 234 flow [2025-03-09 01:26:13,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:13,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:13,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:13,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:26:13,887 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:13,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1767795128, now seen corresponding path program 1 times [2025-03-09 01:26:13,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:13,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404799699] [2025-03-09 01:26:13,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:26:13,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:13,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 01:26:13,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:26:13,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:13,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:14,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:14,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404799699] [2025-03-09 01:26:14,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404799699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:14,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:14,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:26:14,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607001566] [2025-03-09 01:26:14,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:14,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:26:14,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:14,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:26:14,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:26:14,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:26:14,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 234 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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:26:14,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:14,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:26:14,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:16,217 INFO L124 PetriNetUnfolderBase]: 33757/46334 cut-off events. [2025-03-09 01:26:16,218 INFO L125 PetriNetUnfolderBase]: For 18054/18064 co-relation queries the response was YES. [2025-03-09 01:26:16,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108553 conditions, 46334 events. 33757/46334 cut-off events. For 18054/18064 co-relation queries the response was YES. Maximal size of possible extension queue 1432. Compared 291364 event pairs, 2176 based on Foata normal form. 0/42018 useless extension candidates. Maximal degree in co-relation 81404. Up to 25026 conditions per place. [2025-03-09 01:26:16,427 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 188 selfloop transitions, 17 changer transitions 6/218 dead transitions. [2025-03-09 01:26:16,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 218 transitions, 1133 flow [2025-03-09 01:26:16,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:26:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:26:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 333 transitions. [2025-03-09 01:26:16,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2025-03-09 01:26:16,428 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 234 flow. Second operand 9 states and 333 transitions. [2025-03-09 01:26:16,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 218 transitions, 1133 flow [2025-03-09 01:26:16,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 218 transitions, 1105 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-03-09 01:26:16,440 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 345 flow [2025-03-09 01:26:16,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=345, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2025-03-09 01:26:16,441 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 17 predicate places. [2025-03-09 01:26:16,441 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 345 flow [2025-03-09 01:26:16,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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:26:16,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:16,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:16,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:26:16,441 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:16,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:16,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1654162888, now seen corresponding path program 2 times [2025-03-09 01:26:16,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:16,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519516566] [2025-03-09 01:26:16,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:16,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:16,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-09 01:26:16,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 38 statements. [2025-03-09 01:26:16,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:26:16,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:16,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:16,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519516566] [2025-03-09 01:26:16,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519516566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:16,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:16,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:26:16,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086043141] [2025-03-09 01:26:16,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:16,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:26:16,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:16,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:26:16,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:26:16,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2025-03-09 01:26:16,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:16,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:16,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2025-03-09 01:26:16,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:19,921 INFO L124 PetriNetUnfolderBase]: 36284/51756 cut-off events. [2025-03-09 01:26:19,922 INFO L125 PetriNetUnfolderBase]: For 43372/43700 co-relation queries the response was YES. [2025-03-09 01:26:20,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145343 conditions, 51756 events. 36284/51756 cut-off events. For 43372/43700 co-relation queries the response was YES. Maximal size of possible extension queue 1823. Compared 357844 event pairs, 4118 based on Foata normal form. 2108/53402 useless extension candidates. Maximal degree in co-relation 107380. Up to 17752 conditions per place. [2025-03-09 01:26:20,245 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 161 selfloop transitions, 26 changer transitions 0/197 dead transitions. [2025-03-09 01:26:20,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 197 transitions, 1201 flow [2025-03-09 01:26:20,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:26:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:26:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 245 transitions. [2025-03-09 01:26:20,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2025-03-09 01:26:20,246 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 345 flow. Second operand 7 states and 245 transitions. [2025-03-09 01:26:20,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 197 transitions, 1201 flow [2025-03-09 01:26:20,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 197 transitions, 1201 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:26:20,506 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 497 flow [2025-03-09 01:26:20,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=497, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2025-03-09 01:26:20,507 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 27 predicate places. [2025-03-09 01:26:20,507 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 497 flow [2025-03-09 01:26:20,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:20,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:20,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:20,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:26:20,507 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:20,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:20,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1494638996, now seen corresponding path program 3 times [2025-03-09 01:26:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:20,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564447815] [2025-03-09 01:26:20,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:26:20,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:20,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 2 equivalence classes. [2025-03-09 01:26:20,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:26:20,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:26:20,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:20,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:20,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564447815] [2025-03-09 01:26:20,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564447815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:20,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:20,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:26:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402109786] [2025-03-09 01:26:20,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:20,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:26:20,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:20,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:26:20,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:26:20,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:26:20,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 497 flow. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:26:20,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:20,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:26:20,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:24,497 INFO L124 PetriNetUnfolderBase]: 43074/59902 cut-off events. [2025-03-09 01:26:24,498 INFO L125 PetriNetUnfolderBase]: For 95124/95134 co-relation queries the response was YES. [2025-03-09 01:26:24,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199101 conditions, 59902 events. 43074/59902 cut-off events. For 95124/95134 co-relation queries the response was YES. Maximal size of possible extension queue 1955. Compared 400192 event pairs, 4986 based on Foata normal form. 496/60308 useless extension candidates. Maximal degree in co-relation 145346. Up to 22656 conditions per place. [2025-03-09 01:26:24,929 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 189 selfloop transitions, 13 changer transitions 3/212 dead transitions. [2025-03-09 01:26:24,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 212 transitions, 1506 flow [2025-03-09 01:26:24,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:26:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:26:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2025-03-09 01:26:24,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2025-03-09 01:26:24,933 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 497 flow. Second operand 6 states and 222 transitions. [2025-03-09 01:26:24,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 212 transitions, 1506 flow [2025-03-09 01:26:25,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 212 transitions, 1506 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:26:25,778 INFO L231 Difference]: Finished difference. Result has 103 places, 98 transitions, 604 flow [2025-03-09 01:26:25,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=103, PETRI_TRANSITIONS=98} [2025-03-09 01:26:25,778 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 35 predicate places. [2025-03-09 01:26:25,779 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 98 transitions, 604 flow [2025-03-09 01:26:25,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:26:25,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:25,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:25,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:26:25,779 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:25,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1600564654, now seen corresponding path program 4 times [2025-03-09 01:26:25,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:25,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474749589] [2025-03-09 01:26:25,779 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:26:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:25,786 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-09 01:26:25,794 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:26:25,794 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:26:25,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:26,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:26,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474749589] [2025-03-09 01:26:26,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474749589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:26,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:26,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:26:26,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243896771] [2025-03-09 01:26:26,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:26,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:26:26,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:26,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:26:26,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:26:26,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2025-03-09 01:26:26,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 98 transitions, 604 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:26,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:26,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2025-03-09 01:26:26,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:35,236 INFO L124 PetriNetUnfolderBase]: 75319/110543 cut-off events. [2025-03-09 01:26:35,236 INFO L125 PetriNetUnfolderBase]: For 275680/275872 co-relation queries the response was YES. [2025-03-09 01:26:35,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395188 conditions, 110543 events. 75319/110543 cut-off events. For 275680/275872 co-relation queries the response was YES. Maximal size of possible extension queue 4089. Compared 872705 event pairs, 6430 based on Foata normal form. 3314/113282 useless extension candidates. Maximal degree in co-relation 302578. Up to 21652 conditions per place. [2025-03-09 01:26:36,157 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 296 selfloop transitions, 107 changer transitions 0/413 dead transitions. [2025-03-09 01:26:36,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 413 transitions, 3195 flow [2025-03-09 01:26:36,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:26:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:26:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 461 transitions. [2025-03-09 01:26:36,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5820707070707071 [2025-03-09 01:26:36,159 INFO L175 Difference]: Start difference. First operand has 103 places, 98 transitions, 604 flow. Second operand 12 states and 461 transitions. [2025-03-09 01:26:36,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 413 transitions, 3195 flow [2025-03-09 01:26:38,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 413 transitions, 3163 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:38,032 INFO L231 Difference]: Finished difference. Result has 122 places, 184 transitions, 1687 flow [2025-03-09 01:26:38,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1687, PETRI_PLACES=122, PETRI_TRANSITIONS=184} [2025-03-09 01:26:38,032 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 54 predicate places. [2025-03-09 01:26:38,032 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 184 transitions, 1687 flow [2025-03-09 01:26:38,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:38,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:38,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:26:38,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:26:38,033 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-09 01:26:38,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:38,033 INFO L85 PathProgramCache]: Analyzing trace with hash 611493832, now seen corresponding path program 5 times [2025-03-09 01:26:38,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:38,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646866802] [2025-03-09 01:26:38,034 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:26:38,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:38,042 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-09 01:26:38,050 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:26:38,050 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:38,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:38,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:38,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646866802] [2025-03-09 01:26:38,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646866802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:38,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:38,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:26:38,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949222295] [2025-03-09 01:26:38,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:38,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:26:38,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:38,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:26:38,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:26:38,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-09 01:26:38,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 184 transitions, 1687 flow. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:26:38,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:38,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-09 01:26:38,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand