./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.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-queue-add-3-nl.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 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:27:08,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:27:08,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:27:08,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:27:08,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:27:08,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:27:08,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:27:08,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:27:08,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:27:08,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:27:08,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:27:08,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:27:08,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:27:08,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:27:08,691 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:27:08,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:27:08,692 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:27:08,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:27:08,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:27:08,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:27:08,692 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:27:08,692 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:27:08,692 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:27:08,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:27:08,692 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:27:08,692 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:27:08,692 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:27:08,693 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:27:08,693 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:27:08,693 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:27:08,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:27:08,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:27:08,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:27:08,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:27:08,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:27:08,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:27:08,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:27:08,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:27:08,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:27:08,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:27:08,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:27:08,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:27:08,694 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 -> 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac [2025-03-09 01:27:08,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:27:08,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:27:08,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:27:08,927 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:27:08,928 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:27:08,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-03-09 01:27:10,023 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d80433dc/e8aa3f40a97d45ff836d37467108c8fd/FLAG5832d1cf9 [2025-03-09 01:27:10,233 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:27:10,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-03-09 01:27:10,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d80433dc/e8aa3f40a97d45ff836d37467108c8fd/FLAG5832d1cf9 [2025-03-09 01:27:10,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d80433dc/e8aa3f40a97d45ff836d37467108c8fd [2025-03-09 01:27:10,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:27:10,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:27:10,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:27:10,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:27:10,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:27:10,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:27:10" (1/1) ... [2025-03-09 01:27:10,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2e6837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:10, skipping insertion in model container [2025-03-09 01:27:10,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:27:10" (1/1) ... [2025-03-09 01:27:10,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:27:10,724 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:27:10,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:27:10,738 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:27:10,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:27:10,780 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:27:10,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:10 WrapperNode [2025-03-09 01:27:10,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:27:10,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:27:10,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:27:10,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:27:10,786 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:27:10" (1/1) ... [2025-03-09 01:27:10,791 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:27:10" (1/1) ... [2025-03-09 01:27:10,809 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 239 [2025-03-09 01:27:10,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:27:10,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:27:10,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:27:10,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:27:10,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:10" (1/1) ... [2025-03-09 01:27:10,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:10" (1/1) ... [2025-03-09 01:27:10,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:10" (1/1) ... [2025-03-09 01:27:10,845 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-09 01:27:10,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:10" (1/1) ... [2025-03-09 01:27:10,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:10" (1/1) ... [2025-03-09 01:27:10,850 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:10" (1/1) ... [2025-03-09 01:27:10,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:10" (1/1) ... [2025-03-09 01:27:10,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:10" (1/1) ... [2025-03-09 01:27:10,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:10" (1/1) ... [2025-03-09 01:27:10,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:27:10,862 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:27:10,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:27:10,866 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:27:10,866 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:10" (1/1) ... [2025-03-09 01:27:10,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:27:10,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:10,895 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:27:10,898 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:27:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:27:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:27:10,917 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:27:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:27:10,917 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:27:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:27:10,917 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:27:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:27:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:27:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:27:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:27:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:27:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:27:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:27:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:27:10,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:27:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:27:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:27:10,919 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:27:11,002 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:27:11,003 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:27:11,310 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:27:11,310 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:27:11,529 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:27:11,529 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:27:11,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:27:11 BoogieIcfgContainer [2025-03-09 01:27:11,529 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:27:11,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:27:11,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:27:11,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:27:11,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:27:10" (1/3) ... [2025-03-09 01:27:11,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1428608b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:27:11, skipping insertion in model container [2025-03-09 01:27:11,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:27:10" (2/3) ... [2025-03-09 01:27:11,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1428608b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:27:11, skipping insertion in model container [2025-03-09 01:27:11,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:27:11" (3/3) ... [2025-03-09 01:27:11,538 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-03-09 01:27:11,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:27:11,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-3-nl.wvr.c that has 4 procedures, 54 locations, 1 initial locations, 5 loop locations, and 16 error locations. [2025-03-09 01:27:11,552 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:27:11,601 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:27:11,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 60 transitions, 141 flow [2025-03-09 01:27:11,654 INFO L124 PetriNetUnfolderBase]: 7/57 cut-off events. [2025-03-09 01:27:11,656 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:27:11,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 7/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-03-09 01:27:11,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 60 transitions, 141 flow [2025-03-09 01:27:11,663 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 56 transitions, 130 flow [2025-03-09 01:27:11,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:27:11,681 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;@3c26fd18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:27:11,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-09 01:27:11,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:27:11,685 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:27:11,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:27:11,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:11,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:27:11,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:11,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:11,691 INFO L85 PathProgramCache]: Analyzing trace with hash 670549, now seen corresponding path program 1 times [2025-03-09 01:27:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:11,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522464244] [2025-03-09 01:27:11,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:11,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:11,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:27:11,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:27:11,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:11,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:11,887 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:27:11,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:11,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522464244] [2025-03-09 01:27:11,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522464244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:11,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:11,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:27:11,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733441708] [2025-03-09 01:27:11,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:11,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:27:11,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:11,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:27:11,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:27:11,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:27:11,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:27:11,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:11,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:27:11,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:12,552 INFO L124 PetriNetUnfolderBase]: 3952/5920 cut-off events. [2025-03-09 01:27:12,552 INFO L125 PetriNetUnfolderBase]: For 289/289 co-relation queries the response was YES. [2025-03-09 01:27:12,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11621 conditions, 5920 events. 3952/5920 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32790 event pairs, 3528 based on Foata normal form. 1/3860 useless extension candidates. Maximal degree in co-relation 11101. Up to 5391 conditions per place. [2025-03-09 01:27:12,590 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 40 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-03-09 01:27:12,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 202 flow [2025-03-09 01:27:12,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:27:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:27:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-09 01:27:12,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2025-03-09 01:27:12,601 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 130 flow. Second operand 3 states and 83 transitions. [2025-03-09 01:27:12,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 202 flow [2025-03-09 01:27:12,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 190 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:27:12,615 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 110 flow [2025-03-09 01:27:12,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2025-03-09 01:27:12,619 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2025-03-09 01:27:12,621 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 110 flow [2025-03-09 01:27:12,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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:27:12,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:12,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:27:12,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:27:12,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:12,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:12,622 INFO L85 PathProgramCache]: Analyzing trace with hash 670550, now seen corresponding path program 1 times [2025-03-09 01:27:12,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:12,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564474519] [2025-03-09 01:27:12,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:12,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:12,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:27:12,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:27:12,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:12,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:12,845 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:27:12,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:12,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564474519] [2025-03-09 01:27:12,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564474519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:12,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:12,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:27:12,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550952733] [2025-03-09 01:27:12,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:12,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:27:12,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:12,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:27:12,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:27:12,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:27:12,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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:27:12,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:12,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:27:12,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:13,324 INFO L124 PetriNetUnfolderBase]: 3953/5923 cut-off events. [2025-03-09 01:27:13,325 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-09 01:27:13,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11440 conditions, 5923 events. 3953/5923 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32817 event pairs, 3528 based on Foata normal form. 0/3860 useless extension candidates. Maximal degree in co-relation 11411. Up to 5400 conditions per place. [2025-03-09 01:27:13,356 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 43 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-03-09 01:27:13,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 210 flow [2025-03-09 01:27:13,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:27:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:27:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-09 01:27:13,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-09 01:27:13,359 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 110 flow. Second operand 4 states and 96 transitions. [2025-03-09 01:27:13,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 210 flow [2025-03-09 01:27:13,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:13,361 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 133 flow [2025-03-09 01:27:13,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2025-03-09 01:27:13,362 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2025-03-09 01:27:13,362 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 133 flow [2025-03-09 01:27:13,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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:27:13,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:13,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:27:13,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:27:13,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:13,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:13,365 INFO L85 PathProgramCache]: Analyzing trace with hash 20788875, now seen corresponding path program 1 times [2025-03-09 01:27:13,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:13,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383557210] [2025-03-09 01:27:13,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:13,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:27:13,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:27:13,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:13,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:13,579 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:27:13,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:13,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383557210] [2025-03-09 01:27:13,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383557210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:13,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:13,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:27:13,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413844691] [2025-03-09 01:27:13,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:13,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:27:13,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:13,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:27:13,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:27:13,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:27:13,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:13,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:13,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:27:13,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:13,971 INFO L124 PetriNetUnfolderBase]: 3954/5926 cut-off events. [2025-03-09 01:27:13,972 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-09 01:27:13,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11457 conditions, 5926 events. 3954/5926 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32812 event pairs, 3528 based on Foata normal form. 0/3862 useless extension candidates. Maximal degree in co-relation 11432. Up to 5399 conditions per place. [2025-03-09 01:27:13,998 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 43 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2025-03-09 01:27:13,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 239 flow [2025-03-09 01:27:13,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:27:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:27:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-09 01:27:14,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37 [2025-03-09 01:27:14,000 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 133 flow. Second operand 5 states and 111 transitions. [2025-03-09 01:27:14,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 239 flow [2025-03-09 01:27:14,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:27:14,001 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 167 flow [2025-03-09 01:27:14,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2025-03-09 01:27:14,002 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-03-09 01:27:14,002 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 167 flow [2025-03-09 01:27:14,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:14,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:14,002 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:27:14,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:27:14,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:14,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:14,003 INFO L85 PathProgramCache]: Analyzing trace with hash 644419464, now seen corresponding path program 1 times [2025-03-09 01:27:14,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:14,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17756814] [2025-03-09 01:27:14,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:14,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:14,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:27:14,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:27:14,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:14,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:14,166 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:27:14,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:14,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17756814] [2025-03-09 01:27:14,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17756814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:14,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392424180] [2025-03-09 01:27:14,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:14,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:14,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:14,169 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:27:14,171 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:27:14,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:27:14,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:27:14,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:14,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:14,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:27:14,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:14,269 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:27:14,440 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:27:14,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:14,525 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:27:14,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392424180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:14,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:14,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:27:14,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686655916] [2025-03-09 01:27:14,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:14,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:14,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:14,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:14,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:14,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:27:14,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 167 flow. Second operand has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:27:14,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:14,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:27:14,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:15,077 INFO L124 PetriNetUnfolderBase]: 3955/5928 cut-off events. [2025-03-09 01:27:15,078 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-09 01:27:15,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11480 conditions, 5928 events. 3955/5928 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32803 event pairs, 3528 based on Foata normal form. 0/3867 useless extension candidates. Maximal degree in co-relation 11442. Up to 5400 conditions per place. [2025-03-09 01:27:15,105 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 42 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2025-03-09 01:27:15,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 282 flow [2025-03-09 01:27:15,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:27:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:27:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2025-03-09 01:27:15,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30625 [2025-03-09 01:27:15,107 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 167 flow. Second operand 8 states and 147 transitions. [2025-03-09 01:27:15,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 58 transitions, 282 flow [2025-03-09 01:27:15,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:27:15,108 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 197 flow [2025-03-09 01:27:15,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=197, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2025-03-09 01:27:15,109 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2025-03-09 01:27:15,109 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 197 flow [2025-03-09 01:27:15,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:27:15,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:15,109 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 01:27:15,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:27:15,314 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:27:15,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:15,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:15,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1496705940, now seen corresponding path program 1 times [2025-03-09 01:27:15,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:15,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735918434] [2025-03-09 01:27:15,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:15,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:15,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:27:15,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:27:15,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:15,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:15,543 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:27:15,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:15,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735918434] [2025-03-09 01:27:15,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735918434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:15,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958561250] [2025-03-09 01:27:15,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:15,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:15,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:15,548 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:27:15,550 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:27:15,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:27:15,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:27:15,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:15,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:15,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:27:15,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:15,635 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:27:15,797 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:27:15,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:27:15,960 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:27:15,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958561250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:27:15,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:27:15,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:27:15,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588641153] [2025-03-09 01:27:15,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:27:15,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:27:15,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:15,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:27:15,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:27:16,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:27:16,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 197 flow. Second operand has 13 states, 13 states have (on average 13.307692307692308) internal successors, (173), 13 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:16,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:16,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:27:16,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:16,554 INFO L124 PetriNetUnfolderBase]: 3955/5927 cut-off events. [2025-03-09 01:27:16,555 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-09 01:27:16,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11487 conditions, 5927 events. 3955/5927 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32866 event pairs, 3528 based on Foata normal form. 0/3867 useless extension candidates. Maximal degree in co-relation 11441. Up to 5391 conditions per place. [2025-03-09 01:27:16,581 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 36 selfloop transitions, 15 changer transitions 0/57 dead transitions. [2025-03-09 01:27:16,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 57 transitions, 295 flow [2025-03-09 01:27:16,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:27:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:27:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2025-03-09 01:27:16,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2025-03-09 01:27:16,583 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 197 flow. Second operand 7 states and 133 transitions. [2025-03-09 01:27:16,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 57 transitions, 295 flow [2025-03-09 01:27:16,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 248 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-09 01:27:16,586 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 176 flow [2025-03-09 01:27:16,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2025-03-09 01:27:16,586 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2025-03-09 01:27:16,587 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 176 flow [2025-03-09 01:27:16,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.307692307692308) internal successors, (173), 13 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:16,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:16,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:16,594 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:27:16,788 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:27:16,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:16,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:16,789 INFO L85 PathProgramCache]: Analyzing trace with hash 850045723, now seen corresponding path program 1 times [2025-03-09 01:27:16,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:16,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435158047] [2025-03-09 01:27:16,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:16,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:16,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:27:16,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:27:16,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:16,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:16,843 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:27:16,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:16,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435158047] [2025-03-09 01:27:16,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435158047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:16,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:16,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:27:16,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451995] [2025-03-09 01:27:16,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:16,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:27:16,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:16,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:27:16,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:27:16,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:27:16,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:27:16,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:16,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:27:16,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:17,178 INFO L124 PetriNetUnfolderBase]: 4115/6207 cut-off events. [2025-03-09 01:27:17,178 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-09 01:27:17,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12034 conditions, 6207 events. 4115/6207 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 34472 event pairs, 3675 based on Foata normal form. 115/4226 useless extension candidates. Maximal degree in co-relation 11435. Up to 5403 conditions per place. [2025-03-09 01:27:17,201 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 66 selfloop transitions, 5 changer transitions 1/78 dead transitions. [2025-03-09 01:27:17,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 391 flow [2025-03-09 01:27:17,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:27:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:27:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-03-09 01:27:17,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-09 01:27:17,202 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 176 flow. Second operand 5 states and 145 transitions. [2025-03-09 01:27:17,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 391 flow [2025-03-09 01:27:17,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 350 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-09 01:27:17,204 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 194 flow [2025-03-09 01:27:17,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2025-03-09 01:27:17,204 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2025-03-09 01:27:17,204 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 194 flow [2025-03-09 01:27:17,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:27:17,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:17,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:17,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:27:17,205 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:17,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:17,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1472194995, now seen corresponding path program 1 times [2025-03-09 01:27:17,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:17,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203844629] [2025-03-09 01:27:17,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:17,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:17,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:27:17,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:27:17,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:17,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:17,289 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:27:17,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:17,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203844629] [2025-03-09 01:27:17,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203844629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:17,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:17,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:27:17,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294244462] [2025-03-09 01:27:17,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:17,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:27:17,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:17,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:27:17,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:27:17,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:27:17,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:27:17,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:17,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:27:17,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:17,564 INFO L124 PetriNetUnfolderBase]: 3026/4591 cut-off events. [2025-03-09 01:27:17,564 INFO L125 PetriNetUnfolderBase]: For 415/415 co-relation queries the response was YES. [2025-03-09 01:27:17,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9751 conditions, 4591 events. 3026/4591 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 24054 event pairs, 2670 based on Foata normal form. 0/3305 useless extension candidates. Maximal degree in co-relation 9177. Up to 4162 conditions per place. [2025-03-09 01:27:17,580 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 43 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2025-03-09 01:27:17,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 56 transitions, 282 flow [2025-03-09 01:27:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:27:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:27:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2025-03-09 01:27:17,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34 [2025-03-09 01:27:17,582 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 194 flow. Second operand 5 states and 102 transitions. [2025-03-09 01:27:17,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 56 transitions, 282 flow [2025-03-09 01:27:17,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:17,583 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 191 flow [2025-03-09 01:27:17,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-03-09 01:27:17,584 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2025-03-09 01:27:17,584 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 191 flow [2025-03-09 01:27:17,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:27:17,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:17,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:17,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:27:17,584 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:17,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:17,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1472194994, now seen corresponding path program 1 times [2025-03-09 01:27:17,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:17,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816620331] [2025-03-09 01:27:17,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:17,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:17,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:27:17,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:27:17,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:17,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:17,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:17,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816620331] [2025-03-09 01:27:17,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816620331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:17,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446472453] [2025-03-09 01:27:17,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:17,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:17,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:17,742 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:27:17,744 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:27:17,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:27:17,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:27:17,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:17,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:17,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:27:17,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:17,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:27:17,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:27:17,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 01:27:17,859 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:27:17,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:27:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:27:17,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:27:17,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446472453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:17,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:27:17,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-03-09 01:27:17,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045430522] [2025-03-09 01:27:17,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:17,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:27:17,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:17,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:27:17,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:27:17,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:27:17,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:27:17,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:17,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:27:17,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:18,056 INFO L124 PetriNetUnfolderBase]: 2129/3275 cut-off events. [2025-03-09 01:27:18,057 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2025-03-09 01:27:18,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6656 conditions, 3275 events. 2129/3275 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16007 event pairs, 1813 based on Foata normal form. 0/2642 useless extension candidates. Maximal degree in co-relation 6038. Up to 2905 conditions per place. [2025-03-09 01:27:18,069 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 43 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-03-09 01:27:18,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 273 flow [2025-03-09 01:27:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:27:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:27:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-09 01:27:18,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3625 [2025-03-09 01:27:18,070 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 191 flow. Second operand 4 states and 87 transitions. [2025-03-09 01:27:18,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 273 flow [2025-03-09 01:27:18,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:27:18,072 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 176 flow [2025-03-09 01:27:18,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-03-09 01:27:18,074 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2025-03-09 01:27:18,075 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 176 flow [2025-03-09 01:27:18,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:27:18,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:18,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:18,081 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:27:18,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:18,279 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:18,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:18,279 INFO L85 PathProgramCache]: Analyzing trace with hash -558181929, now seen corresponding path program 1 times [2025-03-09 01:27:18,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:18,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423929614] [2025-03-09 01:27:18,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:18,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:18,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:27:18,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:27:18,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:18,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:18,307 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:27:18,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:18,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423929614] [2025-03-09 01:27:18,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423929614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:18,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:18,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:27:18,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035654192] [2025-03-09 01:27:18,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:18,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:27:18,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:18,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:27:18,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:27:18,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:27:18,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:18,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:18,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:27:18,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:18,461 INFO L124 PetriNetUnfolderBase]: 1935/2979 cut-off events. [2025-03-09 01:27:18,461 INFO L125 PetriNetUnfolderBase]: For 416/416 co-relation queries the response was YES. [2025-03-09 01:27:18,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6244 conditions, 2979 events. 1935/2979 cut-off events. For 416/416 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14241 event pairs, 695 based on Foata normal form. 77/2497 useless extension candidates. Maximal degree in co-relation 5992. Up to 2082 conditions per place. [2025-03-09 01:27:18,472 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 57 selfloop transitions, 2 changer transitions 3/68 dead transitions. [2025-03-09 01:27:18,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 338 flow [2025-03-09 01:27:18,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:27:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:27:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-09 01:27:18,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-09 01:27:18,473 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 176 flow. Second operand 3 states and 96 transitions. [2025-03-09 01:27:18,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 338 flow [2025-03-09 01:27:18,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:18,474 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 165 flow [2025-03-09 01:27:18,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2025-03-09 01:27:18,475 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-03-09 01:27:18,475 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 165 flow [2025-03-09 01:27:18,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:18,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:18,475 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:18,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:27:18,475 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:18,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1771972020, now seen corresponding path program 1 times [2025-03-09 01:27:18,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:18,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427373383] [2025-03-09 01:27:18,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:18,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:18,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:27:18,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:27:18,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:18,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:18,506 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:27:18,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:18,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427373383] [2025-03-09 01:27:18,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427373383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:18,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:18,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:27:18,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915899408] [2025-03-09 01:27:18,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:18,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:27:18,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:18,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:27:18,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:27:18,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:27:18,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:27:18,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:18,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:27:18,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:18,637 INFO L124 PetriNetUnfolderBase]: 1664/2560 cut-off events. [2025-03-09 01:27:18,638 INFO L125 PetriNetUnfolderBase]: For 502/502 co-relation queries the response was YES. [2025-03-09 01:27:18,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5765 conditions, 2560 events. 1664/2560 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11740 event pairs, 717 based on Foata normal form. 18/2225 useless extension candidates. Maximal degree in co-relation 5729. Up to 2249 conditions per place. [2025-03-09 01:27:18,646 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 52 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2025-03-09 01:27:18,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 301 flow [2025-03-09 01:27:18,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:27:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:27:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-09 01:27:18,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2025-03-09 01:27:18,647 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 165 flow. Second operand 3 states and 89 transitions. [2025-03-09 01:27:18,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 301 flow [2025-03-09 01:27:18,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 295 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:18,649 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 182 flow [2025-03-09 01:27:18,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-03-09 01:27:18,649 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2025-03-09 01:27:18,649 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 182 flow [2025-03-09 01:27:18,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:27:18,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:18,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:18,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:27:18,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:18,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1018152558, now seen corresponding path program 1 times [2025-03-09 01:27:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:18,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396572041] [2025-03-09 01:27:18,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:18,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:18,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:27:18,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:27:18,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:18,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:27:18,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:18,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396572041] [2025-03-09 01:27:18,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396572041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:18,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:18,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:27:18,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623343916] [2025-03-09 01:27:18,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:18,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:27:18,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:18,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:27:18,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:27:18,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:27:18,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:27:18,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:18,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:27:18,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:18,900 INFO L124 PetriNetUnfolderBase]: 1905/2949 cut-off events. [2025-03-09 01:27:18,900 INFO L125 PetriNetUnfolderBase]: For 1505/1505 co-relation queries the response was YES. [2025-03-09 01:27:18,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7200 conditions, 2949 events. 1905/2949 cut-off events. For 1505/1505 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13506 event pairs, 1453 based on Foata normal form. 64/2659 useless extension candidates. Maximal degree in co-relation 7163. Up to 2349 conditions per place. [2025-03-09 01:27:18,909 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 43 selfloop transitions, 3 changer transitions 19/71 dead transitions. [2025-03-09 01:27:18,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 374 flow [2025-03-09 01:27:18,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:27:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:27:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-09 01:27:18,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-03-09 01:27:18,910 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 182 flow. Second operand 4 states and 114 transitions. [2025-03-09 01:27:18,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 374 flow [2025-03-09 01:27:18,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 349 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:18,912 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 176 flow [2025-03-09 01:27:18,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2025-03-09 01:27:18,913 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2025-03-09 01:27:18,913 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 176 flow [2025-03-09 01:27:18,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:27:18,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:18,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:18,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:27:18,913 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:18,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:18,914 INFO L85 PathProgramCache]: Analyzing trace with hash 924549831, now seen corresponding path program 1 times [2025-03-09 01:27:18,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:18,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946044738] [2025-03-09 01:27:18,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:18,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:27:18,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:27:18,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:18,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:27:19,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:19,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946044738] [2025-03-09 01:27:19,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946044738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:27:19,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775964461] [2025-03-09 01:27:19,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:19,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:19,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:27:19,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:27:19,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:27:19,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:27:19,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:27:19,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:19,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:19,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:27:19,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:27:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:27:19,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:27:19,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775964461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:19,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:27:19,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-09 01:27:19,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302896143] [2025-03-09 01:27:19,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:19,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:27:19,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:19,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:27:19,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:27:19,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:27:19,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:27:19,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:19,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:27:19,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:19,359 INFO L124 PetriNetUnfolderBase]: 1255/1957 cut-off events. [2025-03-09 01:27:19,359 INFO L125 PetriNetUnfolderBase]: For 488/488 co-relation queries the response was YES. [2025-03-09 01:27:19,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 1957 events. 1255/1957 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8568 event pairs, 929 based on Foata normal form. 0/1814 useless extension candidates. Maximal degree in co-relation 4473. Up to 1766 conditions per place. [2025-03-09 01:27:19,366 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 41 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2025-03-09 01:27:19,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 50 transitions, 256 flow [2025-03-09 01:27:19,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:27:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:27:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-03-09 01:27:19,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2025-03-09 01:27:19,367 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 176 flow. Second operand 4 states and 92 transitions. [2025-03-09 01:27:19,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 50 transitions, 256 flow [2025-03-09 01:27:19,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 249 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:19,369 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 167 flow [2025-03-09 01:27:19,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2025-03-09 01:27:19,369 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2025-03-09 01:27:19,369 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 167 flow [2025-03-09 01:27:19,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:27:19,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:19,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:19,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:27:19,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:27:19,571 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:19,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:19,571 INFO L85 PathProgramCache]: Analyzing trace with hash 924549830, now seen corresponding path program 1 times [2025-03-09 01:27:19,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:19,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388950211] [2025-03-09 01:27:19,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:19,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:19,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:27:19,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:27:19,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:19,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:27:19,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:19,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388950211] [2025-03-09 01:27:19,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388950211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:19,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:19,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:27:19,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818896187] [2025-03-09 01:27:19,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:19,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:27:19,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:19,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:27:19,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:27:19,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:27:19,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:19,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:19,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:27:19,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:19,735 INFO L124 PetriNetUnfolderBase]: 901/1439 cut-off events. [2025-03-09 01:27:19,735 INFO L125 PetriNetUnfolderBase]: For 315/315 co-relation queries the response was YES. [2025-03-09 01:27:19,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3204 conditions, 1439 events. 901/1439 cut-off events. For 315/315 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6066 event pairs, 653 based on Foata normal form. 97/1461 useless extension candidates. Maximal degree in co-relation 3164. Up to 1270 conditions per place. [2025-03-09 01:27:19,740 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 40 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2025-03-09 01:27:19,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 245 flow [2025-03-09 01:27:19,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:27:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:27:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-03-09 01:27:19,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2025-03-09 01:27:19,741 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 167 flow. Second operand 4 states and 82 transitions. [2025-03-09 01:27:19,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 245 flow [2025-03-09 01:27:19,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:19,742 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 160 flow [2025-03-09 01:27:19,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2025-03-09 01:27:19,743 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-03-09 01:27:19,744 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 160 flow [2025-03-09 01:27:19,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:27:19,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:19,744 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] [2025-03-09 01:27:19,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:27:19,744 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:19,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:19,744 INFO L85 PathProgramCache]: Analyzing trace with hash 173188446, now seen corresponding path program 1 times [2025-03-09 01:27:19,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:19,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920866456] [2025-03-09 01:27:19,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:27:19,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:19,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:27:19,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:19,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:19,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:20,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:20,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920866456] [2025-03-09 01:27:20,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920866456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:20,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:20,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:20,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702220068] [2025-03-09 01:27:20,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:20,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:20,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:20,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:20,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:20,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:20,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 160 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:20,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:20,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:20,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:20,855 INFO L124 PetriNetUnfolderBase]: 1303/2122 cut-off events. [2025-03-09 01:27:20,855 INFO L125 PetriNetUnfolderBase]: For 456/456 co-relation queries the response was YES. [2025-03-09 01:27:20,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4706 conditions, 2122 events. 1303/2122 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10368 event pairs, 135 based on Foata normal form. 1/2069 useless extension candidates. Maximal degree in co-relation 4667. Up to 1406 conditions per place. [2025-03-09 01:27:20,862 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 106 selfloop transitions, 25 changer transitions 3/139 dead transitions. [2025-03-09 01:27:20,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 139 transitions, 675 flow [2025-03-09 01:27:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:27:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:27:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 283 transitions. [2025-03-09 01:27:20,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39305555555555555 [2025-03-09 01:27:20,863 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 160 flow. Second operand 12 states and 283 transitions. [2025-03-09 01:27:20,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 139 transitions, 675 flow [2025-03-09 01:27:20,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 139 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:20,865 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 293 flow [2025-03-09 01:27:20,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=293, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2025-03-09 01:27:20,866 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2025-03-09 01:27:20,866 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 293 flow [2025-03-09 01:27:20,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:20,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:20,866 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] [2025-03-09 01:27:20,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:27:20,866 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:20,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:20,867 INFO L85 PathProgramCache]: Analyzing trace with hash -56616962, now seen corresponding path program 2 times [2025-03-09 01:27:20,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:20,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852862156] [2025-03-09 01:27:20,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:20,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:20,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:27:20,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:20,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:20,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:21,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:21,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852862156] [2025-03-09 01:27:21,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852862156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:21,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:21,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:21,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934624643] [2025-03-09 01:27:21,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:21,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:21,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:21,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:21,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:21,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 293 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:21,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:21,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:21,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:21,826 INFO L124 PetriNetUnfolderBase]: 1470/2398 cut-off events. [2025-03-09 01:27:21,827 INFO L125 PetriNetUnfolderBase]: For 1566/1566 co-relation queries the response was YES. [2025-03-09 01:27:21,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6578 conditions, 2398 events. 1470/2398 cut-off events. For 1566/1566 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11955 event pairs, 357 based on Foata normal form. 1/2333 useless extension candidates. Maximal degree in co-relation 6534. Up to 1747 conditions per place. [2025-03-09 01:27:21,836 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 105 selfloop transitions, 33 changer transitions 3/146 dead transitions. [2025-03-09 01:27:21,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 146 transitions, 862 flow [2025-03-09 01:27:21,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 259 transitions. [2025-03-09 01:27:21,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3924242424242424 [2025-03-09 01:27:21,839 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 293 flow. Second operand 11 states and 259 transitions. [2025-03-09 01:27:21,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 146 transitions, 862 flow [2025-03-09 01:27:21,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 146 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:21,843 INFO L231 Difference]: Finished difference. Result has 86 places, 91 transitions, 517 flow [2025-03-09 01:27:21,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=517, PETRI_PLACES=86, PETRI_TRANSITIONS=91} [2025-03-09 01:27:21,844 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 27 predicate places. [2025-03-09 01:27:21,844 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 517 flow [2025-03-09 01:27:21,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:21,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:21,844 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] [2025-03-09 01:27:21,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:27:21,844 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:21,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:21,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1354919364, now seen corresponding path program 3 times [2025-03-09 01:27:21,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:21,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320185876] [2025-03-09 01:27:21,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:27:21,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:21,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:21,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-03-09 01:27:21,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:27:21,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:22,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:22,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320185876] [2025-03-09 01:27:22,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320185876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:22,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:22,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:22,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103623365] [2025-03-09 01:27:22,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:22,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:22,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:22,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:22,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:22,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:22,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 517 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:22,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:22,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:22,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:22,885 INFO L124 PetriNetUnfolderBase]: 1577/2602 cut-off events. [2025-03-09 01:27:22,885 INFO L125 PetriNetUnfolderBase]: For 3141/3141 co-relation queries the response was YES. [2025-03-09 01:27:22,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7943 conditions, 2602 events. 1577/2602 cut-off events. For 3141/3141 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13430 event pairs, 306 based on Foata normal form. 1/2537 useless extension candidates. Maximal degree in co-relation 7891. Up to 1798 conditions per place. [2025-03-09 01:27:22,896 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 118 selfloop transitions, 39 changer transitions 3/165 dead transitions. [2025-03-09 01:27:22,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 165 transitions, 1120 flow [2025-03-09 01:27:22,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:27:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:27:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 283 transitions. [2025-03-09 01:27:22,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39305555555555555 [2025-03-09 01:27:22,898 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 517 flow. Second operand 12 states and 283 transitions. [2025-03-09 01:27:22,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 165 transitions, 1120 flow [2025-03-09 01:27:22,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 165 transitions, 1102 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-09 01:27:22,904 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 642 flow [2025-03-09 01:27:22,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=642, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2025-03-09 01:27:22,904 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 40 predicate places. [2025-03-09 01:27:22,904 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 642 flow [2025-03-09 01:27:22,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:22,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:22,905 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] [2025-03-09 01:27:22,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:27:22,905 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:22,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1639452504, now seen corresponding path program 4 times [2025-03-09 01:27:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:22,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157230414] [2025-03-09 01:27:22,905 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:27:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:22,912 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:27:22,929 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:22,929 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:27:22,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:23,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:23,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157230414] [2025-03-09 01:27:23,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157230414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:23,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:23,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:23,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069860152] [2025-03-09 01:27:23,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:23,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:23,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:23,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:23,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:23,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:27:23,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 642 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:27:23,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:23,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:27:23,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:23,881 INFO L124 PetriNetUnfolderBase]: 1942/3180 cut-off events. [2025-03-09 01:27:23,881 INFO L125 PetriNetUnfolderBase]: For 6254/6254 co-relation queries the response was YES. [2025-03-09 01:27:23,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10331 conditions, 3180 events. 1942/3180 cut-off events. For 6254/6254 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17108 event pairs, 450 based on Foata normal form. 1/3088 useless extension candidates. Maximal degree in co-relation 10275. Up to 2176 conditions per place. [2025-03-09 01:27:23,896 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 128 selfloop transitions, 43 changer transitions 3/178 dead transitions. [2025-03-09 01:27:23,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 178 transitions, 1335 flow [2025-03-09 01:27:23,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:27:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:27:23,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 277 transitions. [2025-03-09 01:27:23,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38472222222222224 [2025-03-09 01:27:23,897 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 642 flow. Second operand 12 states and 277 transitions. [2025-03-09 01:27:23,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 178 transitions, 1335 flow [2025-03-09 01:27:23,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 178 transitions, 1265 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-03-09 01:27:23,907 INFO L231 Difference]: Finished difference. Result has 106 places, 106 transitions, 754 flow [2025-03-09 01:27:23,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=754, PETRI_PLACES=106, PETRI_TRANSITIONS=106} [2025-03-09 01:27:23,908 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 47 predicate places. [2025-03-09 01:27:23,908 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 106 transitions, 754 flow [2025-03-09 01:27:23,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:27:23,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:23,908 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] [2025-03-09 01:27:23,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:27:23,909 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:23,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:23,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1818237882, now seen corresponding path program 5 times [2025-03-09 01:27:23,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:23,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801679255] [2025-03-09 01:27:23,909 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:27:23,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:23,916 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:23,929 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:23,929 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:27:23,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:24,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:24,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801679255] [2025-03-09 01:27:24,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801679255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:24,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:24,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:24,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927550912] [2025-03-09 01:27:24,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:24,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:24,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:24,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:24,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:24,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:24,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 106 transitions, 754 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:24,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:24,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:24,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:24,776 INFO L124 PetriNetUnfolderBase]: 1744/2908 cut-off events. [2025-03-09 01:27:24,776 INFO L125 PetriNetUnfolderBase]: For 7313/7313 co-relation queries the response was YES. [2025-03-09 01:27:24,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10081 conditions, 2908 events. 1744/2908 cut-off events. For 7313/7313 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15775 event pairs, 410 based on Foata normal form. 1/2825 useless extension candidates. Maximal degree in co-relation 10021. Up to 2171 conditions per place. [2025-03-09 01:27:24,788 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 123 selfloop transitions, 38 changer transitions 3/169 dead transitions. [2025-03-09 01:27:24,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 169 transitions, 1340 flow [2025-03-09 01:27:24,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:27:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:27:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 274 transitions. [2025-03-09 01:27:24,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38055555555555554 [2025-03-09 01:27:24,790 INFO L175 Difference]: Start difference. First operand has 106 places, 106 transitions, 754 flow. Second operand 12 states and 274 transitions. [2025-03-09 01:27:24,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 169 transitions, 1340 flow [2025-03-09 01:27:24,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 169 transitions, 1252 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-03-09 01:27:24,799 INFO L231 Difference]: Finished difference. Result has 113 places, 109 transitions, 775 flow [2025-03-09 01:27:24,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=775, PETRI_PLACES=113, PETRI_TRANSITIONS=109} [2025-03-09 01:27:24,799 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 54 predicate places. [2025-03-09 01:27:24,799 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 109 transitions, 775 flow [2025-03-09 01:27:24,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:24,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:24,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] [2025-03-09 01:27:24,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:27:24,800 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:24,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:24,800 INFO L85 PathProgramCache]: Analyzing trace with hash 917378694, now seen corresponding path program 6 times [2025-03-09 01:27:24,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:24,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175533370] [2025-03-09 01:27:24,800 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:27:24,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:24,806 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:24,821 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:24,821 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:27:24,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:25,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175533370] [2025-03-09 01:27:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175533370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:25,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:25,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242552842] [2025-03-09 01:27:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:25,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:25,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:25,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:25,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:25,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:25,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 109 transitions, 775 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:25,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:25,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:25,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:25,729 INFO L124 PetriNetUnfolderBase]: 1866/3130 cut-off events. [2025-03-09 01:27:25,729 INFO L125 PetriNetUnfolderBase]: For 8038/8038 co-relation queries the response was YES. [2025-03-09 01:27:25,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10874 conditions, 3130 events. 1866/3130 cut-off events. For 8038/8038 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17354 event pairs, 597 based on Foata normal form. 1/3040 useless extension candidates. Maximal degree in co-relation 10811. Up to 2438 conditions per place. [2025-03-09 01:27:25,739 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 130 selfloop transitions, 36 changer transitions 3/174 dead transitions. [2025-03-09 01:27:25,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 174 transitions, 1468 flow [2025-03-09 01:27:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 258 transitions. [2025-03-09 01:27:25,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2025-03-09 01:27:25,741 INFO L175 Difference]: Start difference. First operand has 113 places, 109 transitions, 775 flow. Second operand 11 states and 258 transitions. [2025-03-09 01:27:25,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 174 transitions, 1468 flow [2025-03-09 01:27:25,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 174 transitions, 1382 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-03-09 01:27:25,753 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 922 flow [2025-03-09 01:27:25,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=922, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2025-03-09 01:27:25,753 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 60 predicate places. [2025-03-09 01:27:25,753 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 922 flow [2025-03-09 01:27:25,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:25,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:25,754 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] [2025-03-09 01:27:25,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:27:25,754 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:25,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash -571622078, now seen corresponding path program 7 times [2025-03-09 01:27:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:25,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555389318] [2025-03-09 01:27:25,754 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:27:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:25,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:27:25,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:25,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:25,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:26,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:26,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555389318] [2025-03-09 01:27:26,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555389318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:26,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:26,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:26,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452478881] [2025-03-09 01:27:26,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:26,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:26,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:26,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:26,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:26,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:26,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 922 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:26,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:26,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:26,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:26,659 INFO L124 PetriNetUnfolderBase]: 2006/3370 cut-off events. [2025-03-09 01:27:26,659 INFO L125 PetriNetUnfolderBase]: For 13299/13299 co-relation queries the response was YES. [2025-03-09 01:27:26,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12455 conditions, 3370 events. 2006/3370 cut-off events. For 13299/13299 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19274 event pairs, 582 based on Foata normal form. 1/3273 useless extension candidates. Maximal degree in co-relation 12387. Up to 2643 conditions per place. [2025-03-09 01:27:26,677 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 139 selfloop transitions, 36 changer transitions 3/183 dead transitions. [2025-03-09 01:27:26,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 183 transitions, 1651 flow [2025-03-09 01:27:26,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 255 transitions. [2025-03-09 01:27:26,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2025-03-09 01:27:26,678 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 922 flow. Second operand 11 states and 255 transitions. [2025-03-09 01:27:26,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 183 transitions, 1651 flow [2025-03-09 01:27:26,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 183 transitions, 1564 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-03-09 01:27:26,695 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 1068 flow [2025-03-09 01:27:26,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1068, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2025-03-09 01:27:26,696 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 72 predicate places. [2025-03-09 01:27:26,696 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 1068 flow [2025-03-09 01:27:26,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:26,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:26,696 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] [2025-03-09 01:27:26,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:27:26,696 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:26,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:26,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2085198884, now seen corresponding path program 8 times [2025-03-09 01:27:26,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:26,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526990354] [2025-03-09 01:27:26,696 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:26,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:26,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:27:26,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:26,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:26,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:27,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:27,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526990354] [2025-03-09 01:27:27,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526990354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:27,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:27,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:27,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845168989] [2025-03-09 01:27:27,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:27,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:27,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:27,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:27,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:27,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:27,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 1068 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:27,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:27,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:27,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:27,594 INFO L124 PetriNetUnfolderBase]: 2138/3597 cut-off events. [2025-03-09 01:27:27,594 INFO L125 PetriNetUnfolderBase]: For 21163/21163 co-relation queries the response was YES. [2025-03-09 01:27:27,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14201 conditions, 3597 events. 2138/3597 cut-off events. For 21163/21163 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 20876 event pairs, 659 based on Foata normal form. 1/3504 useless extension candidates. Maximal degree in co-relation 14128. Up to 2847 conditions per place. [2025-03-09 01:27:27,610 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 150 selfloop transitions, 36 changer transitions 3/194 dead transitions. [2025-03-09 01:27:27,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 194 transitions, 1851 flow [2025-03-09 01:27:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 257 transitions. [2025-03-09 01:27:27,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3893939393939394 [2025-03-09 01:27:27,612 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 1068 flow. Second operand 11 states and 257 transitions. [2025-03-09 01:27:27,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 194 transitions, 1851 flow [2025-03-09 01:27:27,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 194 transitions, 1723 flow, removed 47 selfloop flow, removed 5 redundant places. [2025-03-09 01:27:27,643 INFO L231 Difference]: Finished difference. Result has 139 places, 138 transitions, 1154 flow [2025-03-09 01:27:27,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1154, PETRI_PLACES=139, PETRI_TRANSITIONS=138} [2025-03-09 01:27:27,644 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 80 predicate places. [2025-03-09 01:27:27,644 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 138 transitions, 1154 flow [2025-03-09 01:27:27,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:27,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:27,644 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] [2025-03-09 01:27:27,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:27:27,644 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:27,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1683240630, now seen corresponding path program 9 times [2025-03-09 01:27:27,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:27,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091894544] [2025-03-09 01:27:27,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:27:27,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:27,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:27,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-03-09 01:27:27,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:27:27,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:28,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:28,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091894544] [2025-03-09 01:27:28,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091894544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:28,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:28,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:28,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140985194] [2025-03-09 01:27:28,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:28,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:28,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:28,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:28,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:28,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:28,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 138 transitions, 1154 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:28,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:28,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:28,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:28,590 INFO L124 PetriNetUnfolderBase]: 2325/3905 cut-off events. [2025-03-09 01:27:28,590 INFO L125 PetriNetUnfolderBase]: For 27883/27883 co-relation queries the response was YES. [2025-03-09 01:27:28,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16122 conditions, 3905 events. 2325/3905 cut-off events. For 27883/27883 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 23299 event pairs, 707 based on Foata normal form. 1/3800 useless extension candidates. Maximal degree in co-relation 16045. Up to 3059 conditions per place. [2025-03-09 01:27:28,614 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 164 selfloop transitions, 39 changer transitions 3/211 dead transitions. [2025-03-09 01:27:28,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 211 transitions, 2046 flow [2025-03-09 01:27:28,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 268 transitions. [2025-03-09 01:27:28,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2025-03-09 01:27:28,616 INFO L175 Difference]: Start difference. First operand has 139 places, 138 transitions, 1154 flow. Second operand 11 states and 268 transitions. [2025-03-09 01:27:28,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 211 transitions, 2046 flow [2025-03-09 01:27:28,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 211 transitions, 1916 flow, removed 48 selfloop flow, removed 5 redundant places. [2025-03-09 01:27:28,652 INFO L231 Difference]: Finished difference. Result has 148 places, 147 transitions, 1291 flow [2025-03-09 01:27:28,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1291, PETRI_PLACES=148, PETRI_TRANSITIONS=147} [2025-03-09 01:27:28,652 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 89 predicate places. [2025-03-09 01:27:28,652 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 147 transitions, 1291 flow [2025-03-09 01:27:28,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:28,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:28,652 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] [2025-03-09 01:27:28,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:27:28,653 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:28,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1803085242, now seen corresponding path program 10 times [2025-03-09 01:27:28,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:28,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804980611] [2025-03-09 01:27:28,653 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:27:28,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:28,659 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:27:28,672 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:28,672 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:27:28,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:28,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:28,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804980611] [2025-03-09 01:27:28,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804980611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:28,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:28,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:28,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690492991] [2025-03-09 01:27:28,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:28,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:28,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:28,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:28,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:28,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:27:28,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 147 transitions, 1291 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:27:28,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:28,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:27:28,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:29,474 INFO L124 PetriNetUnfolderBase]: 2584/4285 cut-off events. [2025-03-09 01:27:29,474 INFO L125 PetriNetUnfolderBase]: For 34680/34680 co-relation queries the response was YES. [2025-03-09 01:27:29,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18014 conditions, 4285 events. 2584/4285 cut-off events. For 34680/34680 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 25503 event pairs, 907 based on Foata normal form. 1/4176 useless extension candidates. Maximal degree in co-relation 17932. Up to 3571 conditions per place. [2025-03-09 01:27:29,497 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 156 selfloop transitions, 36 changer transitions 4/200 dead transitions. [2025-03-09 01:27:29,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 200 transitions, 1983 flow [2025-03-09 01:27:29,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:29,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 238 transitions. [2025-03-09 01:27:29,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3606060606060606 [2025-03-09 01:27:29,498 INFO L175 Difference]: Start difference. First operand has 148 places, 147 transitions, 1291 flow. Second operand 11 states and 238 transitions. [2025-03-09 01:27:29,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 200 transitions, 1983 flow [2025-03-09 01:27:29,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 200 transitions, 1843 flow, removed 52 selfloop flow, removed 5 redundant places. [2025-03-09 01:27:29,535 INFO L231 Difference]: Finished difference. Result has 156 places, 153 transitions, 1320 flow [2025-03-09 01:27:29,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1320, PETRI_PLACES=156, PETRI_TRANSITIONS=153} [2025-03-09 01:27:29,535 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 97 predicate places. [2025-03-09 01:27:29,535 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 1320 flow [2025-03-09 01:27:29,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:27:29,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:29,536 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] [2025-03-09 01:27:29,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 01:27:29,536 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:29,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:29,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2060528892, now seen corresponding path program 11 times [2025-03-09 01:27:29,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:29,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665759388] [2025-03-09 01:27:29,536 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:27:29,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:29,544 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:29,559 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:29,559 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:27:29,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:29,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:29,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665759388] [2025-03-09 01:27:29,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665759388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:29,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:29,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:29,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474575180] [2025-03-09 01:27:29,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:29,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:29,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:29,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:29,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:29,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:29,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 1320 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:29,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:29,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:29,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:30,480 INFO L124 PetriNetUnfolderBase]: 2537/4257 cut-off events. [2025-03-09 01:27:30,480 INFO L125 PetriNetUnfolderBase]: For 33946/33946 co-relation queries the response was YES. [2025-03-09 01:27:30,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17996 conditions, 4257 events. 2537/4257 cut-off events. For 33946/33946 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 25860 event pairs, 841 based on Foata normal form. 1/4158 useless extension candidates. Maximal degree in co-relation 17909. Up to 3353 conditions per place. [2025-03-09 01:27:30,502 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 165 selfloop transitions, 42 changer transitions 3/215 dead transitions. [2025-03-09 01:27:30,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 215 transitions, 2188 flow [2025-03-09 01:27:30,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 258 transitions. [2025-03-09 01:27:30,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2025-03-09 01:27:30,503 INFO L175 Difference]: Start difference. First operand has 156 places, 153 transitions, 1320 flow. Second operand 11 states and 258 transitions. [2025-03-09 01:27:30,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 215 transitions, 2188 flow [2025-03-09 01:27:30,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 215 transitions, 2078 flow, removed 35 selfloop flow, removed 6 redundant places. [2025-03-09 01:27:30,562 INFO L231 Difference]: Finished difference. Result has 163 places, 160 transitions, 1485 flow [2025-03-09 01:27:30,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1485, PETRI_PLACES=163, PETRI_TRANSITIONS=160} [2025-03-09 01:27:30,562 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 104 predicate places. [2025-03-09 01:27:30,563 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 160 transitions, 1485 flow [2025-03-09 01:27:30,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:30,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:30,563 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] [2025-03-09 01:27:30,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 01:27:30,563 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:30,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash 406063840, now seen corresponding path program 12 times [2025-03-09 01:27:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:30,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998428504] [2025-03-09 01:27:30,563 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:27:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:30,569 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:30,582 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:30,582 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:27:30,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:30,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:30,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998428504] [2025-03-09 01:27:30,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998428504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:30,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:30,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:30,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086267426] [2025-03-09 01:27:30,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:30,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:30,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:30,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:30,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:30,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:30,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 160 transitions, 1485 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:30,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:30,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:30,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:31,489 INFO L124 PetriNetUnfolderBase]: 2537/4255 cut-off events. [2025-03-09 01:27:31,489 INFO L125 PetriNetUnfolderBase]: For 40317/40317 co-relation queries the response was YES. [2025-03-09 01:27:31,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18622 conditions, 4255 events. 2537/4255 cut-off events. For 40317/40317 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 25852 event pairs, 851 based on Foata normal form. 1/4156 useless extension candidates. Maximal degree in co-relation 18531. Up to 3391 conditions per place. [2025-03-09 01:27:31,513 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 173 selfloop transitions, 41 changer transitions 5/224 dead transitions. [2025-03-09 01:27:31,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 224 transitions, 2273 flow [2025-03-09 01:27:31,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 266 transitions. [2025-03-09 01:27:31,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2025-03-09 01:27:31,514 INFO L175 Difference]: Start difference. First operand has 163 places, 160 transitions, 1485 flow. Second operand 11 states and 266 transitions. [2025-03-09 01:27:31,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 224 transitions, 2273 flow [2025-03-09 01:27:31,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 224 transitions, 2105 flow, removed 64 selfloop flow, removed 6 redundant places. [2025-03-09 01:27:31,567 INFO L231 Difference]: Finished difference. Result has 169 places, 164 transitions, 1450 flow [2025-03-09 01:27:31,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1450, PETRI_PLACES=169, PETRI_TRANSITIONS=164} [2025-03-09 01:27:31,567 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 110 predicate places. [2025-03-09 01:27:31,567 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 164 transitions, 1450 flow [2025-03-09 01:27:31,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:31,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:31,568 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] [2025-03-09 01:27:31,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 01:27:31,568 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:31,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash 222633420, now seen corresponding path program 13 times [2025-03-09 01:27:31,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:31,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621811195] [2025-03-09 01:27:31,568 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:27:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:31,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:27:31,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:31,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:31,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:31,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:31,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621811195] [2025-03-09 01:27:31,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621811195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:31,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:31,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:31,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734765596] [2025-03-09 01:27:31,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:31,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:31,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:31,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:31,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:31,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:31,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 164 transitions, 1450 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:31,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:31,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:31,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:32,525 INFO L124 PetriNetUnfolderBase]: 2573/4322 cut-off events. [2025-03-09 01:27:32,525 INFO L125 PetriNetUnfolderBase]: For 35434/35434 co-relation queries the response was YES. [2025-03-09 01:27:32,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18298 conditions, 4322 events. 2573/4322 cut-off events. For 35434/35434 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 26412 event pairs, 939 based on Foata normal form. 1/4224 useless extension candidates. Maximal degree in co-relation 18204. Up to 3642 conditions per place. [2025-03-09 01:27:32,559 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 168 selfloop transitions, 37 changer transitions 3/213 dead transitions. [2025-03-09 01:27:32,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 213 transitions, 2132 flow [2025-03-09 01:27:32,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 247 transitions. [2025-03-09 01:27:32,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37424242424242427 [2025-03-09 01:27:32,562 INFO L175 Difference]: Start difference. First operand has 169 places, 164 transitions, 1450 flow. Second operand 11 states and 247 transitions. [2025-03-09 01:27:32,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 213 transitions, 2132 flow [2025-03-09 01:27:32,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 213 transitions, 2025 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-03-09 01:27:32,610 INFO L231 Difference]: Finished difference. Result has 174 places, 167 transitions, 1467 flow [2025-03-09 01:27:32,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1467, PETRI_PLACES=174, PETRI_TRANSITIONS=167} [2025-03-09 01:27:32,610 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 115 predicate places. [2025-03-09 01:27:32,610 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 167 transitions, 1467 flow [2025-03-09 01:27:32,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:32,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:32,611 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] [2025-03-09 01:27:32,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 01:27:32,611 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:32,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:32,611 INFO L85 PathProgramCache]: Analyzing trace with hash 109296388, now seen corresponding path program 14 times [2025-03-09 01:27:32,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:32,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584783687] [2025-03-09 01:27:32,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:32,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:32,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:27:32,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:32,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:32,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:32,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:32,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584783687] [2025-03-09 01:27:32,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584783687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:32,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:32,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:32,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723348819] [2025-03-09 01:27:32,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:32,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:32,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:32,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:32,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:32,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:32,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 167 transitions, 1467 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:32,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:32,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:32,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:33,435 INFO L124 PetriNetUnfolderBase]: 2594/4368 cut-off events. [2025-03-09 01:27:33,435 INFO L125 PetriNetUnfolderBase]: For 35527/35527 co-relation queries the response was YES. [2025-03-09 01:27:33,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18372 conditions, 4368 events. 2594/4368 cut-off events. For 35527/35527 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 26900 event pairs, 866 based on Foata normal form. 1/4263 useless extension candidates. Maximal degree in co-relation 18275. Up to 3424 conditions per place. [2025-03-09 01:27:33,461 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 175 selfloop transitions, 46 changer transitions 5/231 dead transitions. [2025-03-09 01:27:33,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 231 transitions, 2265 flow [2025-03-09 01:27:33,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 265 transitions. [2025-03-09 01:27:33,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-03-09 01:27:33,462 INFO L175 Difference]: Start difference. First operand has 174 places, 167 transitions, 1467 flow. Second operand 11 states and 265 transitions. [2025-03-09 01:27:33,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 231 transitions, 2265 flow [2025-03-09 01:27:33,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 231 transitions, 2161 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-03-09 01:27:33,507 INFO L231 Difference]: Finished difference. Result has 179 places, 173 transitions, 1562 flow [2025-03-09 01:27:33,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1562, PETRI_PLACES=179, PETRI_TRANSITIONS=173} [2025-03-09 01:27:33,508 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 120 predicate places. [2025-03-09 01:27:33,508 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 173 transitions, 1562 flow [2025-03-09 01:27:33,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:33,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:33,508 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] [2025-03-09 01:27:33,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 01:27:33,508 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:33,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash -650892984, now seen corresponding path program 15 times [2025-03-09 01:27:33,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:33,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771344217] [2025-03-09 01:27:33,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:27:33,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:33,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:33,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-03-09 01:27:33,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:27:33,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:33,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:33,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771344217] [2025-03-09 01:27:33,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771344217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:33,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:33,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:33,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453872621] [2025-03-09 01:27:33,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:33,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:33,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:33,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:33,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:33,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:33,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 173 transitions, 1562 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:33,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:33,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:33,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:34,352 INFO L124 PetriNetUnfolderBase]: 2594/4362 cut-off events. [2025-03-09 01:27:34,352 INFO L125 PetriNetUnfolderBase]: For 37310/37310 co-relation queries the response was YES. [2025-03-09 01:27:34,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18650 conditions, 4362 events. 2594/4362 cut-off events. For 37310/37310 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 26784 event pairs, 960 based on Foata normal form. 1/4259 useless extension candidates. Maximal degree in co-relation 18550. Up to 3688 conditions per place. [2025-03-09 01:27:34,379 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 176 selfloop transitions, 35 changer transitions 3/219 dead transitions. [2025-03-09 01:27:34,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 219 transitions, 2228 flow [2025-03-09 01:27:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 244 transitions. [2025-03-09 01:27:34,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3696969696969697 [2025-03-09 01:27:34,380 INFO L175 Difference]: Start difference. First operand has 179 places, 173 transitions, 1562 flow. Second operand 11 states and 244 transitions. [2025-03-09 01:27:34,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 219 transitions, 2228 flow [2025-03-09 01:27:34,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 219 transitions, 2101 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-03-09 01:27:34,434 INFO L231 Difference]: Finished difference. Result has 184 places, 175 transitions, 1529 flow [2025-03-09 01:27:34,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1529, PETRI_PLACES=184, PETRI_TRANSITIONS=175} [2025-03-09 01:27:34,434 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 125 predicate places. [2025-03-09 01:27:34,434 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 175 transitions, 1529 flow [2025-03-09 01:27:34,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:34,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:34,435 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] [2025-03-09 01:27:34,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 01:27:34,435 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:34,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:34,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2103728354, now seen corresponding path program 16 times [2025-03-09 01:27:34,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:34,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445694580] [2025-03-09 01:27:34,435 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:27:34,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:34,440 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:27:34,453 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:34,454 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:27:34,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:34,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:34,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445694580] [2025-03-09 01:27:34,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445694580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:34,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:34,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:34,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616732681] [2025-03-09 01:27:34,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:34,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:34,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:34,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:34,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:34,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:27:34,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 175 transitions, 1529 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:27:34,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:34,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:27:34,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:35,501 INFO L124 PetriNetUnfolderBase]: 3035/5061 cut-off events. [2025-03-09 01:27:35,501 INFO L125 PetriNetUnfolderBase]: For 52405/52437 co-relation queries the response was YES. [2025-03-09 01:27:35,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22460 conditions, 5061 events. 3035/5061 cut-off events. For 52405/52437 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 32111 event pairs, 992 based on Foata normal form. 1/4939 useless extension candidates. Maximal degree in co-relation 22357. Up to 3967 conditions per place. [2025-03-09 01:27:35,535 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 205 selfloop transitions, 44 changer transitions 3/256 dead transitions. [2025-03-09 01:27:35,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 256 transitions, 2684 flow [2025-03-09 01:27:35,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:27:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:27:35,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 275 transitions. [2025-03-09 01:27:35,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2025-03-09 01:27:35,536 INFO L175 Difference]: Start difference. First operand has 184 places, 175 transitions, 1529 flow. Second operand 12 states and 275 transitions. [2025-03-09 01:27:35,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 256 transitions, 2684 flow [2025-03-09 01:27:35,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 256 transitions, 2616 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-09 01:27:35,684 INFO L231 Difference]: Finished difference. Result has 191 places, 187 transitions, 1824 flow [2025-03-09 01:27:35,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1824, PETRI_PLACES=191, PETRI_TRANSITIONS=187} [2025-03-09 01:27:35,685 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 132 predicate places. [2025-03-09 01:27:35,685 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 187 transitions, 1824 flow [2025-03-09 01:27:35,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:27:35,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:35,685 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] [2025-03-09 01:27:35,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 01:27:35,685 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:35,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:35,685 INFO L85 PathProgramCache]: Analyzing trace with hash -463582376, now seen corresponding path program 17 times [2025-03-09 01:27:35,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:35,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118185239] [2025-03-09 01:27:35,686 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:27:35,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:35,691 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:35,702 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:35,703 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:27:35,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:36,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:36,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118185239] [2025-03-09 01:27:36,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118185239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:36,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:36,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:36,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64692776] [2025-03-09 01:27:36,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:36,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:36,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:36,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:36,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:36,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:36,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 187 transitions, 1824 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:36,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:36,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:36,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:36,849 INFO L124 PetriNetUnfolderBase]: 3034/5112 cut-off events. [2025-03-09 01:27:36,849 INFO L125 PetriNetUnfolderBase]: For 65097/65097 co-relation queries the response was YES. [2025-03-09 01:27:36,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24169 conditions, 5112 events. 3034/5112 cut-off events. For 65097/65097 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 32887 event pairs, 984 based on Foata normal form. 1/5003 useless extension candidates. Maximal degree in co-relation 24062. Up to 3910 conditions per place. [2025-03-09 01:27:36,884 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 201 selfloop transitions, 54 changer transitions 3/263 dead transitions. [2025-03-09 01:27:36,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 263 transitions, 3039 flow [2025-03-09 01:27:36,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:27:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:27:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 284 transitions. [2025-03-09 01:27:36,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2025-03-09 01:27:36,886 INFO L175 Difference]: Start difference. First operand has 191 places, 187 transitions, 1824 flow. Second operand 12 states and 284 transitions. [2025-03-09 01:27:36,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 263 transitions, 3039 flow [2025-03-09 01:27:36,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 263 transitions, 2783 flow, removed 111 selfloop flow, removed 5 redundant places. [2025-03-09 01:27:36,978 INFO L231 Difference]: Finished difference. Result has 201 places, 198 transitions, 1991 flow [2025-03-09 01:27:36,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1991, PETRI_PLACES=201, PETRI_TRANSITIONS=198} [2025-03-09 01:27:36,978 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 142 predicate places. [2025-03-09 01:27:36,978 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 198 transitions, 1991 flow [2025-03-09 01:27:36,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:36,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:36,979 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] [2025-03-09 01:27:36,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-09 01:27:36,979 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:36,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:36,979 INFO L85 PathProgramCache]: Analyzing trace with hash -716735442, now seen corresponding path program 18 times [2025-03-09 01:27:36,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:36,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544393405] [2025-03-09 01:27:36,979 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:27:36,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:36,984 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:36,994 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:36,994 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:27:36,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:37,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:37,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544393405] [2025-03-09 01:27:37,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544393405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:37,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:37,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:37,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199486651] [2025-03-09 01:27:37,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:37,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:37,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:37,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:37,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:37,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:37,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 198 transitions, 1991 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:37,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:37,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:37,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:38,133 INFO L124 PetriNetUnfolderBase]: 3130/5276 cut-off events. [2025-03-09 01:27:38,133 INFO L125 PetriNetUnfolderBase]: For 76386/76386 co-relation queries the response was YES. [2025-03-09 01:27:38,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25564 conditions, 5276 events. 3130/5276 cut-off events. For 76386/76386 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 34247 event pairs, 1104 based on Foata normal form. 1/5167 useless extension candidates. Maximal degree in co-relation 25452. Up to 4182 conditions per place. [2025-03-09 01:27:38,178 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 210 selfloop transitions, 49 changer transitions 3/267 dead transitions. [2025-03-09 01:27:38,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 267 transitions, 3085 flow [2025-03-09 01:27:38,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:27:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:27:38,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 281 transitions. [2025-03-09 01:27:38,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3902777777777778 [2025-03-09 01:27:38,179 INFO L175 Difference]: Start difference. First operand has 201 places, 198 transitions, 1991 flow. Second operand 12 states and 281 transitions. [2025-03-09 01:27:38,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 267 transitions, 3085 flow [2025-03-09 01:27:38,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 267 transitions, 2870 flow, removed 83 selfloop flow, removed 7 redundant places. [2025-03-09 01:27:38,356 INFO L231 Difference]: Finished difference. Result has 208 places, 204 transitions, 2048 flow [2025-03-09 01:27:38,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2048, PETRI_PLACES=208, PETRI_TRANSITIONS=204} [2025-03-09 01:27:38,357 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 149 predicate places. [2025-03-09 01:27:38,357 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 204 transitions, 2048 flow [2025-03-09 01:27:38,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:38,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:38,357 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] [2025-03-09 01:27:38,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-09 01:27:38,357 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:38,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash -746241490, now seen corresponding path program 19 times [2025-03-09 01:27:38,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:38,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010676013] [2025-03-09 01:27:38,358 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:27:38,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:38,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:27:38,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:38,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:38,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:38,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010676013] [2025-03-09 01:27:38,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010676013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:38,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:38,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868719017] [2025-03-09 01:27:38,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:38,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:38,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:38,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:38,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:38,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:38,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 204 transitions, 2048 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:38,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:38,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:38,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:39,369 INFO L124 PetriNetUnfolderBase]: 3132/5300 cut-off events. [2025-03-09 01:27:39,369 INFO L125 PetriNetUnfolderBase]: For 76035/76035 co-relation queries the response was YES. [2025-03-09 01:27:39,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25458 conditions, 5300 events. 3132/5300 cut-off events. For 76035/76035 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 34848 event pairs, 1030 based on Foata normal form. 1/5184 useless extension candidates. Maximal degree in co-relation 25343. Up to 4259 conditions per place. [2025-03-09 01:27:39,400 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 207 selfloop transitions, 51 changer transitions 4/267 dead transitions. [2025-03-09 01:27:39,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 267 transitions, 3012 flow [2025-03-09 01:27:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:27:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:27:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 278 transitions. [2025-03-09 01:27:39,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3861111111111111 [2025-03-09 01:27:39,401 INFO L175 Difference]: Start difference. First operand has 208 places, 204 transitions, 2048 flow. Second operand 12 states and 278 transitions. [2025-03-09 01:27:39,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 267 transitions, 3012 flow [2025-03-09 01:27:39,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 267 transitions, 2847 flow, removed 57 selfloop flow, removed 8 redundant places. [2025-03-09 01:27:39,566 INFO L231 Difference]: Finished difference. Result has 213 places, 208 transitions, 2063 flow [2025-03-09 01:27:39,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2063, PETRI_PLACES=213, PETRI_TRANSITIONS=208} [2025-03-09 01:27:39,567 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 154 predicate places. [2025-03-09 01:27:39,567 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 208 transitions, 2063 flow [2025-03-09 01:27:39,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:39,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:39,567 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] [2025-03-09 01:27:39,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-09 01:27:39,567 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:39,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:39,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1191601460, now seen corresponding path program 20 times [2025-03-09 01:27:39,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:39,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492439982] [2025-03-09 01:27:39,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:39,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:39,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:27:39,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:39,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:39,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:39,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:39,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492439982] [2025-03-09 01:27:39,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492439982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:39,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:39,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:39,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436208322] [2025-03-09 01:27:39,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:39,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:39,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:39,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:39,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:39,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 208 transitions, 2063 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:39,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:39,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:39,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:40,829 INFO L124 PetriNetUnfolderBase]: 3357/5667 cut-off events. [2025-03-09 01:27:40,829 INFO L125 PetriNetUnfolderBase]: For 88289/88289 co-relation queries the response was YES. [2025-03-09 01:27:40,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28297 conditions, 5667 events. 3357/5667 cut-off events. For 88289/88289 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 37699 event pairs, 1313 based on Foata normal form. 1/5537 useless extension candidates. Maximal degree in co-relation 28180. Up to 4708 conditions per place. [2025-03-09 01:27:40,876 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 237 selfloop transitions, 39 changer transitions 3/284 dead transitions. [2025-03-09 01:27:40,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 284 transitions, 3402 flow [2025-03-09 01:27:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 271 transitions. [2025-03-09 01:27:40,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4106060606060606 [2025-03-09 01:27:40,878 INFO L175 Difference]: Start difference. First operand has 213 places, 208 transitions, 2063 flow. Second operand 11 states and 271 transitions. [2025-03-09 01:27:40,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 284 transitions, 3402 flow [2025-03-09 01:27:41,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 284 transitions, 3238 flow, removed 31 selfloop flow, removed 10 redundant places. [2025-03-09 01:27:41,066 INFO L231 Difference]: Finished difference. Result has 218 places, 220 transitions, 2331 flow [2025-03-09 01:27:41,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2331, PETRI_PLACES=218, PETRI_TRANSITIONS=220} [2025-03-09 01:27:41,067 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 159 predicate places. [2025-03-09 01:27:41,067 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 220 transitions, 2331 flow [2025-03-09 01:27:41,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:41,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:41,067 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] [2025-03-09 01:27:41,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-09 01:27:41,067 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:41,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:41,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1230925262, now seen corresponding path program 21 times [2025-03-09 01:27:41,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:41,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093534051] [2025-03-09 01:27:41,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:27:41,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:41,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:41,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-03-09 01:27:41,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:27:41,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:41,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:41,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093534051] [2025-03-09 01:27:41,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093534051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:41,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029675052] [2025-03-09 01:27:41,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:41,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:41,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:41,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:41,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:41,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:41,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 220 transitions, 2331 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:41,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:41,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:41,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:42,087 INFO L124 PetriNetUnfolderBase]: 3418/5761 cut-off events. [2025-03-09 01:27:42,087 INFO L125 PetriNetUnfolderBase]: For 98808/98808 co-relation queries the response was YES. [2025-03-09 01:27:42,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29262 conditions, 5761 events. 3418/5761 cut-off events. For 98808/98808 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 38268 event pairs, 1449 based on Foata normal form. 1/5640 useless extension candidates. Maximal degree in co-relation 29141. Up to 4978 conditions per place. [2025-03-09 01:27:42,129 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 227 selfloop transitions, 36 changer transitions 4/272 dead transitions. [2025-03-09 01:27:42,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 272 transitions, 3311 flow [2025-03-09 01:27:42,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 250 transitions. [2025-03-09 01:27:42,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2025-03-09 01:27:42,130 INFO L175 Difference]: Start difference. First operand has 218 places, 220 transitions, 2331 flow. Second operand 11 states and 250 transitions. [2025-03-09 01:27:42,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 272 transitions, 3311 flow [2025-03-09 01:27:42,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 272 transitions, 3061 flow, removed 109 selfloop flow, removed 4 redundant places. [2025-03-09 01:27:42,281 INFO L231 Difference]: Finished difference. Result has 227 places, 226 transitions, 2314 flow [2025-03-09 01:27:42,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2101, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2314, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2025-03-09 01:27:42,282 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 168 predicate places. [2025-03-09 01:27:42,282 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 2314 flow [2025-03-09 01:27:42,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:42,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:42,282 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] [2025-03-09 01:27:42,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-09 01:27:42,282 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:42,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1488368912, now seen corresponding path program 22 times [2025-03-09 01:27:42,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:42,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914345162] [2025-03-09 01:27:42,283 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:27:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:42,289 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:27:42,299 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:42,299 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:27:42,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:42,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:42,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914345162] [2025-03-09 01:27:42,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914345162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:42,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:42,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:42,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674502312] [2025-03-09 01:27:42,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:42,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:42,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:42,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:42,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:42,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:27:42,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 2314 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:27:42,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:42,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:27:42,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:43,467 INFO L124 PetriNetUnfolderBase]: 3773/6306 cut-off events. [2025-03-09 01:27:43,468 INFO L125 PetriNetUnfolderBase]: For 94681/94681 co-relation queries the response was YES. [2025-03-09 01:27:43,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31155 conditions, 6306 events. 3773/6306 cut-off events. For 94681/94681 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 42076 event pairs, 1544 based on Foata normal form. 1/6178 useless extension candidates. Maximal degree in co-relation 31029. Up to 5247 conditions per place. [2025-03-09 01:27:43,515 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 247 selfloop transitions, 44 changer transitions 3/298 dead transitions. [2025-03-09 01:27:43,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 298 transitions, 3614 flow [2025-03-09 01:27:43,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 261 transitions. [2025-03-09 01:27:43,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39545454545454545 [2025-03-09 01:27:43,516 INFO L175 Difference]: Start difference. First operand has 227 places, 226 transitions, 2314 flow. Second operand 11 states and 261 transitions. [2025-03-09 01:27:43,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 298 transitions, 3614 flow [2025-03-09 01:27:43,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 298 transitions, 3462 flow, removed 56 selfloop flow, removed 6 redundant places. [2025-03-09 01:27:43,706 INFO L231 Difference]: Finished difference. Result has 235 places, 235 transitions, 2576 flow [2025-03-09 01:27:43,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2576, PETRI_PLACES=235, PETRI_TRANSITIONS=235} [2025-03-09 01:27:43,707 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 176 predicate places. [2025-03-09 01:27:43,707 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 235 transitions, 2576 flow [2025-03-09 01:27:43,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:27:43,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:43,707 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] [2025-03-09 01:27:43,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-09 01:27:43,707 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:43,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash -976715780, now seen corresponding path program 23 times [2025-03-09 01:27:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:43,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030457246] [2025-03-09 01:27:43,708 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:27:43,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:43,712 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:43,719 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:43,719 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:27:43,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:44,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:44,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030457246] [2025-03-09 01:27:44,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030457246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:44,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:44,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:44,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684345712] [2025-03-09 01:27:44,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:44,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:44,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:44,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:44,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:44,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:44,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 235 transitions, 2576 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:44,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:44,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:44,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:44,849 INFO L124 PetriNetUnfolderBase]: 3688/6244 cut-off events. [2025-03-09 01:27:44,849 INFO L125 PetriNetUnfolderBase]: For 111580/111580 co-relation queries the response was YES. [2025-03-09 01:27:44,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32084 conditions, 6244 events. 3688/6244 cut-off events. For 111580/111580 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 42504 event pairs, 1563 based on Foata normal form. 1/6114 useless extension candidates. Maximal degree in co-relation 31953. Up to 5343 conditions per place. [2025-03-09 01:27:44,900 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 256 selfloop transitions, 35 changer transitions 3/299 dead transitions. [2025-03-09 01:27:44,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 299 transitions, 3886 flow [2025-03-09 01:27:44,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 260 transitions. [2025-03-09 01:27:44,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-03-09 01:27:44,901 INFO L175 Difference]: Start difference. First operand has 235 places, 235 transitions, 2576 flow. Second operand 11 states and 260 transitions. [2025-03-09 01:27:44,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 299 transitions, 3886 flow [2025-03-09 01:27:45,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 299 transitions, 3640 flow, removed 104 selfloop flow, removed 5 redundant places. [2025-03-09 01:27:45,112 INFO L231 Difference]: Finished difference. Result has 244 places, 242 transitions, 2674 flow [2025-03-09 01:27:45,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2336, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2674, PETRI_PLACES=244, PETRI_TRANSITIONS=242} [2025-03-09 01:27:45,113 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 185 predicate places. [2025-03-09 01:27:45,113 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 242 transitions, 2674 flow [2025-03-09 01:27:45,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:45,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:45,113 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] [2025-03-09 01:27:45,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-09 01:27:45,113 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:45,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash -73876678, now seen corresponding path program 24 times [2025-03-09 01:27:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:45,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257032795] [2025-03-09 01:27:45,114 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:27:45,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:45,118 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:45,128 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:45,128 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:27:45,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:45,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:45,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257032795] [2025-03-09 01:27:45,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257032795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:45,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:45,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:45,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213035076] [2025-03-09 01:27:45,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:45,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:45,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:45,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:45,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:45,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:45,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 242 transitions, 2674 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:45,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:45,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:45,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:46,424 INFO L124 PetriNetUnfolderBase]: 3814/6477 cut-off events. [2025-03-09 01:27:46,424 INFO L125 PetriNetUnfolderBase]: For 125485/125485 co-relation queries the response was YES. [2025-03-09 01:27:46,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33375 conditions, 6477 events. 3814/6477 cut-off events. For 125485/125485 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 44507 event pairs, 1624 based on Foata normal form. 1/6338 useless extension candidates. Maximal degree in co-relation 33238. Up to 5524 conditions per place. [2025-03-09 01:27:46,477 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 266 selfloop transitions, 37 changer transitions 3/311 dead transitions. [2025-03-09 01:27:46,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 311 transitions, 4000 flow [2025-03-09 01:27:46,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:46,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 263 transitions. [2025-03-09 01:27:46,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3984848484848485 [2025-03-09 01:27:46,478 INFO L175 Difference]: Start difference. First operand has 244 places, 242 transitions, 2674 flow. Second operand 11 states and 263 transitions. [2025-03-09 01:27:46,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 311 transitions, 4000 flow [2025-03-09 01:27:46,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 311 transitions, 3766 flow, removed 100 selfloop flow, removed 5 redundant places. [2025-03-09 01:27:46,824 INFO L231 Difference]: Finished difference. Result has 253 places, 250 transitions, 2781 flow [2025-03-09 01:27:46,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2440, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2781, PETRI_PLACES=253, PETRI_TRANSITIONS=250} [2025-03-09 01:27:46,824 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 194 predicate places. [2025-03-09 01:27:46,824 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 250 transitions, 2781 flow [2025-03-09 01:27:46,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:46,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:46,825 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] [2025-03-09 01:27:46,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-09 01:27:46,825 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:46,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:46,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1440115714, now seen corresponding path program 25 times [2025-03-09 01:27:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:46,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046790176] [2025-03-09 01:27:46,825 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:27:46,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:46,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:27:46,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:46,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:46,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:47,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:47,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046790176] [2025-03-09 01:27:47,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046790176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:47,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:47,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:47,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608176754] [2025-03-09 01:27:47,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:47,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:47,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:47,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:47,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:47,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:47,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 250 transitions, 2781 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:47,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:47,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:47,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:48,203 INFO L124 PetriNetUnfolderBase]: 3814/6469 cut-off events. [2025-03-09 01:27:48,203 INFO L125 PetriNetUnfolderBase]: For 124296/124296 co-relation queries the response was YES. [2025-03-09 01:27:48,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33174 conditions, 6469 events. 3814/6469 cut-off events. For 124296/124296 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 44438 event pairs, 1658 based on Foata normal form. 1/6334 useless extension candidates. Maximal degree in co-relation 33032. Up to 5632 conditions per place. [2025-03-09 01:27:48,256 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 260 selfloop transitions, 34 changer transitions 3/302 dead transitions. [2025-03-09 01:27:48,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 302 transitions, 3834 flow [2025-03-09 01:27:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 251 transitions. [2025-03-09 01:27:48,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3803030303030303 [2025-03-09 01:27:48,258 INFO L175 Difference]: Start difference. First operand has 253 places, 250 transitions, 2781 flow. Second operand 11 states and 251 transitions. [2025-03-09 01:27:48,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 302 transitions, 3834 flow [2025-03-09 01:27:48,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 302 transitions, 3644 flow, removed 83 selfloop flow, removed 5 redundant places. [2025-03-09 01:27:48,454 INFO L231 Difference]: Finished difference. Result has 260 places, 253 transitions, 2724 flow [2025-03-09 01:27:48,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2591, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2724, PETRI_PLACES=260, PETRI_TRANSITIONS=253} [2025-03-09 01:27:48,454 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 201 predicate places. [2025-03-09 01:27:48,454 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 253 transitions, 2724 flow [2025-03-09 01:27:48,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:48,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:48,455 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] [2025-03-09 01:27:48,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-09 01:27:48,455 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:48,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:48,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1637608432, now seen corresponding path program 26 times [2025-03-09 01:27:48,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:48,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455980845] [2025-03-09 01:27:48,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:48,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:48,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:27:48,475 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:48,475 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:48,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:48,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:48,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455980845] [2025-03-09 01:27:48,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455980845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:48,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:48,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:48,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381319980] [2025-03-09 01:27:48,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:48,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:48,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:48,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:48,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:48,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:48,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 253 transitions, 2724 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:48,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:48,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:48,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:49,793 INFO L124 PetriNetUnfolderBase]: 3931/6682 cut-off events. [2025-03-09 01:27:49,793 INFO L125 PetriNetUnfolderBase]: For 131480/131480 co-relation queries the response was YES. [2025-03-09 01:27:49,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34462 conditions, 6682 events. 3931/6682 cut-off events. For 131480/131480 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 46407 event pairs, 1716 based on Foata normal form. 1/6542 useless extension candidates. Maximal degree in co-relation 34317. Up to 5718 conditions per place. [2025-03-09 01:27:49,845 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 275 selfloop transitions, 38 changer transitions 3/321 dead transitions. [2025-03-09 01:27:49,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 321 transitions, 4097 flow [2025-03-09 01:27:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 263 transitions. [2025-03-09 01:27:49,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3984848484848485 [2025-03-09 01:27:49,846 INFO L175 Difference]: Start difference. First operand has 260 places, 253 transitions, 2724 flow. Second operand 11 states and 263 transitions. [2025-03-09 01:27:49,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 321 transitions, 4097 flow [2025-03-09 01:27:50,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 321 transitions, 3969 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-03-09 01:27:50,045 INFO L231 Difference]: Finished difference. Result has 266 places, 261 transitions, 2957 flow [2025-03-09 01:27:50,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2596, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2957, PETRI_PLACES=266, PETRI_TRANSITIONS=261} [2025-03-09 01:27:50,046 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 207 predicate places. [2025-03-09 01:27:50,046 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 261 transitions, 2957 flow [2025-03-09 01:27:50,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:50,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:50,046 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] [2025-03-09 01:27:50,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-09 01:27:50,046 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:50,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash 445619794, now seen corresponding path program 27 times [2025-03-09 01:27:50,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:50,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354019641] [2025-03-09 01:27:50,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:27:50,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:50,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:50,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-03-09 01:27:50,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:27:50,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:50,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:50,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354019641] [2025-03-09 01:27:50,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354019641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:50,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:50,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:50,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448948094] [2025-03-09 01:27:50,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:50,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:50,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:50,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:50,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:50,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:50,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 261 transitions, 2957 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:50,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:50,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:50,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:51,331 INFO L124 PetriNetUnfolderBase]: 3931/6685 cut-off events. [2025-03-09 01:27:51,331 INFO L125 PetriNetUnfolderBase]: For 141358/141358 co-relation queries the response was YES. [2025-03-09 01:27:51,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34994 conditions, 6685 events. 3931/6685 cut-off events. For 141358/141358 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 46499 event pairs, 1695 based on Foata normal form. 1/6545 useless extension candidates. Maximal degree in co-relation 34845. Up to 5667 conditions per place. [2025-03-09 01:27:51,384 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 274 selfloop transitions, 41 changer transitions 5/325 dead transitions. [2025-03-09 01:27:51,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 325 transitions, 4109 flow [2025-03-09 01:27:51,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:51,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 269 transitions. [2025-03-09 01:27:51,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4075757575757576 [2025-03-09 01:27:51,385 INFO L175 Difference]: Start difference. First operand has 266 places, 261 transitions, 2957 flow. Second operand 11 states and 269 transitions. [2025-03-09 01:27:51,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 325 transitions, 4109 flow [2025-03-09 01:27:51,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 325 transitions, 3904 flow, removed 90 selfloop flow, removed 5 redundant places. [2025-03-09 01:27:51,623 INFO L231 Difference]: Finished difference. Result has 273 places, 265 transitions, 2907 flow [2025-03-09 01:27:51,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2752, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2907, PETRI_PLACES=273, PETRI_TRANSITIONS=265} [2025-03-09 01:27:51,623 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 214 predicate places. [2025-03-09 01:27:51,623 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 265 transitions, 2907 flow [2025-03-09 01:27:51,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:51,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:51,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:27:51,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-09 01:27:51,624 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:51,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:51,624 INFO L85 PathProgramCache]: Analyzing trace with hash 681456368, now seen corresponding path program 28 times [2025-03-09 01:27:51,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:51,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617593585] [2025-03-09 01:27:51,624 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:27:51,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:51,629 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:27:51,638 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:51,638 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:27:51,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:51,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:51,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617593585] [2025-03-09 01:27:51,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617593585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:51,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:51,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:51,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206466009] [2025-03-09 01:27:51,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:51,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:51,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:51,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:51,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:51,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:27:51,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 265 transitions, 2907 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:27:51,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:51,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:27:51,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:52,974 INFO L124 PetriNetUnfolderBase]: 4129/6955 cut-off events. [2025-03-09 01:27:52,975 INFO L125 PetriNetUnfolderBase]: For 140415/140415 co-relation queries the response was YES. [2025-03-09 01:27:53,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35899 conditions, 6955 events. 4129/6955 cut-off events. For 140415/140415 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 48046 event pairs, 1762 based on Foata normal form. 1/6809 useless extension candidates. Maximal degree in co-relation 35747. Up to 5839 conditions per place. [2025-03-09 01:27:53,028 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 274 selfloop transitions, 46 changer transitions 5/329 dead transitions. [2025-03-09 01:27:53,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 329 transitions, 4017 flow [2025-03-09 01:27:53,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 260 transitions. [2025-03-09 01:27:53,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-03-09 01:27:53,029 INFO L175 Difference]: Start difference. First operand has 273 places, 265 transitions, 2907 flow. Second operand 11 states and 260 transitions. [2025-03-09 01:27:53,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 329 transitions, 4017 flow [2025-03-09 01:27:53,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 329 transitions, 3882 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-03-09 01:27:53,307 INFO L231 Difference]: Finished difference. Result has 278 places, 269 transitions, 2948 flow [2025-03-09 01:27:53,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2772, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2948, PETRI_PLACES=278, PETRI_TRANSITIONS=269} [2025-03-09 01:27:53,308 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 219 predicate places. [2025-03-09 01:27:53,308 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 269 transitions, 2948 flow [2025-03-09 01:27:53,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:27:53,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:53,308 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] [2025-03-09 01:27:53,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-09 01:27:53,308 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:53,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:53,309 INFO L85 PathProgramCache]: Analyzing trace with hash 794793400, now seen corresponding path program 29 times [2025-03-09 01:27:53,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:53,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020858472] [2025-03-09 01:27:53,309 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:27:53,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:53,314 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:53,320 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:53,320 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:27:53,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:53,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:53,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020858472] [2025-03-09 01:27:53,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020858472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:53,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:53,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:53,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967619553] [2025-03-09 01:27:53,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:53,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:53,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:53,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:53,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:53,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:53,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 269 transitions, 2948 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:53,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:53,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:53,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:54,677 INFO L124 PetriNetUnfolderBase]: 3967/6750 cut-off events. [2025-03-09 01:27:54,677 INFO L125 PetriNetUnfolderBase]: For 131448/131448 co-relation queries the response was YES. [2025-03-09 01:27:54,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34517 conditions, 6750 events. 3967/6750 cut-off events. For 131448/131448 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 47161 event pairs, 1783 based on Foata normal form. 1/6611 useless extension candidates. Maximal degree in co-relation 34362. Up to 5917 conditions per place. [2025-03-09 01:27:54,737 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 273 selfloop transitions, 37 changer transitions 3/318 dead transitions. [2025-03-09 01:27:54,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 318 transitions, 3984 flow [2025-03-09 01:27:54,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 250 transitions. [2025-03-09 01:27:54,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2025-03-09 01:27:54,739 INFO L175 Difference]: Start difference. First operand has 278 places, 269 transitions, 2948 flow. Second operand 11 states and 250 transitions. [2025-03-09 01:27:54,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 318 transitions, 3984 flow [2025-03-09 01:27:55,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 318 transitions, 3831 flow, removed 37 selfloop flow, removed 7 redundant places. [2025-03-09 01:27:55,056 INFO L231 Difference]: Finished difference. Result has 283 places, 272 transitions, 2943 flow [2025-03-09 01:27:55,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2795, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2943, PETRI_PLACES=283, PETRI_TRANSITIONS=272} [2025-03-09 01:27:55,056 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 224 predicate places. [2025-03-09 01:27:55,056 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 272 transitions, 2943 flow [2025-03-09 01:27:55,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:55,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:55,056 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] [2025-03-09 01:27:55,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-09 01:27:55,057 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:55,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:55,057 INFO L85 PathProgramCache]: Analyzing trace with hash -599131172, now seen corresponding path program 30 times [2025-03-09 01:27:55,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:55,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738572020] [2025-03-09 01:27:55,057 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:27:55,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:55,063 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:27:55,077 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:55,077 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:27:55,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:55,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:55,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:55,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738572020] [2025-03-09 01:27:55,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738572020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:55,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:55,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:55,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475945951] [2025-03-09 01:27:55,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:55,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:55,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:55,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:55,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:55,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:55,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 272 transitions, 2943 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:55,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:55,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:55,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:56,570 INFO L124 PetriNetUnfolderBase]: 3967/6758 cut-off events. [2025-03-09 01:27:56,571 INFO L125 PetriNetUnfolderBase]: For 129225/129225 co-relation queries the response was YES. [2025-03-09 01:27:56,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34256 conditions, 6758 events. 3967/6758 cut-off events. For 129225/129225 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 47294 event pairs, 1790 based on Foata normal form. 1/6614 useless extension candidates. Maximal degree in co-relation 34098. Up to 5930 conditions per place. [2025-03-09 01:27:56,643 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 275 selfloop transitions, 35 changer transitions 3/318 dead transitions. [2025-03-09 01:27:56,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 318 transitions, 3929 flow [2025-03-09 01:27:56,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 247 transitions. [2025-03-09 01:27:56,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37424242424242427 [2025-03-09 01:27:56,644 INFO L175 Difference]: Start difference. First operand has 283 places, 272 transitions, 2943 flow. Second operand 11 states and 247 transitions. [2025-03-09 01:27:56,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 318 transitions, 3929 flow [2025-03-09 01:27:56,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 318 transitions, 3801 flow, removed 28 selfloop flow, removed 8 redundant places. [2025-03-09 01:27:56,966 INFO L231 Difference]: Finished difference. Result has 287 places, 274 transitions, 2911 flow [2025-03-09 01:27:56,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2817, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2911, PETRI_PLACES=287, PETRI_TRANSITIONS=274} [2025-03-09 01:27:56,967 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 228 predicate places. [2025-03-09 01:27:56,967 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 274 transitions, 2911 flow [2025-03-09 01:27:56,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:56,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:56,967 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] [2025-03-09 01:27:56,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-09 01:27:56,967 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:56,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:56,967 INFO L85 PathProgramCache]: Analyzing trace with hash 378259140, now seen corresponding path program 31 times [2025-03-09 01:27:56,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:56,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690776730] [2025-03-09 01:27:56,968 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:27:56,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:56,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:27:56,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:56,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:27:56,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:57,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:57,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690776730] [2025-03-09 01:27:57,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690776730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:57,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:57,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:57,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684302507] [2025-03-09 01:27:57,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:57,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:57,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:57,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:57,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:57,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:57,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 274 transitions, 2911 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:57,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:57,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:57,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:27:58,301 INFO L124 PetriNetUnfolderBase]: 4098/6980 cut-off events. [2025-03-09 01:27:58,302 INFO L125 PetriNetUnfolderBase]: For 146092/146092 co-relation queries the response was YES. [2025-03-09 01:27:58,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36222 conditions, 6980 events. 4098/6980 cut-off events. For 146092/146092 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 49227 event pairs, 1828 based on Foata normal form. 1/6828 useless extension candidates. Maximal degree in co-relation 36062. Up to 6043 conditions per place. [2025-03-09 01:27:58,375 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 291 selfloop transitions, 35 changer transitions 3/334 dead transitions. [2025-03-09 01:27:58,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 334 transitions, 4432 flow [2025-03-09 01:27:58,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:27:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:27:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 257 transitions. [2025-03-09 01:27:58,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3893939393939394 [2025-03-09 01:27:58,376 INFO L175 Difference]: Start difference. First operand has 287 places, 274 transitions, 2911 flow. Second operand 11 states and 257 transitions. [2025-03-09 01:27:58,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 334 transitions, 4432 flow [2025-03-09 01:27:58,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 334 transitions, 4364 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-09 01:27:58,737 INFO L231 Difference]: Finished difference. Result has 293 places, 283 transitions, 3338 flow [2025-03-09 01:27:58,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2843, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3338, PETRI_PLACES=293, PETRI_TRANSITIONS=283} [2025-03-09 01:27:58,738 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 234 predicate places. [2025-03-09 01:27:58,738 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 283 transitions, 3338 flow [2025-03-09 01:27:58,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:58,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:27:58,738 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] [2025-03-09 01:27:58,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-09 01:27:58,738 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:27:58,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:27:58,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1976757670, now seen corresponding path program 32 times [2025-03-09 01:27:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:27:58,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087705304] [2025-03-09 01:27:58,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:27:58,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:27:58,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:27:58,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:27:58,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:27:58,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:27:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:27:59,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:27:59,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087705304] [2025-03-09 01:27:59,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087705304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:27:59,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:27:59,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:27:59,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800032370] [2025-03-09 01:27:59,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:27:59,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:27:59,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:27:59,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:27:59,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:27:59,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:27:59,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 283 transitions, 3338 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:27:59,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:27:59,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:27:59,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:00,240 INFO L124 PetriNetUnfolderBase]: 4281/7285 cut-off events. [2025-03-09 01:28:00,240 INFO L125 PetriNetUnfolderBase]: For 199215/199215 co-relation queries the response was YES. [2025-03-09 01:28:00,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40369 conditions, 7285 events. 4281/7285 cut-off events. For 199215/199215 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 51875 event pairs, 1875 based on Foata normal form. 1/7121 useless extension candidates. Maximal degree in co-relation 40205. Up to 6232 conditions per place. [2025-03-09 01:28:00,294 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 309 selfloop transitions, 38 changer transitions 3/355 dead transitions. [2025-03-09 01:28:00,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 355 transitions, 4985 flow [2025-03-09 01:28:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:28:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:28:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 270 transitions. [2025-03-09 01:28:00,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-09 01:28:00,295 INFO L175 Difference]: Start difference. First operand has 293 places, 283 transitions, 3338 flow. Second operand 11 states and 270 transitions. [2025-03-09 01:28:00,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 355 transitions, 4985 flow [2025-03-09 01:28:00,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 355 transitions, 4635 flow, removed 159 selfloop flow, removed 5 redundant places. [2025-03-09 01:28:00,693 INFO L231 Difference]: Finished difference. Result has 303 places, 294 transitions, 3516 flow [2025-03-09 01:28:00,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2988, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3516, PETRI_PLACES=303, PETRI_TRANSITIONS=294} [2025-03-09 01:28:00,693 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 244 predicate places. [2025-03-09 01:28:00,693 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 294 transitions, 3516 flow [2025-03-09 01:28:00,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:00,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:00,693 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] [2025-03-09 01:28:00,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-09 01:28:00,693 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:00,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2016081472, now seen corresponding path program 33 times [2025-03-09 01:28:00,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:00,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614462551] [2025-03-09 01:28:00,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:28:00,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:00,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:28:00,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-03-09 01:28:00,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:28:00,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:28:00,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:00,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614462551] [2025-03-09 01:28:00,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614462551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:00,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:00,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:28:00,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270651922] [2025-03-09 01:28:00,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:00,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:28:00,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:00,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:28:00,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:28:00,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:28:00,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 294 transitions, 3516 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:00,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:00,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:28:00,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:01,960 INFO L124 PetriNetUnfolderBase]: 4342/7393 cut-off events. [2025-03-09 01:28:01,961 INFO L125 PetriNetUnfolderBase]: For 205495/205495 co-relation queries the response was YES. [2025-03-09 01:28:02,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40759 conditions, 7393 events. 4342/7393 cut-off events. For 205495/205495 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 52836 event pairs, 1979 based on Foata normal form. 1/7231 useless extension candidates. Maximal degree in co-relation 40589. Up to 6502 conditions per place. [2025-03-09 01:28:02,038 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 299 selfloop transitions, 35 changer transitions 4/343 dead transitions. [2025-03-09 01:28:02,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 343 transitions, 4688 flow [2025-03-09 01:28:02,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:28:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:28:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 249 transitions. [2025-03-09 01:28:02,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37727272727272726 [2025-03-09 01:28:02,039 INFO L175 Difference]: Start difference. First operand has 303 places, 294 transitions, 3516 flow. Second operand 11 states and 249 transitions. [2025-03-09 01:28:02,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 343 transitions, 4688 flow [2025-03-09 01:28:02,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 343 transitions, 4374 flow, removed 142 selfloop flow, removed 4 redundant places. [2025-03-09 01:28:02,603 INFO L231 Difference]: Finished difference. Result has 312 places, 300 transitions, 3465 flow [2025-03-09 01:28:02,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3202, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3465, PETRI_PLACES=312, PETRI_TRANSITIONS=300} [2025-03-09 01:28:02,603 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 253 predicate places. [2025-03-09 01:28:02,603 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 300 transitions, 3465 flow [2025-03-09 01:28:02,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:02,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:02,604 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] [2025-03-09 01:28:02,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-09 01:28:02,604 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:02,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2021442174, now seen corresponding path program 34 times [2025-03-09 01:28:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:02,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833542388] [2025-03-09 01:28:02,604 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:28:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:02,609 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:28:02,617 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:28:02,618 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:28:02,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:02,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:28:02,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:02,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833542388] [2025-03-09 01:28:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833542388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:02,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:02,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:28:02,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291643141] [2025-03-09 01:28:02,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:02,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:28:02,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:02,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:28:02,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:28:02,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:28:02,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 300 transitions, 3465 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:28:02,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:02,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:28:02,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:04,150 INFO L124 PetriNetUnfolderBase]: 4712/7952 cut-off events. [2025-03-09 01:28:04,150 INFO L125 PetriNetUnfolderBase]: For 220880/220880 co-relation queries the response was YES. [2025-03-09 01:28:04,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43542 conditions, 7952 events. 4712/7952 cut-off events. For 220880/220880 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 56874 event pairs, 2111 based on Foata normal form. 1/7789 useless extension candidates. Maximal degree in co-relation 43367. Up to 6771 conditions per place. [2025-03-09 01:28:04,245 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 320 selfloop transitions, 43 changer transitions 3/370 dead transitions. [2025-03-09 01:28:04,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 370 transitions, 5103 flow [2025-03-09 01:28:04,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:28:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:28:04,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 261 transitions. [2025-03-09 01:28:04,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39545454545454545 [2025-03-09 01:28:04,246 INFO L175 Difference]: Start difference. First operand has 312 places, 300 transitions, 3465 flow. Second operand 11 states and 261 transitions. [2025-03-09 01:28:04,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 370 transitions, 5103 flow [2025-03-09 01:28:04,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 370 transitions, 4879 flow, removed 93 selfloop flow, removed 6 redundant places. [2025-03-09 01:28:04,733 INFO L231 Difference]: Finished difference. Result has 320 places, 309 transitions, 3781 flow [2025-03-09 01:28:04,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3241, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3781, PETRI_PLACES=320, PETRI_TRANSITIONS=309} [2025-03-09 01:28:04,733 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 261 predicate places. [2025-03-09 01:28:04,733 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 309 transitions, 3781 flow [2025-03-09 01:28:04,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:28:04,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:04,733 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] [2025-03-09 01:28:04,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-09 01:28:04,733 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:04,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:04,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1022791270, now seen corresponding path program 35 times [2025-03-09 01:28:04,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:04,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083695997] [2025-03-09 01:28:04,734 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:28:04,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:04,739 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:28:04,745 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:28:04,745 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:28:04,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:05,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:28:05,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:05,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083695997] [2025-03-09 01:28:05,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083695997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:05,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:05,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:28:05,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846065218] [2025-03-09 01:28:05,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:05,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:28:05,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:05,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:28:05,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:28:05,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:28:05,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 309 transitions, 3781 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:05,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:05,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:28:05,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:06,238 INFO L124 PetriNetUnfolderBase]: 4577/7786 cut-off events. [2025-03-09 01:28:06,238 INFO L125 PetriNetUnfolderBase]: For 242483/242483 co-relation queries the response was YES. [2025-03-09 01:28:06,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43837 conditions, 7786 events. 4577/7786 cut-off events. For 242483/242483 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 56401 event pairs, 2107 based on Foata normal form. 1/7627 useless extension candidates. Maximal degree in co-relation 43657. Up to 6793 conditions per place. [2025-03-09 01:28:06,329 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 326 selfloop transitions, 34 changer transitions 3/368 dead transitions. [2025-03-09 01:28:06,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 368 transitions, 5248 flow [2025-03-09 01:28:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:28:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:28:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 259 transitions. [2025-03-09 01:28:06,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3924242424242424 [2025-03-09 01:28:06,330 INFO L175 Difference]: Start difference. First operand has 320 places, 309 transitions, 3781 flow. Second operand 11 states and 259 transitions. [2025-03-09 01:28:06,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 368 transitions, 5248 flow [2025-03-09 01:28:07,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 368 transitions, 4906 flow, removed 153 selfloop flow, removed 5 redundant places. [2025-03-09 01:28:07,006 INFO L231 Difference]: Finished difference. Result has 328 places, 314 transitions, 3759 flow [2025-03-09 01:28:07,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3443, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3759, PETRI_PLACES=328, PETRI_TRANSITIONS=314} [2025-03-09 01:28:07,007 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 269 predicate places. [2025-03-09 01:28:07,007 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 314 transitions, 3759 flow [2025-03-09 01:28:07,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:07,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:07,007 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] [2025-03-09 01:28:07,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-09 01:28:07,007 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2069695372, now seen corresponding path program 36 times [2025-03-09 01:28:07,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:07,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566811208] [2025-03-09 01:28:07,008 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:28:07,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:07,012 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:28:07,020 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:28:07,020 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:28:07,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:28:07,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:07,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566811208] [2025-03-09 01:28:07,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566811208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:07,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:07,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:28:07,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137496155] [2025-03-09 01:28:07,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:07,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:28:07,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:07,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:28:07,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:28:07,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:28:07,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 314 transitions, 3759 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:07,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:07,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:28:07,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:08,660 INFO L124 PetriNetUnfolderBase]: 4598/7814 cut-off events. [2025-03-09 01:28:08,660 INFO L125 PetriNetUnfolderBase]: For 231253/231253 co-relation queries the response was YES. [2025-03-09 01:28:08,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42927 conditions, 7814 events. 4598/7814 cut-off events. For 231253/231253 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 56604 event pairs, 2130 based on Foata normal form. 1/7658 useless extension candidates. Maximal degree in co-relation 42742. Up to 6789 conditions per place. [2025-03-09 01:28:08,728 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 327 selfloop transitions, 37 changer transitions 4/373 dead transitions. [2025-03-09 01:28:08,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 373 transitions, 5083 flow [2025-03-09 01:28:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:28:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:28:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 262 transitions. [2025-03-09 01:28:08,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.396969696969697 [2025-03-09 01:28:08,729 INFO L175 Difference]: Start difference. First operand has 328 places, 314 transitions, 3759 flow. Second operand 11 states and 262 transitions. [2025-03-09 01:28:08,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 373 transitions, 5083 flow [2025-03-09 01:28:09,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 373 transitions, 4830 flow, removed 109 selfloop flow, removed 6 redundant places. [2025-03-09 01:28:09,269 INFO L231 Difference]: Finished difference. Result has 335 places, 319 transitions, 3746 flow [2025-03-09 01:28:09,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3506, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3746, PETRI_PLACES=335, PETRI_TRANSITIONS=319} [2025-03-09 01:28:09,269 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 276 predicate places. [2025-03-09 01:28:09,269 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 319 transitions, 3746 flow [2025-03-09 01:28:09,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:09,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:09,269 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] [2025-03-09 01:28:09,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-09 01:28:09,269 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:09,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:09,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1872202654, now seen corresponding path program 37 times [2025-03-09 01:28:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:09,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885539403] [2025-03-09 01:28:09,270 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:28:09,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:09,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:28:09,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:28:09,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:09,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:28:09,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:09,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885539403] [2025-03-09 01:28:09,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885539403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:09,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:09,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:28:09,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884197008] [2025-03-09 01:28:09,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:09,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:28:09,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:09,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:28:09,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:28:09,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:28:09,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 319 transitions, 3746 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:09,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:09,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:28:09,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:10,864 INFO L124 PetriNetUnfolderBase]: 4661/7928 cut-off events. [2025-03-09 01:28:10,864 INFO L125 PetriNetUnfolderBase]: For 236274/236274 co-relation queries the response was YES. [2025-03-09 01:28:10,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43597 conditions, 7928 events. 4661/7928 cut-off events. For 236274/236274 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 57566 event pairs, 2191 based on Foata normal form. 1/7770 useless extension candidates. Maximal degree in co-relation 43408. Up to 6919 conditions per place. [2025-03-09 01:28:10,963 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 334 selfloop transitions, 35 changer transitions 3/377 dead transitions. [2025-03-09 01:28:10,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 377 transitions, 5250 flow [2025-03-09 01:28:10,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:28:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:28:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 259 transitions. [2025-03-09 01:28:10,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3924242424242424 [2025-03-09 01:28:10,963 INFO L175 Difference]: Start difference. First operand has 335 places, 319 transitions, 3746 flow. Second operand 11 states and 259 transitions. [2025-03-09 01:28:10,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 377 transitions, 5250 flow [2025-03-09 01:28:11,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 377 transitions, 5121 flow, removed 33 selfloop flow, removed 7 redundant places. [2025-03-09 01:28:11,616 INFO L231 Difference]: Finished difference. Result has 341 places, 324 transitions, 3951 flow [2025-03-09 01:28:11,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3617, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3951, PETRI_PLACES=341, PETRI_TRANSITIONS=324} [2025-03-09 01:28:11,616 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 282 predicate places. [2025-03-09 01:28:11,617 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 324 transitions, 3951 flow [2025-03-09 01:28:11,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:11,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:11,617 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] [2025-03-09 01:28:11,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-09 01:28:11,617 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:11,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:11,617 INFO L85 PathProgramCache]: Analyzing trace with hash -258137360, now seen corresponding path program 38 times [2025-03-09 01:28:11,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:11,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91422219] [2025-03-09 01:28:11,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:11,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:11,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:28:11,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:28:11,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:11,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:28:11,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:11,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91422219] [2025-03-09 01:28:11,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91422219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:11,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:11,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:28:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317310847] [2025-03-09 01:28:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:11,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:28:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:11,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:28:11,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:28:11,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:28:11,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 324 transitions, 3951 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:11,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:11,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:28:11,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:13,383 INFO L124 PetriNetUnfolderBase]: 4661/7931 cut-off events. [2025-03-09 01:28:13,383 INFO L125 PetriNetUnfolderBase]: For 247678/247678 co-relation queries the response was YES. [2025-03-09 01:28:13,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43905 conditions, 7931 events. 4661/7931 cut-off events. For 247678/247678 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 57698 event pairs, 2160 based on Foata normal form. 1/7773 useless extension candidates. Maximal degree in co-relation 43712. Up to 6837 conditions per place. [2025-03-09 01:28:13,455 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 335 selfloop transitions, 40 changer transitions 5/385 dead transitions. [2025-03-09 01:28:13,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 385 transitions, 5255 flow [2025-03-09 01:28:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:28:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:28:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 268 transitions. [2025-03-09 01:28:13,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2025-03-09 01:28:13,456 INFO L175 Difference]: Start difference. First operand has 341 places, 324 transitions, 3951 flow. Second operand 11 states and 268 transitions. [2025-03-09 01:28:13,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 385 transitions, 5255 flow [2025-03-09 01:28:14,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 385 transitions, 4983 flow, removed 118 selfloop flow, removed 6 redundant places. [2025-03-09 01:28:14,178 INFO L231 Difference]: Finished difference. Result has 347 places, 328 transitions, 3852 flow [2025-03-09 01:28:14,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3679, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3852, PETRI_PLACES=347, PETRI_TRANSITIONS=328} [2025-03-09 01:28:14,179 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 288 predicate places. [2025-03-09 01:28:14,179 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 328 transitions, 3852 flow [2025-03-09 01:28:14,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:14,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:14,179 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] [2025-03-09 01:28:14,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-09 01:28:14,179 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:14,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash 9637190, now seen corresponding path program 39 times [2025-03-09 01:28:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370421810] [2025-03-09 01:28:14,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:28:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:14,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:28:14,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 33 statements. [2025-03-09 01:28:14,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:28:14,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:28:14,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:14,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370421810] [2025-03-09 01:28:14,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370421810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:14,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:14,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:28:14,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023263005] [2025-03-09 01:28:14,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:14,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:28:14,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:14,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:28:14,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:28:14,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:28:14,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 328 transitions, 3852 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:14,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:14,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:28:14,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:16,126 INFO L124 PetriNetUnfolderBase]: 4697/7998 cut-off events. [2025-03-09 01:28:16,126 INFO L125 PetriNetUnfolderBase]: For 230994/230994 co-relation queries the response was YES. [2025-03-09 01:28:16,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43274 conditions, 7998 events. 4697/7998 cut-off events. For 230994/230994 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 58283 event pairs, 2248 based on Foata normal form. 1/7841 useless extension candidates. Maximal degree in co-relation 43078. Up to 7088 conditions per place. [2025-03-09 01:28:16,195 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 330 selfloop transitions, 36 changer transitions 3/374 dead transitions. [2025-03-09 01:28:16,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 374 transitions, 5012 flow [2025-03-09 01:28:16,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:28:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:28:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 249 transitions. [2025-03-09 01:28:16,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37727272727272726 [2025-03-09 01:28:16,196 INFO L175 Difference]: Start difference. First operand has 347 places, 328 transitions, 3852 flow. Second operand 11 states and 249 transitions. [2025-03-09 01:28:16,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 374 transitions, 5012 flow [2025-03-09 01:28:16,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 374 transitions, 4847 flow, removed 48 selfloop flow, removed 7 redundant places. [2025-03-09 01:28:16,670 INFO L231 Difference]: Finished difference. Result has 352 places, 331 transitions, 3851 flow [2025-03-09 01:28:16,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3687, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3851, PETRI_PLACES=352, PETRI_TRANSITIONS=331} [2025-03-09 01:28:16,671 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 293 predicate places. [2025-03-09 01:28:16,671 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 331 transitions, 3851 flow [2025-03-09 01:28:16,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:16,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:16,671 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] [2025-03-09 01:28:16,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-09 01:28:16,671 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:16,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash -103699842, now seen corresponding path program 40 times [2025-03-09 01:28:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:16,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440361633] [2025-03-09 01:28:16,672 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:28:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:16,676 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-09 01:28:16,684 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:28:16,684 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:28:16,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:28:16,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:16,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440361633] [2025-03-09 01:28:16,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440361633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:16,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:16,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:28:16,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411849133] [2025-03-09 01:28:16,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:16,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:28:16,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:16,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:28:16,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:28:16,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-09 01:28:16,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 331 transitions, 3851 flow. Second operand has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:28:16,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:16,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-09 01:28:16,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:18,386 INFO L124 PetriNetUnfolderBase]: 4895/8291 cut-off events. [2025-03-09 01:28:18,387 INFO L125 PetriNetUnfolderBase]: For 241788/241788 co-relation queries the response was YES. [2025-03-09 01:28:18,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44650 conditions, 8291 events. 4895/8291 cut-off events. For 241788/241788 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 60110 event pairs, 2261 based on Foata normal form. 1/8122 useless extension candidates. Maximal degree in co-relation 44451. Up to 7078 conditions per place. [2025-03-09 01:28:18,464 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 339 selfloop transitions, 45 changer transitions 5/393 dead transitions. [2025-03-09 01:28:18,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 393 transitions, 5107 flow [2025-03-09 01:28:18,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:28:18,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:28:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 260 transitions. [2025-03-09 01:28:18,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-03-09 01:28:18,465 INFO L175 Difference]: Start difference. First operand has 352 places, 331 transitions, 3851 flow. Second operand 11 states and 260 transitions. [2025-03-09 01:28:18,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 393 transitions, 5107 flow [2025-03-09 01:28:19,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 393 transitions, 4943 flow, removed 48 selfloop flow, removed 8 redundant places. [2025-03-09 01:28:19,344 INFO L231 Difference]: Finished difference. Result has 356 places, 335 transitions, 3883 flow [2025-03-09 01:28:19,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3687, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3883, PETRI_PLACES=356, PETRI_TRANSITIONS=335} [2025-03-09 01:28:19,346 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 297 predicate places. [2025-03-09 01:28:19,346 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 335 transitions, 3883 flow [2025-03-09 01:28:19,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.818181818181818) internal successors, (163), 11 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:28:19,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:19,347 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] [2025-03-09 01:28:19,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-09 01:28:19,347 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:19,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:19,348 INFO L85 PathProgramCache]: Analyzing trace with hash -863889214, now seen corresponding path program 41 times [2025-03-09 01:28:19,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:19,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841745031] [2025-03-09 01:28:19,348 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:28:19,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:19,355 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:28:19,364 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:28:19,364 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:28:19,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:28:19,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:19,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841745031] [2025-03-09 01:28:19,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841745031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:19,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:19,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:28:19,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989675615] [2025-03-09 01:28:19,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:19,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:28:19,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:19,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:28:19,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:28:19,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 60 [2025-03-09 01:28:19,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 335 transitions, 3883 flow. Second operand has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:19,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:19,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 60 [2025-03-09 01:28:19,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:21,189 INFO L124 PetriNetUnfolderBase]: 4697/8004 cut-off events. [2025-03-09 01:28:21,189 INFO L125 PetriNetUnfolderBase]: For 226452/226452 co-relation queries the response was YES. [2025-03-09 01:28:21,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42920 conditions, 8004 events. 4697/8004 cut-off events. For 226452/226452 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 58502 event pairs, 2255 based on Foata normal form. 1/7842 useless extension candidates. Maximal degree in co-relation 42719. Up to 7100 conditions per place. [2025-03-09 01:28:21,262 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 336 selfloop transitions, 34 changer transitions 3/378 dead transitions. [2025-03-09 01:28:21,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 378 transitions, 4981 flow [2025-03-09 01:28:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:28:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:28:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 246 transitions. [2025-03-09 01:28:21,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2025-03-09 01:28:21,263 INFO L175 Difference]: Start difference. First operand has 356 places, 335 transitions, 3883 flow. Second operand 11 states and 246 transitions. [2025-03-09 01:28:21,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 378 transitions, 4981 flow [2025-03-09 01:28:21,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 378 transitions, 4796 flow, removed 54 selfloop flow, removed 7 redundant places. [2025-03-09 01:28:21,734 INFO L231 Difference]: Finished difference. Result has 361 places, 337 transitions, 3790 flow [2025-03-09 01:28:21,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3698, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3790, PETRI_PLACES=361, PETRI_TRANSITIONS=337} [2025-03-09 01:28:21,735 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 302 predicate places. [2025-03-09 01:28:21,735 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 337 transitions, 3790 flow [2025-03-09 01:28:21,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.818181818181818) internal successors, (174), 11 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:28:21,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:21,735 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] [2025-03-09 01:28:21,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-09 01:28:21,735 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:21,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash 368198100, now seen corresponding path program 1 times [2025-03-09 01:28:21,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:21,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591091130] [2025-03-09 01:28:21,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:21,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 01:28:21,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 01:28:21,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:21,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:21,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:21,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591091130] [2025-03-09 01:28:21,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591091130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:21,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762872751] [2025-03-09 01:28:21,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:21,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:21,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:21,796 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:21,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:28:21,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 01:28:21,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 01:28:21,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:21,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:21,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:28:21,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:21,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:21,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762872751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:21,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:21,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:28:21,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355263842] [2025-03-09 01:28:21,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:21,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:28:21,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:21,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:28:21,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:28:21,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:28:21,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 337 transitions, 3790 flow. Second operand has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 12 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:28:21,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:21,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:28:21,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:24,421 INFO L124 PetriNetUnfolderBase]: 7963/14225 cut-off events. [2025-03-09 01:28:24,422 INFO L125 PetriNetUnfolderBase]: For 529393/529709 co-relation queries the response was YES. [2025-03-09 01:28:24,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77920 conditions, 14225 events. 7963/14225 cut-off events. For 529393/529709 co-relation queries the response was YES. Maximal size of possible extension queue 1252. Compared 120137 event pairs, 4826 based on Foata normal form. 292/14098 useless extension candidates. Maximal degree in co-relation 77474. Up to 6459 conditions per place. [2025-03-09 01:28:24,577 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 557 selfloop transitions, 14 changer transitions 12/627 dead transitions. [2025-03-09 01:28:24,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 627 transitions, 8374 flow [2025-03-09 01:28:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:28:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:28:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2025-03-09 01:28:24,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2025-03-09 01:28:24,578 INFO L175 Difference]: Start difference. First operand has 361 places, 337 transitions, 3790 flow. Second operand 8 states and 188 transitions. [2025-03-09 01:28:24,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 627 transitions, 8374 flow [2025-03-09 01:28:25,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 627 transitions, 8242 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-03-09 01:28:25,532 INFO L231 Difference]: Finished difference. Result has 363 places, 342 transitions, 3796 flow [2025-03-09 01:28:25,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3724, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3796, PETRI_PLACES=363, PETRI_TRANSITIONS=342} [2025-03-09 01:28:25,533 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 304 predicate places. [2025-03-09 01:28:25,533 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 342 transitions, 3796 flow [2025-03-09 01:28:25,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 12 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:28:25,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:25,534 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:25,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:28:25,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-03-09 01:28:25,734 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:25,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:25,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1061586760, now seen corresponding path program 1 times [2025-03-09 01:28:25,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:25,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090887571] [2025-03-09 01:28:25,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:25,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:25,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 01:28:25,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 01:28:25,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:25,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:28:25,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:25,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090887571] [2025-03-09 01:28:25,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090887571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:25,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:25,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:28:25,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234903134] [2025-03-09 01:28:25,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:25,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:25,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:25,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:25,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:28:25,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 342 transitions, 3796 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:25,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:25,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:28:25,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:28,714 INFO L124 PetriNetUnfolderBase]: 8560/15532 cut-off events. [2025-03-09 01:28:28,714 INFO L125 PetriNetUnfolderBase]: For 760890/763040 co-relation queries the response was YES. [2025-03-09 01:28:28,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89316 conditions, 15532 events. 8560/15532 cut-off events. For 760890/763040 co-relation queries the response was YES. Maximal size of possible extension queue 1340. Compared 135364 event pairs, 3192 based on Foata normal form. 894/16005 useless extension candidates. Maximal degree in co-relation 88704. Up to 6932 conditions per place. [2025-03-09 01:28:28,874 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 453 selfloop transitions, 34 changer transitions 0/531 dead transitions. [2025-03-09 01:28:28,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 531 transitions, 7176 flow [2025-03-09 01:28:28,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-03-09 01:28:28,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-09 01:28:28,875 INFO L175 Difference]: Start difference. First operand has 363 places, 342 transitions, 3796 flow. Second operand 4 states and 128 transitions. [2025-03-09 01:28:28,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 531 transitions, 7176 flow [2025-03-09 01:28:30,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 531 transitions, 7158 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-09 01:28:30,169 INFO L231 Difference]: Finished difference. Result has 365 places, 353 transitions, 4162 flow [2025-03-09 01:28:30,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3726, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4162, PETRI_PLACES=365, PETRI_TRANSITIONS=353} [2025-03-09 01:28:30,170 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 306 predicate places. [2025-03-09 01:28:30,170 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 353 transitions, 4162 flow [2025-03-09 01:28:30,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:30,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:30,170 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:30,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-09 01:28:30,170 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:30,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:30,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1676497732, now seen corresponding path program 1 times [2025-03-09 01:28:30,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:30,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571426460] [2025-03-09 01:28:30,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:30,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:30,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 01:28:30,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:28:30,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:30,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:30,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:30,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571426460] [2025-03-09 01:28:30,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571426460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:30,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490248938] [2025-03-09 01:28:30,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:30,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:30,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:30,242 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:30,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:28:30,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 01:28:30,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:28:30,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:30,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:30,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:28:30,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:30,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:30,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490248938] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:30,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:30,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-09 01:28:30,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453282744] [2025-03-09 01:28:30,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:30,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:28:30,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:30,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:28:30,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:28:30,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-09 01:28:30,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 353 transitions, 4162 flow. Second operand has 13 states, 13 states have (on average 18.53846153846154) internal successors, (241), 13 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:30,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:30,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-09 01:28:30,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:32,339 INFO L124 PetriNetUnfolderBase]: 6082/11554 cut-off events. [2025-03-09 01:28:32,339 INFO L125 PetriNetUnfolderBase]: For 497550/498759 co-relation queries the response was YES. [2025-03-09 01:28:32,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67347 conditions, 11554 events. 6082/11554 cut-off events. For 497550/498759 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 100606 event pairs, 2870 based on Foata normal form. 442/11591 useless extension candidates. Maximal degree in co-relation 66912. Up to 7664 conditions per place. [2025-03-09 01:28:32,457 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 300 selfloop transitions, 11 changer transitions 131/486 dead transitions. [2025-03-09 01:28:32,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 486 transitions, 6629 flow [2025-03-09 01:28:32,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:28:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:28:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2025-03-09 01:28:32,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37833333333333335 [2025-03-09 01:28:32,458 INFO L175 Difference]: Start difference. First operand has 365 places, 353 transitions, 4162 flow. Second operand 10 states and 227 transitions. [2025-03-09 01:28:32,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 486 transitions, 6629 flow [2025-03-09 01:28:33,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 486 transitions, 6481 flow, removed 50 selfloop flow, removed 6 redundant places. [2025-03-09 01:28:33,313 INFO L231 Difference]: Finished difference. Result has 370 places, 347 transitions, 4036 flow [2025-03-09 01:28:33,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=4052, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4036, PETRI_PLACES=370, PETRI_TRANSITIONS=347} [2025-03-09 01:28:33,313 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 311 predicate places. [2025-03-09 01:28:33,313 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 347 transitions, 4036 flow [2025-03-09 01:28:33,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.53846153846154) internal successors, (241), 13 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:33,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:33,314 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:33,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:28:33,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:33,514 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-09 01:28:33,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1469552060, now seen corresponding path program 2 times [2025-03-09 01:28:33,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:33,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367086078] [2025-03-09 01:28:33,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:33,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:33,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-09 01:28:33,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:28:33,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:33,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:28:33,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:33,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367086078] [2025-03-09 01:28:33,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367086078] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:33,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699964096] [2025-03-09 01:28:33,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:33,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:33,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:33,761 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:33,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:28:33,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-09 01:28:33,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:28:33,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:33,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:33,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:28:33,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:28:33,994 INFO L312 TraceCheckSpWp]: Computing backward predicates...