./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.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 14a9c1cac7f040ebf84fc8e1c821294cab75b8332a1643f6e05ef67dfff453ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:10:54,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:10:54,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:10:54,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:10:54,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:10:54,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:10:54,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:10:54,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:10:54,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:10:54,875 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:10:54,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:10:54,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:10:54,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:10:54,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:10:54,877 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:10:54,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:10:54,877 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:10:54,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:10:54,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:10:54,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:10:54,877 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:10:54,877 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:10:54,877 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:10:54,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:10:54,878 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:10:54,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:10:54,878 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:10:54,878 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:10:54,878 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:10:54,878 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:10:54,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:10:54,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:10:54,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:10:54,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:10:54,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:10:54,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:10:54,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:10:54,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:10:54,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:10:54,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:10:54,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:10:54,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:10:54,880 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 -> 14a9c1cac7f040ebf84fc8e1c821294cab75b8332a1643f6e05ef67dfff453ec [2025-03-04 10:10:55,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:10:55,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:10:55,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:10:55,134 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:10:55,135 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:10:55,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c [2025-03-04 10:10:56,297 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea635fac/977658cf630c44ec9a967e25d87db4a9/FLAG3ef5401f6 [2025-03-04 10:10:56,533 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:10:56,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c [2025-03-04 10:10:56,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea635fac/977658cf630c44ec9a967e25d87db4a9/FLAG3ef5401f6 [2025-03-04 10:10:56,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea635fac/977658cf630c44ec9a967e25d87db4a9 [2025-03-04 10:10:56,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:10:56,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:10:56,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:10:56,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:10:56,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:10:56,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:10:56" (1/1) ... [2025-03-04 10:10:56,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:56, skipping insertion in model container [2025-03-04 10:10:56,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:10:56" (1/1) ... [2025-03-04 10:10:56,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:10:57,025 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:10:57,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:10:57,041 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:10:57,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:10:57,076 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:10:57,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:57 WrapperNode [2025-03-04 10:10:57,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:10:57,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:10:57,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:10:57,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:10:57,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:57" (1/1) ... [2025-03-04 10:10:57,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:57" (1/1) ... [2025-03-04 10:10:57,109 INFO L138 Inliner]: procedures = 25, calls = 27, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 125 [2025-03-04 10:10:57,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:10:57,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:10:57,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:10:57,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:10:57,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:57" (1/1) ... [2025-03-04 10:10:57,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:57" (1/1) ... [2025-03-04 10:10:57,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:57" (1/1) ... [2025-03-04 10:10:57,139 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 10:10:57,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:57" (1/1) ... [2025-03-04 10:10:57,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:57" (1/1) ... [2025-03-04 10:10:57,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:57" (1/1) ... [2025-03-04 10:10:57,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:57" (1/1) ... [2025-03-04 10:10:57,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:57" (1/1) ... [2025-03-04 10:10:57,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:57" (1/1) ... [2025-03-04 10:10:57,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:10:57,158 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:10:57,158 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:10:57,159 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:10:57,159 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:57" (1/1) ... [2025-03-04 10:10:57,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:10:57,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:57,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:10:57,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:10:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:10:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:10:57,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:10:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:10:57,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:10:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:10:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:10:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:10:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:10:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:10:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:10:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:10:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:10:57,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:10:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:10:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:10:57,208 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:10:57,283 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:10:57,285 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:10:57,490 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:10:57,491 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:10:57,665 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:10:57,665 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:10:57,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:57 BoogieIcfgContainer [2025-03-04 10:10:57,666 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:10:57,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:10:57,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:10:57,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:10:57,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:10:56" (1/3) ... [2025-03-04 10:10:57,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115be42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:10:57, skipping insertion in model container [2025-03-04 10:10:57,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:10:57" (2/3) ... [2025-03-04 10:10:57,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115be42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:10:57, skipping insertion in model container [2025-03-04 10:10:57,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:10:57" (3/3) ... [2025-03-04 10:10:57,677 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue2.wvr.c [2025-03-04 10:10:57,689 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:10:57,690 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue2.wvr.c that has 3 procedures, 31 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-04 10:10:57,691 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:10:57,743 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:10:57,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 80 flow [2025-03-04 10:10:57,792 INFO L124 PetriNetUnfolderBase]: 3/31 cut-off events. [2025-03-04 10:10:57,795 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:10:57,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 31 events. 3/31 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-03-04 10:10:57,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 33 transitions, 80 flow [2025-03-04 10:10:57,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 30 transitions, 72 flow [2025-03-04 10:10:57,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:10:57,831 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;@31f74ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:10:57,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 10:10:57,834 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:10:57,834 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:10:57,835 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:10:57,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:57,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:10:57,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:57,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash 386387, now seen corresponding path program 1 times [2025-03-04 10:10:57,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:57,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164021564] [2025-03-04 10:10:57,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:57,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:57,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:10:57,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:10:57,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:57,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:58,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:58,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164021564] [2025-03-04 10:10:58,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164021564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:58,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:58,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:10:58,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752214614] [2025-03-04 10:10:58,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:58,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:10:58,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:58,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:10:58,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:10:58,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 10:10:58,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:58,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:58,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 10:10:58,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:58,135 INFO L124 PetriNetUnfolderBase]: 128/233 cut-off events. [2025-03-04 10:10:58,135 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 10:10:58,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 233 events. 128/233 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 969 event pairs, 100 based on Foata normal form. 1/172 useless extension candidates. Maximal degree in co-relation 428. Up to 221 conditions per place. [2025-03-04 10:10:58,139 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 21 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-03-04 10:10:58,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 112 flow [2025-03-04 10:10:58,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:10:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:10:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-03-04 10:10:58,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2025-03-04 10:10:58,151 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 72 flow. Second operand 3 states and 46 transitions. [2025-03-04 10:10:58,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 112 flow [2025-03-04 10:10:58,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:10:58,156 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 62 flow [2025-03-04 10:10:58,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2025-03-04 10:10:58,160 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2025-03-04 10:10:58,160 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 62 flow [2025-03-04 10:10:58,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:58,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:58,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:10:58,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:10:58,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:58,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash 386388, now seen corresponding path program 1 times [2025-03-04 10:10:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:58,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982601146] [2025-03-04 10:10:58,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:58,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:58,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:10:58,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:10:58,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:58,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:58,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:58,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982601146] [2025-03-04 10:10:58,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982601146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:58,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:58,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:58,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873650945] [2025-03-04 10:10:58,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:58,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:10:58,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:58,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:10:58,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:10:58,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 10:10:58,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:58,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:58,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 10:10:58,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:58,535 INFO L124 PetriNetUnfolderBase]: 129/236 cut-off events. [2025-03-04 10:10:58,536 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:10:58,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 236 events. 129/236 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 970 event pairs, 100 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 454. Up to 226 conditions per place. [2025-03-04 10:10:58,539 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 23 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-03-04 10:10:58,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 124 flow [2025-03-04 10:10:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:10:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:10:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-03-04 10:10:58,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-04 10:10:58,541 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 62 flow. Second operand 4 states and 56 transitions. [2025-03-04 10:10:58,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 124 flow [2025-03-04 10:10:58,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:58,542 INFO L231 Difference]: Finished difference. Result has 32 places, 30 transitions, 85 flow [2025-03-04 10:10:58,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2025-03-04 10:10:58,543 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2025-03-04 10:10:58,543 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 85 flow [2025-03-04 10:10:58,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:58,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:58,543 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:10:58,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:10:58,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:58,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:58,544 INFO L85 PathProgramCache]: Analyzing trace with hash 371331427, now seen corresponding path program 1 times [2025-03-04 10:10:58,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:58,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572742464] [2025-03-04 10:10:58,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:58,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:58,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:10:58,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:10:58,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:58,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:58,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:58,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572742464] [2025-03-04 10:10:58,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572742464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:10:58,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269716099] [2025-03-04 10:10:58,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:58,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:58,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:10:58,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:10:58,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:10:58,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:10:58,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:10:58,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:58,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:58,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:10:58,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:10:58,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:10:59,047 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-04 10:10:59,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:10:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:59,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269716099] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:10:59,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:10:59,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:10:59,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982625145] [2025-03-04 10:10:59,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:10:59,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:10:59,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:59,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:10:59,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:10:59,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 10:10:59,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 85 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:59,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:59,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 10:10:59,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:59,395 INFO L124 PetriNetUnfolderBase]: 129/235 cut-off events. [2025-03-04 10:10:59,395 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:10:59,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 235 events. 129/235 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 972 event pairs, 100 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 461. Up to 222 conditions per place. [2025-03-04 10:10:59,397 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 19 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2025-03-04 10:10:59,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 133 flow [2025-03-04 10:10:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:10:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:10:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-03-04 10:10:59,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2025-03-04 10:10:59,399 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 85 flow. Second operand 6 states and 69 transitions. [2025-03-04 10:10:59,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 133 flow [2025-03-04 10:10:59,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:10:59,400 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 92 flow [2025-03-04 10:10:59,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2025-03-04 10:10:59,400 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2025-03-04 10:10:59,400 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 92 flow [2025-03-04 10:10:59,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:59,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:59,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:10:59,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:10:59,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:10:59,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:59,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:59,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1371413225, now seen corresponding path program 1 times [2025-03-04 10:10:59,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:59,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904059021] [2025-03-04 10:10:59,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:59,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:59,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:10:59,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:10:59,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:59,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:59,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:59,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904059021] [2025-03-04 10:10:59,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904059021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:59,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:59,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:10:59,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295962738] [2025-03-04 10:10:59,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:59,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:10:59,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:59,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:10:59,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:10:59,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 10:10:59,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:59,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:59,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 10:10:59,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:59,734 INFO L124 PetriNetUnfolderBase]: 93/173 cut-off events. [2025-03-04 10:10:59,734 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:10:59,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 173 events. 93/173 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 606 event pairs, 68 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 338. Up to 160 conditions per place. [2025-03-04 10:10:59,736 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 21 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2025-03-04 10:10:59,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 136 flow [2025-03-04 10:10:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:10:59,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:10:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-03-04 10:10:59,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2025-03-04 10:10:59,738 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 92 flow. Second operand 4 states and 51 transitions. [2025-03-04 10:10:59,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 136 flow [2025-03-04 10:10:59,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 106 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-04 10:10:59,739 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 64 flow [2025-03-04 10:10:59,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2025-03-04 10:10:59,740 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2025-03-04 10:10:59,740 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 64 flow [2025-03-04 10:10:59,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:59,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:59,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:10:59,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:10:59,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:59,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:59,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1371413224, now seen corresponding path program 1 times [2025-03-04 10:10:59,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:59,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109005291] [2025-03-04 10:10:59,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:59,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:59,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:10:59,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:10:59,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:59,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:10:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:10:59,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:10:59,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109005291] [2025-03-04 10:10:59,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109005291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:10:59,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:10:59,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:10:59,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029213427] [2025-03-04 10:10:59,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:10:59,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:10:59,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:10:59,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:10:59,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:10:59,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 10:10:59,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:59,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:10:59,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 10:10:59,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:59,914 INFO L124 PetriNetUnfolderBase]: 154/290 cut-off events. [2025-03-04 10:10:59,915 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:10:59,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 290 events. 154/290 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1171 event pairs, 106 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 386. Up to 192 conditions per place. [2025-03-04 10:10:59,916 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 42 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2025-03-04 10:10:59,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 49 transitions, 207 flow [2025-03-04 10:10:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:10:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:10:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-03-04 10:10:59,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2025-03-04 10:10:59,917 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 64 flow. Second operand 5 states and 83 transitions. [2025-03-04 10:10:59,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 49 transitions, 207 flow [2025-03-04 10:10:59,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 49 transitions, 203 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:10:59,918 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 85 flow [2025-03-04 10:10:59,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2025-03-04 10:10:59,919 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2025-03-04 10:10:59,919 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 85 flow [2025-03-04 10:10:59,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:10:59,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:10:59,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:10:59,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:10:59,919 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:10:59,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:10:59,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1498608983, now seen corresponding path program 1 times [2025-03-04 10:10:59,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:10:59,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208287284] [2025-03-04 10:10:59,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:10:59,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:10:59,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:10:59,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:10:59,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:10:59,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:00,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:00,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208287284] [2025-03-04 10:11:00,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208287284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:00,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478821562] [2025-03-04 10:11:00,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:00,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:00,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:00,083 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:00,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:11:00,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:11:00,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:11:00,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:00,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:00,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:11:00,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:00,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:11:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:00,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:00,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478821562] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:00,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:00,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 10 [2025-03-04 10:11:00,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411322986] [2025-03-04 10:11:00,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:00,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:11:00,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:00,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:11:00,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:11:00,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-04 10:11:00,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 85 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:00,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:00,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-04 10:11:00,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:00,430 INFO L124 PetriNetUnfolderBase]: 166/317 cut-off events. [2025-03-04 10:11:00,431 INFO L125 PetriNetUnfolderBase]: For 87/96 co-relation queries the response was YES. [2025-03-04 10:11:00,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 317 events. 166/317 cut-off events. For 87/96 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1294 event pairs, 91 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 481. Up to 130 conditions per place. [2025-03-04 10:11:00,434 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 40 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2025-03-04 10:11:00,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 232 flow [2025-03-04 10:11:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:11:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:11:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-03-04 10:11:00,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2025-03-04 10:11:00,435 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 85 flow. Second operand 6 states and 97 transitions. [2025-03-04 10:11:00,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 51 transitions, 232 flow [2025-03-04 10:11:00,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 51 transitions, 227 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:00,437 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 117 flow [2025-03-04 10:11:00,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2025-03-04 10:11:00,437 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2025-03-04 10:11:00,438 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 117 flow [2025-03-04 10:11:00,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:00,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:00,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:00,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:11:00,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:11:00,642 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:00,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:00,643 INFO L85 PathProgramCache]: Analyzing trace with hash 624513165, now seen corresponding path program 1 times [2025-03-04 10:11:00,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:00,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348234806] [2025-03-04 10:11:00,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:00,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:00,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:11:00,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:11:00,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:00,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:00,688 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-04 10:11:00,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:00,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348234806] [2025-03-04 10:11:00,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348234806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:00,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:11:00,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579721422] [2025-03-04 10:11:00,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:00,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:00,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:00,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:00,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:11:00,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 10:11:00,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:00,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:00,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 10:11:00,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:00,778 INFO L124 PetriNetUnfolderBase]: 164/305 cut-off events. [2025-03-04 10:11:00,779 INFO L125 PetriNetUnfolderBase]: For 338/353 co-relation queries the response was YES. [2025-03-04 10:11:00,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 305 events. 164/305 cut-off events. For 338/353 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1075 event pairs, 114 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 694. Up to 238 conditions per place. [2025-03-04 10:11:00,781 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 37 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2025-03-04 10:11:00,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 240 flow [2025-03-04 10:11:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-03-04 10:11:00,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46060606060606063 [2025-03-04 10:11:00,782 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 117 flow. Second operand 5 states and 76 transitions. [2025-03-04 10:11:00,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 240 flow [2025-03-04 10:11:00,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 226 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:00,784 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 130 flow [2025-03-04 10:11:00,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2025-03-04 10:11:00,785 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2025-03-04 10:11:00,785 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 130 flow [2025-03-04 10:11:00,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:00,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:00,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:00,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:11:00,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:00,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:00,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1351526946, now seen corresponding path program 1 times [2025-03-04 10:11:00,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:00,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701317210] [2025-03-04 10:11:00,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:00,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:00,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:11:00,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:11:00,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:00,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:00,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:00,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701317210] [2025-03-04 10:11:00,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701317210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:00,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472776049] [2025-03-04 10:11:00,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:00,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:00,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:00,927 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:00,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:11:00,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:11:00,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:11:00,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:00,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:00,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:11:00,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:01,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:01,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:11:01,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:01,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472776049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:01,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:01,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 10:11:01,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798107150] [2025-03-04 10:11:01,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:01,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:11:01,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:01,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:11:01,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:11:01,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-04 10:11:01,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 130 flow. Second operand has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:01,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:01,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-04 10:11:01,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:01,369 INFO L124 PetriNetUnfolderBase]: 198/372 cut-off events. [2025-03-04 10:11:01,369 INFO L125 PetriNetUnfolderBase]: For 377/400 co-relation queries the response was YES. [2025-03-04 10:11:01,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 372 events. 198/372 cut-off events. For 377/400 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1385 event pairs, 88 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 887. Up to 179 conditions per place. [2025-03-04 10:11:01,374 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 49 selfloop transitions, 9 changer transitions 0/61 dead transitions. [2025-03-04 10:11:01,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 362 flow [2025-03-04 10:11:01,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2025-03-04 10:11:01,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47186147186147187 [2025-03-04 10:11:01,376 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 130 flow. Second operand 7 states and 109 transitions. [2025-03-04 10:11:01,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 362 flow [2025-03-04 10:11:01,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:01,381 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 166 flow [2025-03-04 10:11:01,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-03-04 10:11:01,382 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2025-03-04 10:11:01,382 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 166 flow [2025-03-04 10:11:01,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:01,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:01,382 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:01,390 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-04 10:11:01,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:01,583 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:01,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:01,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1125234355, now seen corresponding path program 1 times [2025-03-04 10:11:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:01,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364457345] [2025-03-04 10:11:01,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:01,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:01,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:11:01,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:11:01,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:01,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:01,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:01,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364457345] [2025-03-04 10:11:01,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364457345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:01,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283113801] [2025-03-04 10:11:01,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:01,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:01,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:01,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:01,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:11:01,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:11:01,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:11:01,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:01,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:01,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:01,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:01,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:01,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283113801] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:01,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:01,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:11:01,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817797260] [2025-03-04 10:11:01,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:01,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:11:01,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:01,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:11:01,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:11:01,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 10:11:01,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 166 flow. Second operand has 14 states, 14 states have (on average 9.0) internal successors, (126), 14 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:01,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:01,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 10:11:01,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:02,072 INFO L124 PetriNetUnfolderBase]: 407/726 cut-off events. [2025-03-04 10:11:02,072 INFO L125 PetriNetUnfolderBase]: For 903/923 co-relation queries the response was YES. [2025-03-04 10:11:02,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2409 conditions, 726 events. 407/726 cut-off events. For 903/923 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3081 event pairs, 205 based on Foata normal form. 16/742 useless extension candidates. Maximal degree in co-relation 1283. Up to 366 conditions per place. [2025-03-04 10:11:02,076 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 69 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2025-03-04 10:11:02,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 558 flow [2025-03-04 10:11:02,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:11:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:11:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2025-03-04 10:11:02,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45075757575757575 [2025-03-04 10:11:02,077 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 166 flow. Second operand 8 states and 119 transitions. [2025-03-04 10:11:02,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 558 flow [2025-03-04 10:11:02,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 84 transitions, 537 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:02,080 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 252 flow [2025-03-04 10:11:02,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=252, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2025-03-04 10:11:02,081 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2025-03-04 10:11:02,081 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 252 flow [2025-03-04 10:11:02,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.0) internal successors, (126), 14 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:02,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:02,081 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:02,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:02,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:02,282 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:02,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:02,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1979563653, now seen corresponding path program 1 times [2025-03-04 10:11:02,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:02,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860192909] [2025-03-04 10:11:02,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:02,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:02,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:11:02,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:11:02,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:02,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:02,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:02,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860192909] [2025-03-04 10:11:02,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860192909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:02,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114354667] [2025-03-04 10:11:02,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:02,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:02,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:02,353 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:02,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:11:02,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:11:02,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:11:02,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:02,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:02,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:02,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:02,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:02,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114354667] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:02,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:02,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:11:02,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486778926] [2025-03-04 10:11:02,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:02,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:11:02,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:02,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:11:02,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:11:02,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 10:11:02,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 252 flow. Second operand has 14 states, 14 states have (on average 9.142857142857142) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:02,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:02,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 10:11:02,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:02,673 INFO L124 PetriNetUnfolderBase]: 347/608 cut-off events. [2025-03-04 10:11:02,674 INFO L125 PetriNetUnfolderBase]: For 1487/1543 co-relation queries the response was YES. [2025-03-04 10:11:02,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2274 conditions, 608 events. 347/608 cut-off events. For 1487/1543 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2400 event pairs, 191 based on Foata normal form. 11/618 useless extension candidates. Maximal degree in co-relation 1282. Up to 352 conditions per place. [2025-03-04 10:11:02,677 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 58 selfloop transitions, 13 changer transitions 0/73 dead transitions. [2025-03-04 10:11:02,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 570 flow [2025-03-04 10:11:02,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:11:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:11:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2025-03-04 10:11:02,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-03-04 10:11:02,679 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 252 flow. Second operand 8 states and 114 transitions. [2025-03-04 10:11:02,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 570 flow [2025-03-04 10:11:02,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 555 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:02,682 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 321 flow [2025-03-04 10:11:02,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=321, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2025-03-04 10:11:02,682 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2025-03-04 10:11:02,682 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 321 flow [2025-03-04 10:11:02,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.142857142857142) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:02,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:02,683 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:02,689 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-04 10:11:02,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 10:11:02,887 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:02,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash -263953470, now seen corresponding path program 2 times [2025-03-04 10:11:02,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:02,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137097019] [2025-03-04 10:11:02,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:02,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:02,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:11:02,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:11:02,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:02,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:11:03,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:03,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137097019] [2025-03-04 10:11:03,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137097019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:03,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122033020] [2025-03-04 10:11:03,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:03,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:03,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:03,062 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:03,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:11:03,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:11:03,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:11:03,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:03,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:03,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:11:03,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:03,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:11:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:03,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:03,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122033020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:03,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:03,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-04 10:11:03,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437941318] [2025-03-04 10:11:03,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:03,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:11:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:03,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:11:03,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:11:03,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 10:11:03,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 321 flow. Second operand has 20 states, 20 states have (on average 7.9) internal successors, (158), 20 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:03,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:03,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 10:11:03,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:04,075 INFO L124 PetriNetUnfolderBase]: 447/765 cut-off events. [2025-03-04 10:11:04,075 INFO L125 PetriNetUnfolderBase]: For 2014/2085 co-relation queries the response was YES. [2025-03-04 10:11:04,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3105 conditions, 765 events. 447/765 cut-off events. For 2014/2085 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3093 event pairs, 69 based on Foata normal form. 32/796 useless extension candidates. Maximal degree in co-relation 1990. Up to 132 conditions per place. [2025-03-04 10:11:04,080 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 109 selfloop transitions, 21 changer transitions 0/132 dead transitions. [2025-03-04 10:11:04,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 132 transitions, 1064 flow [2025-03-04 10:11:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:11:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:11:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 191 transitions. [2025-03-04 10:11:04,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4134199134199134 [2025-03-04 10:11:04,081 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 321 flow. Second operand 14 states and 191 transitions. [2025-03-04 10:11:04,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 132 transitions, 1064 flow [2025-03-04 10:11:04,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 132 transitions, 1036 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:04,089 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 392 flow [2025-03-04 10:11:04,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=392, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2025-03-04 10:11:04,091 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 39 predicate places. [2025-03-04 10:11:04,091 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 392 flow [2025-03-04 10:11:04,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.9) internal successors, (158), 20 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:04,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:04,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:04,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:04,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:04,292 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:04,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash 392184124, now seen corresponding path program 1 times [2025-03-04 10:11:04,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:04,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078618173] [2025-03-04 10:11:04,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:04,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:11:04,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:11:04,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:04,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:04,314 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-04 10:11:04,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:04,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078618173] [2025-03-04 10:11:04,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078618173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:04,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:04,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:11:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568105682] [2025-03-04 10:11:04,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:04,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:11:04,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:04,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:11:04,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:11:04,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-04 10:11:04,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:04,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:04,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-04 10:11:04,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:04,397 INFO L124 PetriNetUnfolderBase]: 375/708 cut-off events. [2025-03-04 10:11:04,398 INFO L125 PetriNetUnfolderBase]: For 2957/3029 co-relation queries the response was YES. [2025-03-04 10:11:04,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3128 conditions, 708 events. 375/708 cut-off events. For 2957/3029 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2978 event pairs, 102 based on Foata normal form. 3/710 useless extension candidates. Maximal degree in co-relation 1936. Up to 489 conditions per place. [2025-03-04 10:11:04,402 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 52 selfloop transitions, 3 changer transitions 6/66 dead transitions. [2025-03-04 10:11:04,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 625 flow [2025-03-04 10:11:04,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:11:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:11:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-04 10:11:04,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2025-03-04 10:11:04,403 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 392 flow. Second operand 3 states and 56 transitions. [2025-03-04 10:11:04,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 625 flow [2025-03-04 10:11:04,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 553 flow, removed 14 selfloop flow, removed 9 redundant places. [2025-03-04 10:11:04,409 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 313 flow [2025-03-04 10:11:04,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=64, 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=313, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2025-03-04 10:11:04,410 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2025-03-04 10:11:04,411 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 313 flow [2025-03-04 10:11:04,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:04,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:04,411 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:04,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:11:04,412 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:04,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:04,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1590074412, now seen corresponding path program 2 times [2025-03-04 10:11:04,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:04,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019774421] [2025-03-04 10:11:04,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:04,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:04,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:11:04,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:11:04,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:04,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:11:04,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:04,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019774421] [2025-03-04 10:11:04,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019774421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:04,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286191650] [2025-03-04 10:11:04,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:04,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:04,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:04,532 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:04,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:11:04,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:11:04,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:11:04,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:04,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:04,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:11:04,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:04,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:04,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 10:11:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:04,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286191650] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:04,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:04,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-04 10:11:04,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937995579] [2025-03-04 10:11:04,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:04,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:11:04,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:04,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:11:04,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:11:04,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 10:11:04,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 313 flow. Second operand has 20 states, 20 states have (on average 9.2) internal successors, (184), 20 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:04,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:04,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 10:11:04,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:05,440 INFO L124 PetriNetUnfolderBase]: 506/851 cut-off events. [2025-03-04 10:11:05,440 INFO L125 PetriNetUnfolderBase]: For 2483/2557 co-relation queries the response was YES. [2025-03-04 10:11:05,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3528 conditions, 851 events. 506/851 cut-off events. For 2483/2557 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3434 event pairs, 92 based on Foata normal form. 34/883 useless extension candidates. Maximal degree in co-relation 2541. Up to 167 conditions per place. [2025-03-04 10:11:05,445 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 109 selfloop transitions, 18 changer transitions 0/131 dead transitions. [2025-03-04 10:11:05,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 131 transitions, 1099 flow [2025-03-04 10:11:05,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:11:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:11:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 192 transitions. [2025-03-04 10:11:05,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4155844155844156 [2025-03-04 10:11:05,447 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 313 flow. Second operand 14 states and 192 transitions. [2025-03-04 10:11:05,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 131 transitions, 1099 flow [2025-03-04 10:11:05,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 131 transitions, 1001 flow, removed 24 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:05,452 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 345 flow [2025-03-04 10:11:05,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=345, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2025-03-04 10:11:05,452 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 39 predicate places. [2025-03-04 10:11:05,453 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 345 flow [2025-03-04 10:11:05,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.2) internal successors, (184), 20 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:05,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:05,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:05,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:05,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:05,654 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:05,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash 367869208, now seen corresponding path program 1 times [2025-03-04 10:11:05,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:05,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444067176] [2025-03-04 10:11:05,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:05,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:05,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:11:05,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:11:05,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:05,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:05,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444067176] [2025-03-04 10:11:05,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444067176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:05,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151140927] [2025-03-04 10:11:05,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:05,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:05,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:05,718 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:05,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:11:05,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:11:05,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:11:05,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:05,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:05,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:11:05,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:05,787 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-04 10:11:05,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:05,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151140927] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:05,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:05,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-04 10:11:05,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645114975] [2025-03-04 10:11:05,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:05,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:05,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:05,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:05,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:11:05,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 10:11:05,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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-04 10:11:05,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:05,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 10:11:05,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:05,896 INFO L124 PetriNetUnfolderBase]: 462/808 cut-off events. [2025-03-04 10:11:05,896 INFO L125 PetriNetUnfolderBase]: For 2455/2468 co-relation queries the response was YES. [2025-03-04 10:11:05,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3351 conditions, 808 events. 462/808 cut-off events. For 2455/2468 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3304 event pairs, 130 based on Foata normal form. 34/824 useless extension candidates. Maximal degree in co-relation 2490. Up to 439 conditions per place. [2025-03-04 10:11:05,902 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 53 selfloop transitions, 10 changer transitions 0/67 dead transitions. [2025-03-04 10:11:05,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 67 transitions, 597 flow [2025-03-04 10:11:05,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-03-04 10:11:05,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-03-04 10:11:05,904 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 345 flow. Second operand 5 states and 65 transitions. [2025-03-04 10:11:05,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 67 transitions, 597 flow [2025-03-04 10:11:05,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 67 transitions, 505 flow, removed 15 selfloop flow, removed 11 redundant places. [2025-03-04 10:11:05,908 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 315 flow [2025-03-04 10:11:05,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=315, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2025-03-04 10:11:05,908 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2025-03-04 10:11:05,908 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 315 flow [2025-03-04 10:11:05,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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-04 10:11:05,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:05,909 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:05,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:06,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:11:06,113 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:06,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:06,114 INFO L85 PathProgramCache]: Analyzing trace with hash -401551141, now seen corresponding path program 1 times [2025-03-04 10:11:06,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:06,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022188610] [2025-03-04 10:11:06,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:06,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:06,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:11:06,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:11:06,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:06,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:06,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:06,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022188610] [2025-03-04 10:11:06,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022188610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:06,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329897696] [2025-03-04 10:11:06,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:06,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:06,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:06,169 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:06,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:11:06,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:11:06,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:11:06,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:06,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:06,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:11:06,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:06,245 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-04 10:11:06,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:06,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329897696] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:06,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:06,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-04 10:11:06,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883233096] [2025-03-04 10:11:06,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:06,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:11:06,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:06,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:11:06,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:11:06,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 10:11:06,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 315 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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-04 10:11:06,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:06,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 10:11:06,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:06,371 INFO L124 PetriNetUnfolderBase]: 416/730 cut-off events. [2025-03-04 10:11:06,371 INFO L125 PetriNetUnfolderBase]: For 2227/2243 co-relation queries the response was YES. [2025-03-04 10:11:06,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2896 conditions, 730 events. 416/730 cut-off events. For 2227/2243 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2982 event pairs, 120 based on Foata normal form. 28/740 useless extension candidates. Maximal degree in co-relation 2241. Up to 383 conditions per place. [2025-03-04 10:11:06,375 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 48 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2025-03-04 10:11:06,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 530 flow [2025-03-04 10:11:06,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-03-04 10:11:06,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2025-03-04 10:11:06,376 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 315 flow. Second operand 5 states and 64 transitions. [2025-03-04 10:11:06,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 530 flow [2025-03-04 10:11:06,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 507 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:06,379 INFO L231 Difference]: Finished difference. Result has 69 places, 49 transitions, 324 flow [2025-03-04 10:11:06,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2025-03-04 10:11:06,381 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2025-03-04 10:11:06,381 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 324 flow [2025-03-04 10:11:06,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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-04 10:11:06,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:06,381 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] [2025-03-04 10:11:06,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:11:06,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:11:06,583 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:06,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:06,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1632674432, now seen corresponding path program 1 times [2025-03-04 10:11:06,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:06,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031001993] [2025-03-04 10:11:06,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:06,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:06,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:11:06,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:06,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:06,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:06,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:06,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031001993] [2025-03-04 10:11:06,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031001993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:06,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926561635] [2025-03-04 10:11:06,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:06,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:06,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:06,799 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:06,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:11:06,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:11:06,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:06,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:06,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:06,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:11:06,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:06,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:06,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:06,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2025-03-04 10:11:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926561635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:06,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:06,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-03-04 10:11:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539157301] [2025-03-04 10:11:06,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:06,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:11:06,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:06,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:11:06,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:11:06,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-04 10:11:06,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 324 flow. Second operand has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:06,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:06,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-04 10:11:06,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:07,210 INFO L124 PetriNetUnfolderBase]: 427/853 cut-off events. [2025-03-04 10:11:07,210 INFO L125 PetriNetUnfolderBase]: For 2468/2499 co-relation queries the response was YES. [2025-03-04 10:11:07,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3409 conditions, 853 events. 427/853 cut-off events. For 2468/2499 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4175 event pairs, 50 based on Foata normal form. 4/857 useless extension candidates. Maximal degree in co-relation 2483. Up to 468 conditions per place. [2025-03-04 10:11:07,214 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 66 selfloop transitions, 31 changer transitions 16/122 dead transitions. [2025-03-04 10:11:07,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 122 transitions, 984 flow [2025-03-04 10:11:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:11:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:11:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2025-03-04 10:11:07,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45179063360881544 [2025-03-04 10:11:07,216 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 324 flow. Second operand 11 states and 164 transitions. [2025-03-04 10:11:07,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 122 transitions, 984 flow [2025-03-04 10:11:07,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 122 transitions, 954 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:07,222 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 640 flow [2025-03-04 10:11:07,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=640, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2025-03-04 10:11:07,224 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 49 predicate places. [2025-03-04 10:11:07,224 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 640 flow [2025-03-04 10:11:07,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:07,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:07,225 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] [2025-03-04 10:11:07,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:07,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:11:07,425 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:07,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:07,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1527661748, now seen corresponding path program 2 times [2025-03-04 10:11:07,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:07,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438685752] [2025-03-04 10:11:07,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:07,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:07,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:07,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:07,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:07,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:07,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:07,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:07,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438685752] [2025-03-04 10:11:07,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438685752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:07,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330689154] [2025-03-04 10:11:07,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:07,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:07,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:07,552 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:07,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:11:07,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:07,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:07,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:07,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:07,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:11:07,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:07,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:07,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:07,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 14 [2025-03-04 10:11:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:07,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330689154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:07,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:07,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 13 [2025-03-04 10:11:07,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353832246] [2025-03-04 10:11:07,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:07,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:11:07,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:07,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:11:07,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:11:07,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-04 10:11:07,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 640 flow. Second operand has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:07,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:07,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-04 10:11:07,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:07,978 INFO L124 PetriNetUnfolderBase]: 432/869 cut-off events. [2025-03-04 10:11:07,978 INFO L125 PetriNetUnfolderBase]: For 3370/3401 co-relation queries the response was YES. [2025-03-04 10:11:07,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3875 conditions, 869 events. 432/869 cut-off events. For 3370/3401 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4409 event pairs, 104 based on Foata normal form. 6/873 useless extension candidates. Maximal degree in co-relation 3450. Up to 606 conditions per place. [2025-03-04 10:11:07,983 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 67 selfloop transitions, 25 changer transitions 11/112 dead transitions. [2025-03-04 10:11:07,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 112 transitions, 1116 flow [2025-03-04 10:11:07,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:11:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:11:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2025-03-04 10:11:07,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-04 10:11:07,985 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 640 flow. Second operand 8 states and 116 transitions. [2025-03-04 10:11:07,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 112 transitions, 1116 flow [2025-03-04 10:11:07,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 112 transitions, 1093 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:07,993 INFO L231 Difference]: Finished difference. Result has 94 places, 86 transitions, 824 flow [2025-03-04 10:11:07,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=824, PETRI_PLACES=94, PETRI_TRANSITIONS=86} [2025-03-04 10:11:07,993 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 60 predicate places. [2025-03-04 10:11:07,993 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 86 transitions, 824 flow [2025-03-04 10:11:07,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:07,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:07,994 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] [2025-03-04 10:11:08,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:11:08,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:11:08,194 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:08,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:08,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1850779638, now seen corresponding path program 3 times [2025-03-04 10:11:08,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:08,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673914995] [2025-03-04 10:11:08,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:08,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:08,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-03-04 10:11:08,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 22 statements. [2025-03-04 10:11:08,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:08,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:08,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:08,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673914995] [2025-03-04 10:11:08,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673914995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:08,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269812285] [2025-03-04 10:11:08,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:08,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:08,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:08,369 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:08,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:11:08,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-03-04 10:11:08,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 22 statements. [2025-03-04 10:11:08,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:08,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:08,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:11:08,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:08,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:08,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:08,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 14 [2025-03-04 10:11:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:08,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269812285] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:08,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:08,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 13 [2025-03-04 10:11:08,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457231398] [2025-03-04 10:11:08,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:08,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:11:08,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:08,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:11:08,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:11:08,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-04 10:11:08,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 86 transitions, 824 flow. Second operand has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:08,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:08,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-04 10:11:08,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:08,791 INFO L124 PetriNetUnfolderBase]: 464/933 cut-off events. [2025-03-04 10:11:08,792 INFO L125 PetriNetUnfolderBase]: For 4670/4708 co-relation queries the response was YES. [2025-03-04 10:11:08,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4447 conditions, 933 events. 464/933 cut-off events. For 4670/4708 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4876 event pairs, 111 based on Foata normal form. 6/939 useless extension candidates. Maximal degree in co-relation 4012. Up to 664 conditions per place. [2025-03-04 10:11:08,797 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 78 selfloop transitions, 23 changer transitions 12/122 dead transitions. [2025-03-04 10:11:08,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 122 transitions, 1319 flow [2025-03-04 10:11:08,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:11:08,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:11:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2025-03-04 10:11:08,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4208754208754209 [2025-03-04 10:11:08,800 INFO L175 Difference]: Start difference. First operand has 94 places, 86 transitions, 824 flow. Second operand 9 states and 125 transitions. [2025-03-04 10:11:08,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 122 transitions, 1319 flow [2025-03-04 10:11:08,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 122 transitions, 1296 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:08,809 INFO L231 Difference]: Finished difference. Result has 104 places, 94 transitions, 961 flow [2025-03-04 10:11:08,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=961, PETRI_PLACES=104, PETRI_TRANSITIONS=94} [2025-03-04 10:11:08,810 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 70 predicate places. [2025-03-04 10:11:08,811 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 94 transitions, 961 flow [2025-03-04 10:11:08,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:08,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:08,811 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] [2025-03-04 10:11:08,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:11:09,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:11:09,012 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:09,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash 578739278, now seen corresponding path program 4 times [2025-03-04 10:11:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:09,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980399104] [2025-03-04 10:11:09,012 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:09,018 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:09,025 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:09,027 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:09,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:09,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980399104] [2025-03-04 10:11:09,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980399104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001300950] [2025-03-04 10:11:09,307 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:09,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:09,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:09,309 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:09,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:11:09,345 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:09,359 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:09,359 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:09,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:09,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:11:09,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:09,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:09,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:09,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 14 [2025-03-04 10:11:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:09,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001300950] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:09,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:09,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2025-03-04 10:11:09,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962198504] [2025-03-04 10:11:09,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:09,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:11:09,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:09,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:11:09,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:11:09,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-04 10:11:09,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 94 transitions, 961 flow. Second operand has 15 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:09,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:09,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-04 10:11:09,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:09,783 INFO L124 PetriNetUnfolderBase]: 492/981 cut-off events. [2025-03-04 10:11:09,784 INFO L125 PetriNetUnfolderBase]: For 6576/6617 co-relation queries the response was YES. [2025-03-04 10:11:09,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5012 conditions, 981 events. 492/981 cut-off events. For 6576/6617 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5247 event pairs, 120 based on Foata normal form. 2/981 useless extension candidates. Maximal degree in co-relation 4550. Up to 716 conditions per place. [2025-03-04 10:11:09,791 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 84 selfloop transitions, 24 changer transitions 11/128 dead transitions. [2025-03-04 10:11:09,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 128 transitions, 1514 flow [2025-03-04 10:11:09,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:11:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:11:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2025-03-04 10:11:09,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4208754208754209 [2025-03-04 10:11:09,793 INFO L175 Difference]: Start difference. First operand has 104 places, 94 transitions, 961 flow. Second operand 9 states and 125 transitions. [2025-03-04 10:11:09,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 128 transitions, 1514 flow [2025-03-04 10:11:09,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 128 transitions, 1469 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:09,806 INFO L231 Difference]: Finished difference. Result has 114 places, 103 transitions, 1125 flow [2025-03-04 10:11:09,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1125, PETRI_PLACES=114, PETRI_TRANSITIONS=103} [2025-03-04 10:11:09,806 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 80 predicate places. [2025-03-04 10:11:09,806 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 103 transitions, 1125 flow [2025-03-04 10:11:09,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:09,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:09,808 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] [2025-03-04 10:11:09,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:10,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:10,008 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:10,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:10,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1641129982, now seen corresponding path program 5 times [2025-03-04 10:11:10,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:10,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947061705] [2025-03-04 10:11:10,009 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:10,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:10,014 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-03-04 10:11:10,021 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:10,022 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:11:10,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:10,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:10,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947061705] [2025-03-04 10:11:10,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947061705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:10,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752457302] [2025-03-04 10:11:10,235 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:10,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:10,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:10,237 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:10,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:11:10,276 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-03-04 10:11:10,290 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:10,290 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:11:10,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:10,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:11:10,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:10,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:11:10,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752457302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:10,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:11:10,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 12 [2025-03-04 10:11:10,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057767753] [2025-03-04 10:11:10,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:10,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:11:10,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:10,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:11:10,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:11:10,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-04 10:11:10,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 103 transitions, 1125 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:10,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:10,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-04 10:11:10,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:10,512 INFO L124 PetriNetUnfolderBase]: 475/953 cut-off events. [2025-03-04 10:11:10,513 INFO L125 PetriNetUnfolderBase]: For 7036/7083 co-relation queries the response was YES. [2025-03-04 10:11:10,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 953 events. 475/953 cut-off events. For 7036/7083 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5028 event pairs, 94 based on Foata normal form. 2/955 useless extension candidates. Maximal degree in co-relation 4551. Up to 641 conditions per place. [2025-03-04 10:11:10,520 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 86 selfloop transitions, 22 changer transitions 14/129 dead transitions. [2025-03-04 10:11:10,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 129 transitions, 1610 flow [2025-03-04 10:11:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2025-03-04 10:11:10,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45021645021645024 [2025-03-04 10:11:10,522 INFO L175 Difference]: Start difference. First operand has 114 places, 103 transitions, 1125 flow. Second operand 7 states and 104 transitions. [2025-03-04 10:11:10,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 129 transitions, 1610 flow [2025-03-04 10:11:10,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 129 transitions, 1538 flow, removed 24 selfloop flow, removed 5 redundant places. [2025-03-04 10:11:10,537 INFO L231 Difference]: Finished difference. Result has 118 places, 100 transitions, 1097 flow [2025-03-04 10:11:10,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1097, PETRI_PLACES=118, PETRI_TRANSITIONS=100} [2025-03-04 10:11:10,538 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 84 predicate places. [2025-03-04 10:11:10,538 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 100 transitions, 1097 flow [2025-03-04 10:11:10,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:10,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:10,539 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:10,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:11:10,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:10,743 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:10,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:10,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2076073573, now seen corresponding path program 6 times [2025-03-04 10:11:10,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:10,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657802514] [2025-03-04 10:11:10,744 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:11:10,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:10,748 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-03-04 10:11:10,752 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 27 statements. [2025-03-04 10:11:10,753 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:11:10,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:11:10,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:10,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657802514] [2025-03-04 10:11:10,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657802514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:10,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370170903] [2025-03-04 10:11:10,897 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:11:10,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:10,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:10,899 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:10,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:11:10,939 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-03-04 10:11:10,962 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 27 statements. [2025-03-04 10:11:10,962 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:11:10,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:10,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:11:10,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:10,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:11:11,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2025-03-04 10:11:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:11:11,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:11:11,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370170903] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:11,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:11,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2025-03-04 10:11:11,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446553499] [2025-03-04 10:11:11,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:11,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:11:11,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:11,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:11:11,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:11:11,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 10:11:11,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 100 transitions, 1097 flow. Second operand has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:11,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:11,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 10:11:11,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:11,492 INFO L124 PetriNetUnfolderBase]: 514/907 cut-off events. [2025-03-04 10:11:11,493 INFO L125 PetriNetUnfolderBase]: For 6942/6980 co-relation queries the response was YES. [2025-03-04 10:11:11,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5038 conditions, 907 events. 514/907 cut-off events. For 6942/6980 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4226 event pairs, 75 based on Foata normal form. 57/963 useless extension candidates. Maximal degree in co-relation 4974. Up to 362 conditions per place. [2025-03-04 10:11:11,501 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 109 selfloop transitions, 21 changer transitions 0/134 dead transitions. [2025-03-04 10:11:11,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 134 transitions, 1699 flow [2025-03-04 10:11:11,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:11:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:11:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2025-03-04 10:11:11,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2025-03-04 10:11:11,503 INFO L175 Difference]: Start difference. First operand has 118 places, 100 transitions, 1097 flow. Second operand 9 states and 103 transitions. [2025-03-04 10:11:11,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 134 transitions, 1699 flow [2025-03-04 10:11:11,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 134 transitions, 1589 flow, removed 27 selfloop flow, removed 11 redundant places. [2025-03-04 10:11:11,517 INFO L231 Difference]: Finished difference. Result has 107 places, 99 transitions, 1047 flow [2025-03-04 10:11:11,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1047, PETRI_PLACES=107, PETRI_TRANSITIONS=99} [2025-03-04 10:11:11,517 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 73 predicate places. [2025-03-04 10:11:11,517 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 99 transitions, 1047 flow [2025-03-04 10:11:11,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:11,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:11,518 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:11,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:11,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:11,722 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:11,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1900155438, now seen corresponding path program 7 times [2025-03-04 10:11:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:11,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838812899] [2025-03-04 10:11:11,723 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:11:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:11,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:11:11,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:11:11,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:11,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:11:11,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:11,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838812899] [2025-03-04 10:11:11,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838812899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:11,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636657564] [2025-03-04 10:11:11,811 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:11:11,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:11,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:11,813 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:11,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:11:11,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:11:11,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:11:11,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:11,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:11,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:11:11,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:11:11,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:11,984 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:11:11,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636657564] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:11,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:11:11,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-03-04 10:11:11,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371803463] [2025-03-04 10:11:11,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:11,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:11:11,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:11,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:11:11,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:11:11,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 10:11:11,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 99 transitions, 1047 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:11,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:11,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 10:11:11,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:12,102 INFO L124 PetriNetUnfolderBase]: 419/780 cut-off events. [2025-03-04 10:11:12,103 INFO L125 PetriNetUnfolderBase]: For 6197/6201 co-relation queries the response was YES. [2025-03-04 10:11:12,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4279 conditions, 780 events. 419/780 cut-off events. For 6197/6201 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3515 event pairs, 86 based on Foata normal form. 44/823 useless extension candidates. Maximal degree in co-relation 4220. Up to 348 conditions per place. [2025-03-04 10:11:12,108 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 95 selfloop transitions, 20 changer transitions 0/119 dead transitions. [2025-03-04 10:11:12,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 119 transitions, 1470 flow [2025-03-04 10:11:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2025-03-04 10:11:12,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-03-04 10:11:12,112 INFO L175 Difference]: Start difference. First operand has 107 places, 99 transitions, 1047 flow. Second operand 7 states and 91 transitions. [2025-03-04 10:11:12,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 119 transitions, 1470 flow [2025-03-04 10:11:12,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 119 transitions, 1386 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 10:11:12,122 INFO L231 Difference]: Finished difference. Result has 104 places, 98 transitions, 1012 flow [2025-03-04 10:11:12,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1012, PETRI_PLACES=104, PETRI_TRANSITIONS=98} [2025-03-04 10:11:12,123 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 70 predicate places. [2025-03-04 10:11:12,123 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 98 transitions, 1012 flow [2025-03-04 10:11:12,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:12,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:12,124 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:12,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:12,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:11:12,325 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:12,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:12,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1689028970, now seen corresponding path program 8 times [2025-03-04 10:11:12,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:12,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087978850] [2025-03-04 10:11:12,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:12,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:12,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:11:12,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:11:12,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:12,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:12,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:12,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087978850] [2025-03-04 10:11:12,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087978850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:12,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133219019] [2025-03-04 10:11:12,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:12,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:12,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:12,667 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:12,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:11:12,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:11:12,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:11:12,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:12,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:12,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 10:11:12,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:12,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:11:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:13,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:11:13,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133219019] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:13,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:13,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 9] total 35 [2025-03-04 10:11:13,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952624163] [2025-03-04 10:11:13,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:13,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:11:13,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:13,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:11:13,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:11:13,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 10:11:13,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 98 transitions, 1012 flow. Second operand has 36 states, 36 states have (on average 8.11111111111111) internal successors, (292), 36 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:13,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:13,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 10:11:13,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:14,897 INFO L124 PetriNetUnfolderBase]: 1087/1846 cut-off events. [2025-03-04 10:11:14,897 INFO L125 PetriNetUnfolderBase]: For 12501/12501 co-relation queries the response was YES. [2025-03-04 10:11:14,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9717 conditions, 1846 events. 1087/1846 cut-off events. For 12501/12501 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8994 event pairs, 20 based on Foata normal form. 1/1847 useless extension candidates. Maximal degree in co-relation 9659. Up to 772 conditions per place. [2025-03-04 10:11:14,908 INFO L140 encePairwiseOnDemand]: 17/33 looper letters, 163 selfloop transitions, 199 changer transitions 1/364 dead transitions. [2025-03-04 10:11:14,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 364 transitions, 3782 flow [2025-03-04 10:11:14,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 10:11:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-04 10:11:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 549 transitions. [2025-03-04 10:11:14,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3465909090909091 [2025-03-04 10:11:14,910 INFO L175 Difference]: Start difference. First operand has 104 places, 98 transitions, 1012 flow. Second operand 48 states and 549 transitions. [2025-03-04 10:11:14,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 364 transitions, 3782 flow [2025-03-04 10:11:14,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 364 transitions, 3674 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-04 10:11:14,929 INFO L231 Difference]: Finished difference. Result has 159 places, 259 transitions, 3323 flow [2025-03-04 10:11:14,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=3323, PETRI_PLACES=159, PETRI_TRANSITIONS=259} [2025-03-04 10:11:14,930 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 125 predicate places. [2025-03-04 10:11:14,930 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 259 transitions, 3323 flow [2025-03-04 10:11:14,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 8.11111111111111) internal successors, (292), 36 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:14,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:14,930 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:14,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:11:15,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:15,134 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:15,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:15,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1956462338, now seen corresponding path program 9 times [2025-03-04 10:11:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:15,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879998943] [2025-03-04 10:11:15,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:15,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:15,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:11:15,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 30 statements. [2025-03-04 10:11:15,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:15,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:11:15,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:15,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879998943] [2025-03-04 10:11:15,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879998943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:15,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728670568] [2025-03-04 10:11:15,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:15,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:15,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:15,408 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:15,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:11:15,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:11:15,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 30 statements. [2025-03-04 10:11:15,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:15,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:15,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 10:11:15,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:15,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:11:15,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-04 10:11:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:11:15,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:15,962 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-03-04 10:11:15,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 35 [2025-03-04 10:11:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:11:16,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728670568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:16,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:16,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 41 [2025-03-04 10:11:16,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105911927] [2025-03-04 10:11:16,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:16,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 10:11:16,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:16,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 10:11:16,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1451, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 10:11:16,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 10:11:16,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 259 transitions, 3323 flow. Second operand has 42 states, 42 states have (on average 7.785714285714286) internal successors, (327), 42 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:16,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:16,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 10:11:16,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:20,080 INFO L124 PetriNetUnfolderBase]: 1973/3315 cut-off events. [2025-03-04 10:11:20,080 INFO L125 PetriNetUnfolderBase]: For 28718/28718 co-relation queries the response was YES. [2025-03-04 10:11:20,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21297 conditions, 3315 events. 1973/3315 cut-off events. For 28718/28718 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 18009 event pairs, 21 based on Foata normal form. 2/3317 useless extension candidates. Maximal degree in co-relation 21226. Up to 1207 conditions per place. [2025-03-04 10:11:20,099 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 312 selfloop transitions, 543 changer transitions 9/865 dead transitions. [2025-03-04 10:11:20,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 865 transitions, 11630 flow [2025-03-04 10:11:20,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-03-04 10:11:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2025-03-04 10:11:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 1099 transitions. [2025-03-04 10:11:20,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32333039129155633 [2025-03-04 10:11:20,101 INFO L175 Difference]: Start difference. First operand has 159 places, 259 transitions, 3323 flow. Second operand 103 states and 1099 transitions. [2025-03-04 10:11:20,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 865 transitions, 11630 flow [2025-03-04 10:11:20,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 865 transitions, 10350 flow, removed 580 selfloop flow, removed 15 redundant places. [2025-03-04 10:11:20,198 INFO L231 Difference]: Finished difference. Result has 266 places, 689 transitions, 9652 flow [2025-03-04 10:11:20,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2790, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=103, PETRI_FLOW=9652, PETRI_PLACES=266, PETRI_TRANSITIONS=689} [2025-03-04 10:11:20,199 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 232 predicate places. [2025-03-04 10:11:20,199 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 689 transitions, 9652 flow [2025-03-04 10:11:20,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 7.785714285714286) internal successors, (327), 42 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:20,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:20,199 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:20,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:11:20,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:20,400 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:20,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:20,400 INFO L85 PathProgramCache]: Analyzing trace with hash -801616714, now seen corresponding path program 10 times [2025-03-04 10:11:20,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:20,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166557519] [2025-03-04 10:11:20,400 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:20,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:20,404 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:11:20,416 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:11:20,416 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:20,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:20,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:20,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166557519] [2025-03-04 10:11:20,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166557519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:20,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257130733] [2025-03-04 10:11:20,900 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:20,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:20,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:20,902 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:20,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:11:20,944 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:11:20,963 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:11:20,963 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:20,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:20,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 10:11:20,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:11:21,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:21,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:21,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2025-03-04 10:11:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:11:21,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257130733] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:21,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:21,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 9] total 32 [2025-03-04 10:11:21,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885240695] [2025-03-04 10:11:21,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:21,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 10:11:21,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:21,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 10:11:21,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=913, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 10:11:21,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 10:11:21,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 689 transitions, 9652 flow. Second operand has 33 states, 33 states have (on average 8.212121212121213) internal successors, (271), 33 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:21,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:21,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 10:11:21,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:23,236 INFO L124 PetriNetUnfolderBase]: 2884/4808 cut-off events. [2025-03-04 10:11:23,236 INFO L125 PetriNetUnfolderBase]: For 44199/44199 co-relation queries the response was YES. [2025-03-04 10:11:23,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34290 conditions, 4808 events. 2884/4808 cut-off events. For 44199/44199 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 27958 event pairs, 40 based on Foata normal form. 2/4810 useless extension candidates. Maximal degree in co-relation 34206. Up to 1865 conditions per place. [2025-03-04 10:11:23,276 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 533 selfloop transitions, 621 changer transitions 5/1160 dead transitions. [2025-03-04 10:11:23,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 1160 transitions, 18313 flow [2025-03-04 10:11:23,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 10:11:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-04 10:11:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 513 transitions. [2025-03-04 10:11:23,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35330578512396693 [2025-03-04 10:11:23,278 INFO L175 Difference]: Start difference. First operand has 266 places, 689 transitions, 9652 flow. Second operand 44 states and 513 transitions. [2025-03-04 10:11:23,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 1160 transitions, 18313 flow [2025-03-04 10:11:23,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 1160 transitions, 16500 flow, removed 848 selfloop flow, removed 13 redundant places. [2025-03-04 10:11:23,636 INFO L231 Difference]: Finished difference. Result has 313 places, 974 transitions, 14790 flow [2025-03-04 10:11:23,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=8395, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=388, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=14790, PETRI_PLACES=313, PETRI_TRANSITIONS=974} [2025-03-04 10:11:23,637 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 279 predicate places. [2025-03-04 10:11:23,637 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 974 transitions, 14790 flow [2025-03-04 10:11:23,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.212121212121213) internal successors, (271), 33 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:23,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:23,637 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:23,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:23,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:23,838 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:23,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:23,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1625781078, now seen corresponding path program 11 times [2025-03-04 10:11:23,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:23,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376904304] [2025-03-04 10:11:23,839 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:23,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:23,843 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:11:23,850 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:11:23,850 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:11:23,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:24,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376904304] [2025-03-04 10:11:24,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376904304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590620738] [2025-03-04 10:11:24,169 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:24,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:24,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:24,171 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:24,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:11:24,210 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:11:24,229 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:11:24,229 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:11:24,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:24,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 10:11:24,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:11:24,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:24,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:24,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2025-03-04 10:11:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:11:24,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590620738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:24,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:24,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 27 [2025-03-04 10:11:24,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443790820] [2025-03-04 10:11:24,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:24,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:11:24,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:24,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:11:24,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:11:24,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-04 10:11:24,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 974 transitions, 14790 flow. Second operand has 28 states, 28 states have (on average 10.071428571428571) internal successors, (282), 28 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:24,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:24,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-04 10:11:24,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:25,876 INFO L124 PetriNetUnfolderBase]: 2645/4675 cut-off events. [2025-03-04 10:11:25,877 INFO L125 PetriNetUnfolderBase]: For 58435/58564 co-relation queries the response was YES. [2025-03-04 10:11:25,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36769 conditions, 4675 events. 2645/4675 cut-off events. For 58435/58564 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 29613 event pairs, 89 based on Foata normal form. 53/4697 useless extension candidates. Maximal degree in co-relation 36667. Up to 3357 conditions per place. [2025-03-04 10:11:25,922 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 699 selfloop transitions, 113 changer transitions 1/1059 dead transitions. [2025-03-04 10:11:25,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 1059 transitions, 17525 flow [2025-03-04 10:11:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:11:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:11:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 201 transitions. [2025-03-04 10:11:25,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2025-03-04 10:11:25,924 INFO L175 Difference]: Start difference. First operand has 313 places, 974 transitions, 14790 flow. Second operand 15 states and 201 transitions. [2025-03-04 10:11:25,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 1059 transitions, 17525 flow [2025-03-04 10:11:26,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 1059 transitions, 16807 flow, removed 295 selfloop flow, removed 18 redundant places. [2025-03-04 10:11:26,494 INFO L231 Difference]: Finished difference. Result has 312 places, 1019 transitions, 15245 flow [2025-03-04 10:11:26,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=14125, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=974, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=869, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=15245, PETRI_PLACES=312, PETRI_TRANSITIONS=1019} [2025-03-04 10:11:26,495 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 278 predicate places. [2025-03-04 10:11:26,495 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 1019 transitions, 15245 flow [2025-03-04 10:11:26,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.071428571428571) internal successors, (282), 28 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:26,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:26,495 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:26,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:11:26,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 10:11:26,697 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:26,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1151577998, now seen corresponding path program 12 times [2025-03-04 10:11:26,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121744216] [2025-03-04 10:11:26,698 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:11:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:26,702 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:11:26,708 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-03-04 10:11:26,709 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:11:26,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:11:26,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:26,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121744216] [2025-03-04 10:11:26,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121744216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:26,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128653824] [2025-03-04 10:11:26,899 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:11:26,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:26,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:26,901 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:26,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:11:26,948 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:11:26,967 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-03-04 10:11:26,967 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:11:26,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:26,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 10:11:26,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:11:27,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:27,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:27,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2025-03-04 10:11:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:11:27,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128653824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:27,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:27,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-04 10:11:27,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835023896] [2025-03-04 10:11:27,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:27,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:11:27,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:27,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:11:27,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:11:27,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-04 10:11:27,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 1019 transitions, 15245 flow. Second operand has 20 states, 20 states have (on average 10.0) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:27,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:27,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-04 10:11:27,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:28,452 INFO L124 PetriNetUnfolderBase]: 2962/5208 cut-off events. [2025-03-04 10:11:28,453 INFO L125 PetriNetUnfolderBase]: For 64093/64222 co-relation queries the response was YES. [2025-03-04 10:11:28,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41047 conditions, 5208 events. 2962/5208 cut-off events. For 64093/64222 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 33299 event pairs, 95 based on Foata normal form. 62/5246 useless extension candidates. Maximal degree in co-relation 40941. Up to 3617 conditions per place. [2025-03-04 10:11:28,505 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 744 selfloop transitions, 173 changer transitions 2/1165 dead transitions. [2025-03-04 10:11:28,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 1165 transitions, 19333 flow [2025-03-04 10:11:28,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:11:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 10:11:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 243 transitions. [2025-03-04 10:11:28,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-04 10:11:28,506 INFO L175 Difference]: Start difference. First operand has 312 places, 1019 transitions, 15245 flow. Second operand 18 states and 243 transitions. [2025-03-04 10:11:28,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 1165 transitions, 19333 flow [2025-03-04 10:11:29,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 1165 transitions, 19287 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 10:11:29,076 INFO L231 Difference]: Finished difference. Result has 332 places, 1131 transitions, 17953 flow [2025-03-04 10:11:29,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=15199, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=884, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=17953, PETRI_PLACES=332, PETRI_TRANSITIONS=1131} [2025-03-04 10:11:29,077 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 298 predicate places. [2025-03-04 10:11:29,077 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 1131 transitions, 17953 flow [2025-03-04 10:11:29,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.0) internal successors, (200), 20 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:29,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:29,077 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:29,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:29,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 10:11:29,278 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:29,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:29,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2013499456, now seen corresponding path program 13 times [2025-03-04 10:11:29,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:29,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897805888] [2025-03-04 10:11:29,278 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:11:29,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:29,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:11:29,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:11:29,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:29,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:29,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:29,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897805888] [2025-03-04 10:11:29,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897805888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:29,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881302087] [2025-03-04 10:11:29,756 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:11:29,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:29,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:29,758 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:29,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:11:29,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:11:29,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:11:29,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:29,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:29,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:11:29,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:11:29,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:30,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:30,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2025-03-04 10:11:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:11:30,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881302087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:30,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:30,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-03-04 10:11:30,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701040537] [2025-03-04 10:11:30,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:30,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 10:11:30,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:30,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 10:11:30,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:11:30,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-04 10:11:30,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 1131 transitions, 17953 flow. Second operand has 30 states, 30 states have (on average 8.933333333333334) internal successors, (268), 30 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:30,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:30,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-04 10:11:30,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:32,293 INFO L124 PetriNetUnfolderBase]: 3393/5791 cut-off events. [2025-03-04 10:11:32,293 INFO L125 PetriNetUnfolderBase]: For 76444/76577 co-relation queries the response was YES. [2025-03-04 10:11:32,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47314 conditions, 5791 events. 3393/5791 cut-off events. For 76444/76577 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 36068 event pairs, 92 based on Foata normal form. 74/5846 useless extension candidates. Maximal degree in co-relation 47201. Up to 4585 conditions per place. [2025-03-04 10:11:32,359 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 939 selfloop transitions, 163 changer transitions 1/1255 dead transitions. [2025-03-04 10:11:32,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 1255 transitions, 22120 flow [2025-03-04 10:11:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:11:32,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 10:11:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 292 transitions. [2025-03-04 10:11:32,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3686868686868687 [2025-03-04 10:11:32,360 INFO L175 Difference]: Start difference. First operand has 332 places, 1131 transitions, 17953 flow. Second operand 24 states and 292 transitions. [2025-03-04 10:11:32,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 1255 transitions, 22120 flow [2025-03-04 10:11:33,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1255 transitions, 21621 flow, removed 213 selfloop flow, removed 6 redundant places. [2025-03-04 10:11:33,079 INFO L231 Difference]: Finished difference. Result has 359 places, 1197 transitions, 19414 flow [2025-03-04 10:11:33,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=17454, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=993, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=19414, PETRI_PLACES=359, PETRI_TRANSITIONS=1197} [2025-03-04 10:11:33,083 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 325 predicate places. [2025-03-04 10:11:33,083 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 1197 transitions, 19414 flow [2025-03-04 10:11:33,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.933333333333334) internal successors, (268), 30 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:33,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:33,084 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:33,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 10:11:33,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:11:33,284 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:33,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:33,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1499836450, now seen corresponding path program 14 times [2025-03-04 10:11:33,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:33,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032167571] [2025-03-04 10:11:33,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:33,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:33,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:11:33,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:11:33,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:33,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:11:33,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:33,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032167571] [2025-03-04 10:11:33,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032167571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:33,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:33,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 10:11:33,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542445110] [2025-03-04 10:11:33,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:33,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:11:33,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:33,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:11:33,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:11:33,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 10:11:33,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 1197 transitions, 19414 flow. Second operand has 15 states, 15 states have (on average 7.8) internal successors, (117), 15 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:33,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:33,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 10:11:33,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:35,175 INFO L124 PetriNetUnfolderBase]: 3752/6235 cut-off events. [2025-03-04 10:11:35,176 INFO L125 PetriNetUnfolderBase]: For 80174/80174 co-relation queries the response was YES. [2025-03-04 10:11:35,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51034 conditions, 6235 events. 3752/6235 cut-off events. For 80174/80174 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 37872 event pairs, 106 based on Foata normal form. 1/6236 useless extension candidates. Maximal degree in co-relation 50906. Up to 4646 conditions per place. [2025-03-04 10:11:35,235 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 774 selfloop transitions, 511 changer transitions 3/1289 dead transitions. [2025-03-04 10:11:35,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 1289 transitions, 23265 flow [2025-03-04 10:11:35,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:11:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 10:11:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 210 transitions. [2025-03-04 10:11:35,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35353535353535354 [2025-03-04 10:11:35,237 INFO L175 Difference]: Start difference. First operand has 359 places, 1197 transitions, 19414 flow. Second operand 18 states and 210 transitions. [2025-03-04 10:11:35,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 1289 transitions, 23265 flow [2025-03-04 10:11:35,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 1289 transitions, 22836 flow, removed 181 selfloop flow, removed 10 redundant places. [2025-03-04 10:11:35,998 INFO L231 Difference]: Finished difference. Result has 371 places, 1236 transitions, 21741 flow [2025-03-04 10:11:35,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=18985, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=475, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=21741, PETRI_PLACES=371, PETRI_TRANSITIONS=1236} [2025-03-04 10:11:36,000 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 337 predicate places. [2025-03-04 10:11:36,000 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 1236 transitions, 21741 flow [2025-03-04 10:11:36,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.8) internal successors, (117), 15 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:36,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:36,000 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:36,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 10:11:36,000 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:36,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:36,001 INFO L85 PathProgramCache]: Analyzing trace with hash -258886632, now seen corresponding path program 15 times [2025-03-04 10:11:36,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:36,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123449885] [2025-03-04 10:11:36,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:36,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:36,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:11:36,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 30 statements. [2025-03-04 10:11:36,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:36,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:11:36,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:36,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123449885] [2025-03-04 10:11:36,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123449885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:36,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824407986] [2025-03-04 10:11:36,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:36,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:36,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:36,194 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:36,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:11:36,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:11:36,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 30 statements. [2025-03-04 10:11:36,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:36,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:36,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 10:11:36,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:36,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:11:36,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 10:11:36,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-04 10:11:36,643 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 10:11:36,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:36,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 9 [2025-03-04 10:11:36,657 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:11:36,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:37,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-03-04 10:11:37,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:11:37,241 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 46 [2025-03-04 10:11:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:11:37,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824407986] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:37,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:37,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 39 [2025-03-04 10:11:37,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694015144] [2025-03-04 10:11:37,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:37,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 10:11:37,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:37,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 10:11:37,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1342, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 10:11:37,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 10:11:37,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 1236 transitions, 21741 flow. Second operand has 40 states, 40 states have (on average 7.9) internal successors, (316), 40 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:37,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:37,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 10:11:37,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:42,429 INFO L124 PetriNetUnfolderBase]: 4465/7397 cut-off events. [2025-03-04 10:11:42,429 INFO L125 PetriNetUnfolderBase]: For 114219/114219 co-relation queries the response was YES. [2025-03-04 10:11:42,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65732 conditions, 7397 events. 4465/7397 cut-off events. For 114219/114219 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 46319 event pairs, 89 based on Foata normal form. 2/7399 useless extension candidates. Maximal degree in co-relation 65601. Up to 4128 conditions per place. [2025-03-04 10:11:42,524 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 583 selfloop transitions, 1114 changer transitions 9/1707 dead transitions. [2025-03-04 10:11:42,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 1707 transitions, 33051 flow [2025-03-04 10:11:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-03-04 10:11:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2025-03-04 10:11:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 832 transitions. [2025-03-04 10:11:42,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32323232323232326 [2025-03-04 10:11:42,527 INFO L175 Difference]: Start difference. First operand has 371 places, 1236 transitions, 21741 flow. Second operand 78 states and 832 transitions. [2025-03-04 10:11:42,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 1707 transitions, 33051 flow [2025-03-04 10:11:43,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 1707 transitions, 32887 flow, removed 47 selfloop flow, removed 9 redundant places. [2025-03-04 10:11:43,694 INFO L231 Difference]: Finished difference. Result has 463 places, 1567 transitions, 32904 flow [2025-03-04 10:11:43,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=21590, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=818, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=32904, PETRI_PLACES=463, PETRI_TRANSITIONS=1567} [2025-03-04 10:11:43,695 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 429 predicate places. [2025-03-04 10:11:43,695 INFO L471 AbstractCegarLoop]: Abstraction has has 463 places, 1567 transitions, 32904 flow [2025-03-04 10:11:43,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.9) internal successors, (316), 40 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:43,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:43,695 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:43,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 10:11:43,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:43,896 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:43,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:43,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1548004470, now seen corresponding path program 16 times [2025-03-04 10:11:43,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:43,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752789115] [2025-03-04 10:11:43,896 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:43,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:43,901 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:11:43,906 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:11:43,906 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:43,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:44,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:44,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752789115] [2025-03-04 10:11:44,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752789115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:44,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094174108] [2025-03-04 10:11:44,356 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:44,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:44,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:44,358 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:44,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:11:44,399 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:11:44,414 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:11:44,414 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:44,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:44,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 10:11:44,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:44,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:11:44,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:44,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:44,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2025-03-04 10:11:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:11:44,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094174108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:44,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:44,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 9] total 28 [2025-03-04 10:11:44,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126594274] [2025-03-04 10:11:44,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:44,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 10:11:44,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:44,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 10:11:44,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:11:44,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 10:11:44,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 1567 transitions, 32904 flow. Second operand has 29 states, 29 states have (on average 8.379310344827585) internal successors, (243), 29 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:44,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:44,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 10:11:44,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:49,355 INFO L124 PetriNetUnfolderBase]: 6444/10515 cut-off events. [2025-03-04 10:11:49,356 INFO L125 PetriNetUnfolderBase]: For 210593/210593 co-relation queries the response was YES. [2025-03-04 10:11:49,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107975 conditions, 10515 events. 6444/10515 cut-off events. For 210593/210593 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 66120 event pairs, 190 based on Foata normal form. 25/10540 useless extension candidates. Maximal degree in co-relation 107820. Up to 5617 conditions per place. [2025-03-04 10:11:49,518 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 1180 selfloop transitions, 1222 changer transitions 7/2410 dead transitions. [2025-03-04 10:11:49,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 2410 transitions, 56438 flow [2025-03-04 10:11:49,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-04 10:11:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2025-03-04 10:11:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 615 transitions. [2025-03-04 10:11:49,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3516295025728988 [2025-03-04 10:11:49,521 INFO L175 Difference]: Start difference. First operand has 463 places, 1567 transitions, 32904 flow. Second operand 53 states and 615 transitions. [2025-03-04 10:11:49,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 2410 transitions, 56438 flow [2025-03-04 10:11:53,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 2410 transitions, 54245 flow, removed 1047 selfloop flow, removed 14 redundant places. [2025-03-04 10:11:53,709 INFO L231 Difference]: Finished difference. Result has 522 places, 2219 transitions, 51549 flow [2025-03-04 10:11:53,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=31176, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=691, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=761, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=51549, PETRI_PLACES=522, PETRI_TRANSITIONS=2219} [2025-03-04 10:11:53,710 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 488 predicate places. [2025-03-04 10:11:53,710 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 2219 transitions, 51549 flow [2025-03-04 10:11:53,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.379310344827585) internal successors, (243), 29 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:53,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:53,711 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:53,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 10:11:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:53,911 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:11:53,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:53,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1091037532, now seen corresponding path program 17 times [2025-03-04 10:11:53,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:53,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051032304] [2025-03-04 10:11:53,912 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:53,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:53,917 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:11:53,926 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:11:53,926 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:11:53,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:54,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:54,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051032304] [2025-03-04 10:11:54,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051032304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:54,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494384177] [2025-03-04 10:11:54,249 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:54,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:54,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:54,251 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:11:54,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:11:54,293 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:11:54,310 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:11:54,310 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:11:54,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:54,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 10:11:54,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:54,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:11:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:54,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:54,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 10:11:54,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:11:54,883 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 68 treesize of output 56 [2025-03-04 10:11:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:11:54,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494384177] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:54,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:54,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2025-03-04 10:11:54,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201612818] [2025-03-04 10:11:54,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:54,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 10:11:54,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:54,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 10:11:54,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1228, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 10:11:55,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 10:11:55,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 2219 transitions, 51549 flow. Second operand has 38 states, 38 states have (on average 7.921052631578948) internal successors, (301), 38 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:55,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:55,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 10:11:55,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:01,811 INFO L124 PetriNetUnfolderBase]: 7413/12061 cut-off events. [2025-03-04 10:12:01,811 INFO L125 PetriNetUnfolderBase]: For 278655/278655 co-relation queries the response was YES. [2025-03-04 10:12:01,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132595 conditions, 12061 events. 7413/12061 cut-off events. For 278655/278655 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 77090 event pairs, 212 based on Foata normal form. 1/12062 useless extension candidates. Maximal degree in co-relation 132179. Up to 10806 conditions per place. [2025-03-04 10:12:01,979 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 2404 selfloop transitions, 336 changer transitions 2/2743 dead transitions. [2025-03-04 10:12:01,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 2743 transitions, 69288 flow [2025-03-04 10:12:01,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 10:12:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-04 10:12:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 418 transitions. [2025-03-04 10:12:01,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2025-03-04 10:12:01,980 INFO L175 Difference]: Start difference. First operand has 522 places, 2219 transitions, 51549 flow. Second operand 36 states and 418 transitions. [2025-03-04 10:12:01,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 2743 transitions, 69288 flow [2025-03-04 10:12:07,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 2743 transitions, 66483 flow, removed 1322 selfloop flow, removed 15 redundant places. [2025-03-04 10:12:07,949 INFO L231 Difference]: Finished difference. Result has 568 places, 2564 transitions, 59674 flow [2025-03-04 10:12:07,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=48816, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2000, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=59674, PETRI_PLACES=568, PETRI_TRANSITIONS=2564} [2025-03-04 10:12:07,951 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 534 predicate places. [2025-03-04 10:12:07,951 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 2564 transitions, 59674 flow [2025-03-04 10:12:07,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.921052631578948) internal successors, (301), 38 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:07,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:07,951 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:07,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 10:12:08,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-04 10:12:08,151 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:12:08,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:08,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1439911880, now seen corresponding path program 18 times [2025-03-04 10:12:08,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:08,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713150930] [2025-03-04 10:12:08,152 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:12:08,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:08,156 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:12:08,160 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-03-04 10:12:08,160 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:12:08,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:12:08,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:08,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713150930] [2025-03-04 10:12:08,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713150930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:08,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927490027] [2025-03-04 10:12:08,355 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:12:08,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:08,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:08,357 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:08,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:12:08,402 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:12:08,420 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-03-04 10:12:08,420 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:12:08,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:08,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 10:12:08,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:08,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:12:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:12:08,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:12:08,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927490027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:08,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:08,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 9] total 31 [2025-03-04 10:12:08,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851035669] [2025-03-04 10:12:08,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:08,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:12:08,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:08,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:12:08,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:12:08,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 10:12:08,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 2564 transitions, 59674 flow. Second operand has 32 states, 32 states have (on average 8.15625) internal successors, (261), 32 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:08,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:08,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 10:12:08,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:15,643 INFO L124 PetriNetUnfolderBase]: 8123/13237 cut-off events. [2025-03-04 10:12:15,644 INFO L125 PetriNetUnfolderBase]: For 293510/293510 co-relation queries the response was YES. [2025-03-04 10:12:15,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143491 conditions, 13237 events. 8123/13237 cut-off events. For 293510/293510 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 86666 event pairs, 230 based on Foata normal form. 2/13239 useless extension candidates. Maximal degree in co-relation 143046. Up to 9143 conditions per place. [2025-03-04 10:12:15,857 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 1806 selfloop transitions, 1169 changer transitions 8/2984 dead transitions. [2025-03-04 10:12:15,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 2984 transitions, 74857 flow [2025-03-04 10:12:15,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 10:12:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 10:12:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 347 transitions. [2025-03-04 10:12:15,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3505050505050505 [2025-03-04 10:12:15,859 INFO L175 Difference]: Start difference. First operand has 568 places, 2564 transitions, 59674 flow. Second operand 30 states and 347 transitions. [2025-03-04 10:12:15,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 2984 transitions, 74857 flow [2025-03-04 10:12:22,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 2984 transitions, 73337 flow, removed 756 selfloop flow, removed 3 redundant places. [2025-03-04 10:12:22,706 INFO L231 Difference]: Finished difference. Result has 614 places, 2789 transitions, 68950 flow [2025-03-04 10:12:22,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=58162, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=955, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=68950, PETRI_PLACES=614, PETRI_TRANSITIONS=2789} [2025-03-04 10:12:22,708 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 580 predicate places. [2025-03-04 10:12:22,709 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 2789 transitions, 68950 flow [2025-03-04 10:12:22,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.15625) internal successors, (261), 32 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:22,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:22,709 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:22,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-04 10:12:22,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 10:12:22,909 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:12:22,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:22,910 INFO L85 PathProgramCache]: Analyzing trace with hash 27338492, now seen corresponding path program 19 times [2025-03-04 10:12:22,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:22,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969830612] [2025-03-04 10:12:22,910 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:12:22,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:22,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:12:22,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:12:22,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:22,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:12:23,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969830612] [2025-03-04 10:12:23,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969830612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889480201] [2025-03-04 10:12:23,306 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:12:23,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:23,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:23,308 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:23,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:12:23,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:12:23,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:12:23,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:23,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:23,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:12:23,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:12:23,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:23,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:12:23,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2025-03-04 10:12:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:12:23,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889480201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:23,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:23,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-03-04 10:12:23,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428033401] [2025-03-04 10:12:23,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:23,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 10:12:23,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:23,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 10:12:23,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:12:23,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-04 10:12:23,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 2789 transitions, 68950 flow. Second operand has 30 states, 30 states have (on average 8.1) internal successors, (243), 30 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:23,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:23,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-04 10:12:23,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand